检索结果-内蒙古大学图书馆

Enhanced Dual Reversible Data Hiding Using Combined Approaches

APPLIED SCIENCES-BASEL 2025年第6期15卷

作者： Kim, Cheonshik Yang, Ching-Nung Leng, Lu Sejong Univ Dept Comp Engn Seoul 05006 South Korea Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Hualien 97401 Taiwan Nanchang Hangkong Univ Sch Software Nanchang 330063 Peoples R China

This paper proposes a reversible data hiding technique based on two cover images. The proposed method enhances performance by utilizing Hamming coding (HC), arithmetic coding (AC), and an improved Exploiting Modification Direction (EMD) technique. Since AC provides lossless compression for binary data, it is widely used in image compression and helps maximize the efficiency of data transmission and storage. The EMD technique is recognized as an efficient data hiding method. However, it has a significant limitation: it does not allow for the restoration of the original cover image after data extraction. Additionally, EMD has a data hiding capacity limit of approximately 1.2 bpp. To address these limitations, an improved reversible data hiding technique is proposed. In this study, HC and AC are integrated with an improved EMD technique to enhance data hiding performance, achieving higher embedding capacity while ensuring the complete restoration of the original cover image. In the proposed method, Hamming coding is applied for data encoding and arithmetic coding is used for compression to increase efficiency. The compressed data are then embedded using the improved EMD technique, enabling the receiver to fully restore the original cover image. Experimental results demonstrate that the proposed method achieves an average PSNR of 66 dB and a data embedding capacity of 1.5 bpp, proving to be a promising approach for secure and efficient data hiding applications.

关键词： data hiding (DH) reversible DH (RDH) dual RDH Hamming coding arithmetic coding exploiting modification direction (EMD)

来源：评论

学校读者我要写书评

暂无评论

Separable and high-capacity reversible data hiding for encrypted 3D mesh models based on dual multi-MSB predictions

引用

SIGNAL PROCESSING 2025年 237卷

作者： Ge, Jiacheng Qiu, Yingqiang Chen, Zhisheng Chen, Kaimeng Lin, Xiaodan Dai, Yufeng Huaqiao Univ Coll Informat Sci & Engn Xiamen 361021 Peoples R China Jimei Univ Coll Comp Engn Xiamen 361021 Peoples R China Anhui Mengcheng Secondary Vocat Sch Construct Ind Bozhou 233500 Peoples R China

Three-dimensional (3D) models, essential for building virtual worlds, are encountering growing challenges in privacy and copyright protection as their usage increases. Reversible data hiding (RDH) in encrypted 3D mesh models not only protects the privacy of the original models through encryption but also embeds additional data for covert communication or access control. This paper proposes a high-capacity, separable RDH method for encrypted 3D models. The approach utilizes integer mapping and incorporates an enhanced dual multiple most significant bit (multi-MSB) prediction strategy to maximize embedding capacity. First, each vertex coordinate is scaled to a decimal value within a predefined range. These values are then encoded into binary digits using integer mapping, with the number of digits determined by a compression threshold. Subsequently, all vertices are processed to identify redundant data that served as embedding room using a multi-MSB self-prediction algorithm, significantly increasing the embedding capacity. Next, after disregarding the redundancy in the MSBs of each vertex, the vertices are classified into an embeddable set and a reference set. The embeddable vertices are then further processed to create additional embedding room through secondary multi-MSB prediction. The auxiliary data, compressed using arithmetic coding, is embedded into the multi-MSB of each encrypted vertex, resulting in encrypted vertices that contain both the auxiliary data and available embedding room. Using the auxiliary data, encrypted additional data is embedded into the reserved embedding room within the multi-MSB of each vertex through bit substitution. Finally, the embedded data can be extracted without errors, and the original 3D mesh can be recovered losslessly. The experimental results demonstrate that the proposed method is highly effective, achieving superior embedding capacity compared to several state-of-the-art methods.

关键词： Integer mapping Multi-MSB self-prediction Multi-MSB prediction arithmetic coding Reversible data hiding Encrypted three-dimensional model

来源：评论

学校读者我要写书评

暂无评论

GLS coding based security solution to JPEG with the structure of aggregated compression and encryption

引用

COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION 2014年第5期19卷 1366-1374页

作者： Zhang, Yushu Xiao, Di Liu, Hong Nan, Hai Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Chongqing Univ Posts & Telecommun Coll Software Engn Chongqing 400065 Peoples R China

