A Location Map Free Reversible Data Hiding Scheme for VQ-Compressed Images Based on Search Order Coding

2011 ◽  
Author(s):  
Peyman Rahmani ◽  
Ehsan Rahmani ◽  
Gholamhossein Dastghaibyfard
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Compressed Images ◽  
Search Order ◽  
Location Map

scholarly journals Two-Layer Reversible Data Hiding for VQ-Compressed Images Based on De-Clustering and Indicator-Free Search-Order Coding

2021 ◽  
Vol 13 (8) ◽  
pp. 215
Author(s):  
Chin-Chen Chang ◽  
Jui-Feng Chang ◽  
Wei-Jiun Kao ◽  
Ji-Hwei Horng
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
State Of The Art ◽  
Secret Data ◽  
Compressed Images ◽  
Hide Information ◽  
Search Order ◽  
Using Data ◽  
Free Search ◽  
Index Table

During transmission of digital images, secret messages can be embedded using data hiding techniques. Such techniques can transfer private secrets without drawing the attention of eavesdroppers. To reduce the amount of transmitted data, image compression methods are widely applied. Hiding secret data in compressed images is a hot issue recently. In this paper, we apply the de-clustering concept and the indicator-free search-order coding (IFSOC) technique to hide information into vector quantization (VQ) compressed images. Experimental results show that the proposed two-layer reversible data hiding scheme for IFSOC-encoded VQ index table can hide a large amount of secret data among state-of-the-art methods with a relatively lower bit rate and high security.

scholarly journals Reversible Data Hiding Scheme with High Embedding Capacity Using Semi-Indicator-Free Strategy

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Jiann-Der Lee ◽  
Yaw-Hwang Chiou ◽  
Jing-Ming Guo
Keyword(s):  
Vector Quantization ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Embedding Capacity ◽  
Bit Rate ◽  
Secret Data ◽  
Compressed Images ◽  
Search Order ◽  
High Embedding Capacity ◽  
Embedding Rate

A novel reversible data-hiding scheme is proposed to embed secret data into a side-matched-vector-quantization- (SMVQ-) compressed image and achieve lossless reconstruction of a vector-quantization- (VQ-) compressed image. The rather random distributed histogram of a VQ-compressed image can be relocated to locations close to zero by SMVQ prediction. With this strategy, fewer bits can be utilized to encode SMVQ indices with very small values. Moreover, no indicator is required to encode these indices, which yields extrahiding space to hide secret data. Hence, high embedding capacity and low bit rate scenarios are deposited. More specifically, in terms of the embedding rate, the bit rate, and the embedding capacity, experimental results show that the performance of the proposed scheme is superior to those of the former data hiding schemes for VQ-based, VQ/SMVQ-based, and search-order-coding- (SOC-) based compressed images.

scholarly journals Efficient Reversible Data Hiding Scheme for AMBTC-Compressed Images

2021 ◽  
Vol 11 (15) ◽  
pp. 6741
Author(s):  
Chia-Chen Lin ◽  
Thai-Son Nguyen ◽  
Chin-Chen Chang ◽  
Wen-Chi Chang
Keyword(s):  
Data Hiding ◽  
Free Space ◽  
Reversible Data Hiding ◽  
Secret Message ◽  
Embedding Capacity ◽  
Absolute Moment ◽  
Compressed Images ◽  
High Embedding Capacity ◽  
Significant Attention ◽  
Efficiency Rate

Reversible data hiding has attracted significant attention from researchers because it can extract an embedded secret message correctly and recover a cover image without distortion. In this paper, a novel, efficient reversible data hiding scheme is proposed for absolute moment block truncation code (AMBTC) compressed images. The proposed scheme is based on the high correlation of neighboring values in two mean tables of AMBTC-compressed images to further losslessly encode these values and create free space for containing a secret message. Experimental results demonstrated that the proposed scheme obtained a high embedding capacity and guaranteed the same PSNRs as the traditional AMBTC algorithm. In addition, the proposed scheme achieved a higher embedding capacity and higher efficiency rate than those of some previous schemes while maintaining an acceptable bit rate.

scholarly journals A Location Map Reduced Reversible Data Hiding Method Using Prediction Error Modification

2012 ◽  
Vol 6-7 ◽  
pp. 428-433
Author(s):  
Yan Wei Li ◽  
Mei Chen Wu ◽  
Tung Shou Chen ◽  
Wien Hong
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Prediction Error ◽  
Reversible Data Hiding ◽  
Experimental Results ◽  
Cover Image ◽  
Prediction Errors ◽  
Secret Data ◽  
Location Map ◽  
Comparable Image Quality

We propose a reversible data hiding technique to improve Hong and Chen’s (2010) method. Hong and Chen divide the cover image into pixel group, and use reference pixels to predict other pixel values. Data are then embedded by modifying the prediction errors. However, when solving the overflow and underflow problems, they employ a location map to record the position of saturated pixels, and these pixels will not be used to carry data. In their method, if the image has a plenty of saturated pixels, the payload is decreased significantly because a lot of saturated pixels will not joint the embedment. We improve Hong and Chen’s method such that the saturated pixels can be used to carry data. The positions of these saturated pixels are then recorded in a location map, and the location map is embedded together with the secret data. The experimental results illustrate that the proposed method has better payload, will providing a comparable image quality.

Sign in / Sign up

Export Citation Format

Share Document