Distortion-Free Data Embedding for Images
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
A lossless data hiding scheme based on three-pixel block differences
Pattern Recognition
Reversible data hiding using integer wavelet transform and companding technique
IWDW'04 Proceedings of the Third international conference on Digital Watermarking
Lossless watermarking for image authentication: a new framework and an implementation
IEEE Transactions on Image Processing
Reversible data embedding using a difference expansion
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
In Lin's method [1], images are divided into non-overlapping three-pixel blocks. Each pixel block contains two pairs composed of two neighboring pixels. Absolute differences between pairs are calculated. And meanwhile, the absolute difference having the highest occurrence rate is obtained. 1-bit watermark is embedded into a pixel pair whose absolute difference is equal to this obtained value. Since each pixel block contains two differences, Lin's method achieves embedding rate of at most 2/3 bpp (bit per pixel) for a single embedding process. With the aim of further increasing embedding rate, we modify the embedding process in Lin's method to keep the third pixel of a pixel block unaltered in the proposed method. Then, this unchanged pixel is used again to reform into a new pixel block with its two neighboring pixels. As a result, the embedding rate can reach to 1 bpp for a single embedding process.