There exists close relation among chaos, coding and cryptography. All the three can be combined into a whole as aggregated chaos-based coding and cryptography (ATC) to compress and encrypt data simultaneously. In particular, image data own high redundancy and wide transmission and thereby it is well worth doing research on ATC for image, which is very helpful to real application. JPEG with high compression ratio has not provided security. If JPEG is incorporated into powerful cryptographic features, its application can be further extended. For this reason, in this paper, GLS coding as a special form of ATC, which attains synchronous compression and encryption, is used to modify JPEG and fill its gap. An image is first initialized using DCT, quantization and run-length coding in turn, just as JPEG. Then, it is encoded and encrypted simultaneously by utilizing GLS coding and binary keystream resulting from the chaotic generator. Results demonstrate that our scheme can not only achieve good compression performance but also resist known/chosen-plaintext attacks efficiently. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Aggregated chaos-based compression and encryption GLS arithmetic coding DCT Quantization Run-length coding

来源：评论

学校读者我要写书评

暂无评论

Analysis of Bit-Plane Probability for Generalized Gaussian Distribution and its Application in Audio coding

引用

IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING 2012年第4期20卷 1167-1176页

作者： Shu, Haiyan Huang, Haibin Rahardja, Susanto ASTAR Inst Infocomm Res Singapore 138632 Singapore

Bit-plane probability of data is useful information for many applications such as entropy coding and rate estimation, particularly for scalable coding system. Typically, the value of bit-plane probability varies according to the distribution of the data represented, and due to inter-plane correlation, it is hard to get an analytic solution of bit-plane probability for the data with generalized Gaussian distribution. In this paper, bit-plane probability is analyzed when Generalized Gaussian distribution is used to model the input data. Based on the study of bit-plane probability for Laplace distribution and the relationship between different bit-planes, an approximated bit-plane probability for Generalized Gaussian distribution is presented. This closed-form expression is of low computational cost. Furthermore, a much practical format is derived with reduced complexity for implementation in the state-of-the-art MPEG-4 scalable to lossless audio coding system. With the same computational cost, the proposed algorithm presents higher compression efficiency than MPEG-4 scalable to lossless audio coding, which considers Laplace distribution only.

关键词： arithmetic coding bit-plane probability generalized Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Resolution Scalable Image coding With Reversible Cellular Automata

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2011年第5期20卷 1461-1468页

作者： Cappellari, Lorenzo Milani, Simone Cruz-Reyes, Carlos Calvagno, Giancarlo Univ Padua Dept Informat Engn I-35131 Padua Italy Univ Rovira & Virgili Res Grp Math Linguist Tarragona 43002 Spain

In a resolution scalable image coding algorithm, a multiresolution representation of the data is often obtained using a linear filter bank. Reversible cellular automata have been recently proposed as simpler, nonlinear filter banks that produce a similar representation. The original image is decomposed into four subbands, such that one of them retains most of the features of the original image at a reduced scale. In this paper, we discuss the utilization of reversible cellular automata and arithmetic coding for scalable compression of binary and grayscale images. In the binary case, the proposed algorithm that uses simple local rules compares well with the JBIG compression standard, in particular for images where the foreground is made of a simple connected region. For complex images, more efficient local rules based upon the lifting principle have been designed. They provide compression performances very close to or even better than JBIG, depending upon the image characteristics. In the grayscale case, and in particular for smooth images such as depth maps, the proposed algorithm outperforms both the JBIG and the JPEG2000 standards under most coding conditions.

关键词： arithmetic coding cellular automata (CA) scalable image coding

来源：评论

学校读者我要写书评

暂无评论

VLSI implementation of SISO arithmetic decoders for joint source channel coding 08

VLSI implementation of SISO arithmetic decoders for joint so...

引用

2008 Design, Automation and Test in Europe (DATE 2008), vol.3

作者： Simone Zezza Guido Masera Politecnico di Torino Italy

ISBN: (纸本)9783981080131

In this paper we propose an efficient VLSI implementation of a Soft Input Soft Output (SISO) arithmetic code (AC) decoder for joint source channel coding. The addressed application shows a very high level of processing complexity, but, to the best of our knowledge, no papers have been published in the literature on the hardware implementation of the considered joint source channel scheme. First we introduce a simplified algorithm for the SISO AC, which is 1.3 times faster than the standard one. Then an efficient SISO AC architecture is proposed and synthesis results on a 0.13μm standard cells technology are reported for two different sets of parameters (M=128, M=256). The proposed core runs at 338.9MHz and can decode up to 124.987kbit/s.

关键词： Combined source-channel coding Channel coding decoders Very large scale integration Joints ALTERNATING CURRENT arithmetic arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

A new chain coding mechanism for compression stimulated by a virtual environment of a predator-prey ecosystem

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2020年 102卷 650-669页

作者： Dhou, Khaldoon Drury Univ Breech Sch Business Adm Springfield MO 65802 USA

