Histogram-based reversible data hiding technique using subsampling
Proceedings of the 10th ACM workshop on Multimedia and security
A Reversible Data Hiding Scheme Based on Block Division
CISP '08 Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 1 - Volume 01
Lossless Data Hiding Based on Difference Expansion without a Location Map
CISP '08 Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02
Lossless Data Hiding Using Bit-Depth Embedding for JPEG2000 Compressed Bit-Stream
IIH-MSP '08 Proceedings of the 2008 International Conference on Intelligent Information Hiding and Multimedia Signal Processing
Reversible data hiding exploiting spatial correlation between sub-sampled images
Pattern Recognition
A reversible watermarking based on histogram shifting
IWDW'06 Proceedings of the 5th international conference on Digital Watermarking
Reversible watermark using the difference expansion of a generalized integer transform
IEEE Transactions on Image Processing
Lossless generalized-LSB data embedding
IEEE Transactions on Image Processing
Reversible data embedding using a difference expansion
IEEE Transactions on Circuits and Systems for Video Technology
IEEE Transactions on Circuits and Systems for Video Technology
Reversible data-hiding for progressive image transmission
Image Communication
Hi-index | 0.01 |
This paper proposes a novel reversible data hiding algorithm for images, which the original host image can be exactly recovered from the marked image after the hidden data has been extracted. The proposed algorithm considers shifting the histogram of the difference values between the subsampled target pixel intensities and their interpolated counterparts to hide secret data. The shifting of the histogram of difference values is carried out by modifying the target pixel values. As compared to other schemes, the proposed method can make more utilization of the correlation between nearby pixels in an image via simple interpolation techniques to increase embedding capacity without sacrificing much distortion for data hiding. The reason of the feasibility is that the difference histogram derived in the paper renders so highly centralized distribution around zero that much more embedding capacity than before can be thus obtained. The experimental results demonstrate that the proposed method not only provides larger embedding capacity than other histogram shifting methods but also maintains a high visual quality. Moreover the computational complexity of the proposed method is low since only simple arithmetic computations are needed.