A Reversible Data Hiding Algorithm Based on Dynamic Distortion-Compensated Quantization Index Modulation

Ye Tian-yu; Niu Xin-xin; Ma Zhao-feng; Yang Yi-xian

doi:10.3724/SP.J.1146.2009.00859

Volume 32 Issue 6

Jun. 2010

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2010 > 32(6): 1489-1492

Ye Tian-yu, Niu Xin-xin, Ma Zhao-feng, Yang Yi-xian. A Reversible Data Hiding Algorithm Based on Dynamic Distortion-Compensated Quantization Index Modulation[J]. Journal of Electronics & Information Technology, 2010, 32(6): 1489-1492. doi: 10.3724/SP.J.1146.2009.00859

Citation:

Ye Tian-yu, Niu Xin-xin, Ma Zhao-feng, Yang Yi-xian. A Reversible Data Hiding Algorithm Based on Dynamic Distortion-Compensated Quantization Index Modulation[J]. Journal of Electronics & Information Technology, 2010, 32(6): 1489-1492. doi: 10.3724/SP.J.1146.2009.00859

Citation:

PDF( 376 KB)

A Reversible Data Hiding Algorithm Based on Dynamic Distortion-Compensated Quantization Index Modulation

doi: 10.3724/SP.J.1146.2009.00859

Received Date: 2009-06-09
Rev Recd Date: 2009-11-24
Publish Date: 2010-06-19

Abstract

Abstract

The concept of dynamic Distortion-Compensated Quantization Index Modulation (dynamic DC-QIM) is proposed, which differs from the conventional DC-QIM in whether or not quantization step size and DC parameter are changeable. Firstly, the condition satisfying the reversibility of dynamic DC-QIM is deduced. Then, the allowable range of DC parameter is derived. Finally, the procedure of reversible data hiding algorithm based on dynamic DC-QIM is designed. Its data hiding rate can achieve as high as 1bpp in a single iteration, higher than its former counterparts. Furthermore, the use of dynamic characteristic is in favor of preventing its parameters from being disclosed. Experimental results show that it not only accurately decodes the secret information, but also perfectly restores the original cover, regardless of initial conditions.

FullText(HTML)

References(1)

References

Coltuc D and Tremeau A. Simple reversible watermarking schemes. Proc. SPIE: Security, Steganography, Watermarking of Multimedia Contents VII, San Jose, CA, Jan. 2005, Vol. 5681: 561-568.[2]Coltuc D and Chassery J M. Very fast watermarking by reversible contrast mapping[J].IEEE Signal Processing Letters.2007, 14(4):255-258[3]Eggers J J, Bauml R, and Tzschoppe R, et al.. Inverse mapping of SCS-watermarked data[J].Proc. Eleventh European Signal Processing Conference (EUSIPCO2002), Toulouse, France, Sep.2002, Vol. I:59-62[4]Perez-Gonzalez F, Balado F, and Hernandez J R. Performance analysis of existing and new methods for data hiding with known-host information in additive channels[J].IEEE Transactions on Signal Processing.2003, 51(4):960-980[5]Prez-Freire L, Comesana P, and Prez-Gonzlez F. Detection in quantization-based watermarking: Performance and security issues. Proc. SPIE: Security, Steganography, Watermarking of Multimedia Contents VII, San Jose, CA, Jan. 2005, Vol. 5681: 721-733.[6]Vleeschouwer C D, Delaigle J F, and Macq B. Circular interpretation of bijective transformations in lossless watermarking for media asset management[J].IEEE Transactions on Multimedia.2003, 5(1):97-105

Relative Articles

Supplements(0)

Cited By

Proportional views