In this paper, the researcher introduces a new chain coding mechanism that employs a predator-prey agent-based modeling simulation with some modifications and simplifications and uses it in compression. In the proposed method, an image is ultimately represented by a virtual world consisting of three agent types: wolves, sheep, and paths. While sheep and paths do not change their locations during the program execution, wolves search for sheep to prey on. With each step, a wolf can determine its path by choosing between seven pertinent moves depending on the encountered information. The algorithm keeps track of the wolves' initial locations and their movements and uses this as a new image representation. Additionally, the researcher introduces the 'Lengthy Advance Move,' the purpose of which is to group particular consecutive codes and further reduce the chain. This, in turn, allows the researcher to experiment with different variations of the algorithm. Finally, the researcher applies arithmetic coding on the series of movements for extra compression. The experimental results reveal that the current algorithm generates higher compression ratios than many standardized algorithms, including JBIG family algorithms. Most importantly, paired-sample t-tests reveal significant differences between the findings of the wolf-sheep predation algorithm and the other algorithms used as benchmarks for comparisons. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Agent-based modeling Chain code Bi-level image Compression arithmetic coding Predator-prey ecosystem

来源：评论

学校读者我要写书评

暂无评论

Delay and Redundancy in Lossless Source coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第9期60卷 5470-5485页

作者： Shayevitz, Ofer Meron, Eado Feder, Meir Zamir, Ram Tel Aviv Univ Dept Elect Engn Syst IL-69978 Tel Aviv Israel

The penalty incurred by imposing a finite delay constraint in lossless source coding of a memoryless source is investigated. It is well known that for the so-called block-to-variable and variable-to-variable codes, the redundancy decays at best polynomially with the delay, where in this case the delay is identified with the source block length or maximal source phrase length, respectively. In stark contrast, it is shown that for sequential codes (e. g., a delay-limited arithmetic code) the redundancy can be made to decay exponentially with the delay constraint. The corresponding redundancy-delay exponent is shown to be at least as good as the Renyi entropy of order 2 of the source, but (for almost all sources) not better than a quantity depending on the minimal source symbol probability and the alphabet size.

关键词： Lossless source coding coding delay redundancy arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Weighted forward looking adaptive coding

引用

THEORETICAL COMPUTER SCIENCE 2022年 930卷 86-99页

作者： Fruchtman, Aharon Gross, Yoav Klein, Shmuel T. Shapira, Dana Ariel Univ Dept Comp Sci IL-40700 Ariel Israel Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel

Huffman coding is known to be optimal under certain constraints, yet its dynamic version, which constantly alters the Huffman tree as a function of the already processed characters, may be even more efficient in practice. A new forward looking variant of Huffman compression has been proposed recently, that provably always performs better than static Huffman coding by at least m -1 bits, where m denotes the size of the alphabet, and has a better worst case size than the standard dynamic Huffman coding. This paper introduces a new generic coding method, extending the known static and dynamic variants and including them as special cases. In fact, the generalization is applicable to all statistical methods, including arithmetic coding. This leads then to the formalization of a new double -pass coding method that is adaptive in the sense that it uses changing statistics depending on the current position within the processed file, yet it behaves like static coding, as it assumes the knowledge of the distribution in the entire file;this is contrary to online variants that rely only on the text seen so far and adapt the model dynamically. We call the new method positional coding, and its compression performance, using global statistics, is provably always at least as good as that of the best dynamic variants known to date. Moreover, we present empirical results that show improvements by positional coding and its extensions over static and dynamic Huffman and arithmetic coding, even when the encoded file includes the model description.(c) 2022 Elsevier B.V. All rights reserved.

关键词： Lossless data compression Static and dynamic coding Huffman coding arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Embedded block coding in JPEG 2000

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 2002年第1期17卷 49-72页

作者： Taubman, D Ordentlich, E Weinberger, M Seroussi, G Univ New S Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia GlobeSpan Santa Clara CA USA Hewlett Packard Labs Palo Alto CA USA

This paper describes the embedded block coding algorithm at the heart of the JPEG 2000 image compression standard, The paper discusses key considerations which led to the development and adoption of this algorithm, and also investigates performance and complexity issues, The JPEG 2000 coding system achieves excellent compression performance, somewhat higher (and, in some cases, substantially higher) than that of SPIHT with arithmetic coding, a popular benchmark for comparison The algorithm utilizes the same low complexity binary arithmetic coding engine as JBIG2. Together with careful design of the bit-plane coding primitives, this enables comparable execution speed to that observed with the simpler variant of SPIHT without arithmetic coding. The coder offers additional advantages including memory locality, spatial random access and ease of geometric manipulation. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： JPEG 2000 image compression scalable compression embedded coding bit-plane coding arithmetic coding wavelet transform

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：