All Title Author
Keywords Abstract

Reversible Data Hiding Using Two Marked Images Based on Adaptive Coefficient-Shifting Algorithm

DOI: 10.1155/2012/473896

Full-Text   Cite this paper   Add to My Lib


This paper proposes a novel form of reversible data hiding using two marked images by employing the adaptive coefficient-shifting (ACS) algorithm. The proposed ACS algorithm consists of three parts: the minimum-preserved scheme, the minimum-preserved with squeezing scheme, and the base-value embedding scheme. More specifically, each input block of a host image can be encoded to two stego-blocks according to three predetermined rules by the above three schemes. Simulations validate that the proposed method not only completely recovers the host medium but also losslessly extracts the hidden message. The proposed method can handle various kinds of images without any occurrence of overflow/underflow. Moreover, the payload and peak signal-to-noise ratio (PSNR) performance of the proposed method is superior to that of the conventional invertible data hiding schemes. Furthermore, the number of shadows required by the proposed method is less than that required by the approaches which are based upon secret image sharing with reversible steganography. 1. Introduction Due to ubiquitous broadband services and high-speed networks provided by Internet service providers (ISPs), along with mass production of high-capacity and low-cost multimedia devices, individuals and organizations can easily share their information on the Internet. Moreover, thanks to the portability and mobility provided by such wireless communications as intelligent mobile systems, wireless fidelity (Wi-Fi), and worldwide interoperability microaccess (WiMax), people can exchange/retrieve resources anywhere and anytime. Preventing data from being eavesdropped, tampered with, and falsified during transmission has become an important goal. In addition to the use of cryptographic systems, one can use data hiding to achieve this result. Primary applications of data hiding can be found in proof of ownership, content authentication, copyright protection, and covert communications. In general, data hiding can be divided into two categories: digital watermarking and steganography [1, 2]. In digital watermarking, the embedded message (or watermark) is often related to the medium and conveys additional information about the medium. Robust performance is a key feature of the watermarking schemes [3–5]. In steganography, the hidden message often has nothing to do with the host media; however, both hiding capacity and perceived quality are the two areas of concern pursued by the authors [6–8]. One of the major issues of the steganographic approach is that the marked images are susceptible to manipulation. In


[1]  I. J. Cox, M. L. Miller, J. A. Bloom, J. Fridrich, and T. Kalker, Digital Watermarking and Steganography, Morgan Kaufmann, Massachusetts, Mass, USA, 2nd edition, 2008.
[2]  F. Y. Shih, Digital Watermarking and Steganography: Fundamentals and Techniques, CRC Press, Florida, Fla, USA, 2008.
[3]  C. Y. Yang, W. C. Hu, W. Y. Hwang, and Y. F. Cheng, “A simple digital watermarking by the adaptive bit-labeling scheme,” International Journal of Innovative Computing, Information and Control, vol. 6, no. 3, pp. 1401–1410, 2010.
[4]  C. C. Lin and P. F. Shiu, “High capacity data hiding scheme for DCT-based images,” Journal of Information Hiding and Multimedia Signal Processing, vol. 1, no. 3, pp. 220–240, 2010.
[5]  K. Yamamoto and M. Iwakiri, “Real-time audio watermarking based on characteristics of PCM in digital instrument,” Journal of Information Hiding and Multimedia Signal Processing, vol. 1, no. 2, pp. 59–71, 2010.
[6]  S. Zhou, Q. Zhang, and X. Wei, “An image encryption algorithm based on dual DNA sequences for image hiding,” ICIC Express Letters, vol. 4, no. 4, pp. 1393–1398, 2010.
[7]  S. Wang, B. Yang, and X. Niu, “Secure steganography method based on genetic algorithm,” Journal of Information Hiding and Multimedia Signal Processing, vol. 1, no. 1, pp. 28–35, 2010.
[8]  Z. G. Qu, X. B. Chen, X. J. Zhou, X. X. Niu, and Y. X. Yang, “Novel quantum steganography with large payload,” Optics Communications, vol. 283, no. 23, pp. 4782–4786, 2010.
[9]  J. Tian, “Reversible data embedding using a difference expansion,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 13, no. 8, pp. 890–896, 2003.
[10]  A. M. Alattar, “Reversible watermark using the difference expansion of a generalized integer transform,” IEEE Transactions on Image Processing, vol. 13, no. 8, pp. 1147–1156, 2004.
[11]  C. C. Lin, W. L. Tai, and C. C. Chang, “Multilevel reversible data hiding based on histogram modification of difference images,” Pattern Recognition, vol. 41, no. 12, pp. 3582–3591, 2008.
[12]  X. Zeng, L. Ping, and Z. Li, “Lossless data hiding scheme using adjacent pixel difference based on scan path,” Journal of Multimedia, vol. 4, no. 3, pp. 145–152, 2009.
[13]  H. C. Wu, C. C. Lee, C. S. Tsai, Y. P. Chu, and H. R. Chen, “A high capacity reversible data hiding scheme with edge prediction and difference expansion,” Journal of Systems and Software, vol. 82, no. 12, pp. 1966–1973, 2009.
[14]  C. H. Yang and M. H. Tsai, “Improving histogram-based reversible data hiding by interleaving predictions,” IET Image Processing, vol. 4, no. 4, pp. 223–234, 2010.
[15]  C. Y. Yang and W. C. Hu, “High-performance reversible data hiding with overflow/underflow avoidance,” ETRI Journal, vol. 33, no. 4, pp. 580–588, 2011.
[16]  A. Shamir, “How to share a secret,” Communications of the ACM, vol. 22, no. 11, pp. 612–613, 1979.
[17]  M. Naor and A. Shamir, “Visual cryptography,” in Advances in Cryptology, Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT '94), vol. 950 of Lecture Notes in Computer Science, pp. 1–12, Perugia, Italy, May 1994.
[18]  C. C. Lin and W. H. Tsai, “Secret image sharing with steganography and authentication,” Journal of Systems and Software, vol. 73, no. 3, pp. 405–414, 2004.
[19]  Y. S. Wu, C. C. Thien, and J. C. Lin, “Sharing and hiding secret images with size constraint,” Pattern Recognition, vol. 37, no. 7, pp. 1377–1385, 2004.
[20]  C. N. Yang, T. S. Chen, K. H. Yu, and C. C. Wang, “Improvements of image sharing with steganography and authentication,” Journal of Systems and Software, vol. 80, no. 7, pp. 1070–1076, 2007.
[21]  C. C. Chang, Y. P. Hsieh, and C. H. Lin, “Sharing secrets in stego images with authentication,” Pattern Recognition, vol. 41, no. 10, pp. 3130–3137, 2008.
[22]  C. C. Chang, C. C. Lin, T. H. N. Le, and H. B. Le, “Sharing a verifiable secret image using two shadows,” Pattern Recognition, vol. 42, no. 11, pp. 3097–3114, 2009.
[23]  Z. Eslami, S. H. Razzaghi, and J. Z. Ahmadabadi, “Secret image sharing based on cellular automata and steganography,” Pattern Recognition, vol. 43, no. 1, pp. 397–404, 2010.
[24]  P. Y. Lin, J. S. Lee, and C. C. Chang, “Distortion-free secret image sharing mechanism using modulus operator,” Pattern Recognition, vol. 42, no. 5, pp. 886–895, 2009.
[25]  P. Y. Lin and C. S. Chan, “Invertible secret image sharing with steganography,” Pattern Recognition Letters, vol. 31, no. 13, pp. 1887–1893, 2010.


comments powered by Disqus