Summary
Vector quantization, i.e., VQ, is an important image compression method. In the past, many data hiding schemes have been proposed based on VQ. However, none of them is graph coloring based, although graph coloring has been used in many applications. In this work, we propose a VQ-based data hiding scheme using graph coloring. The proposed scheme colored every codeword in the codebook in different colors, each of which represents some bits of secret messages. Then the scheme hidden data into the compression code through replacing one codeword in a color with another codeword in another color. The performance of the proposed scheme was evaluated on the basis of embedding capacity and imperceptibility, which proved the scheme’s validity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Duric, Z., Jacobs, M., Jajodia, S.: Information hiding: Steganography and steganalysis. Handbook of Statistics 24, 171–187 (2005)
Tefas, A., Nikolaidis, N., Pitas, I.: Image watermarking: Techniques and applications. The Essential Guide to Image Processing 22, 597–648 (2009)
Lin, Y.C., Wang, C.C.: Digital images watermarking by vector quantization. Optical Engineering 3, 76–78 (1999)
Wu, H.C., Wu, N.I., Tsai, C.S., Hwang, M.S.: Image steganographic scheme based on pixel-value differencing and lsb replacement methods. Vision, Image and Signal Processing 152, 611–615 (2005)
Li, Y., Li, C.T.: Steganographic scheme for vq compressed images using progressive exponential clustering. In: Proc. IEEE Int’l. Conf. Video and Signal Based Surveillance, p. 85 (2006)
Cosman, P.C., Oehler, K.L., Riskin, E.A., Gray, R.M.: Using vector quantization for image processing. Proceedings of the IEEE 81, 1326–1341 (1993)
Yanez, J., Ramirez, J.: The robust coloring problem. European Journal of Operational Research 148, 546–558 (2003)
Guruswami, V., Khanna, S.: On the hardness of 4-coloring a 3-collorable graph. In: Proc. 15th Annual IEEE Conf. Computational Complexity, pp. 188–197 (2000)
Cui, G., Qi, L., Liu, S., Wang, Y., Zhang, X., Cao, X.: Modified PSO algorithm for solving planar graph coloring problem. Progress in Natural Science 18, 353–357 (2008)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proc. IEEE Int’l Conf. Neural Networks, vol. 4, pp. 1942–1948 (1995)
Standard PSO (2007), http://www.particleswarm.info/Programs.html
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yue, S., Wang, ZH., Chang, CC. (2013). An Image Data Hiding Scheme Based on Vector Quantization and Graph Coloring. In: Pan, JS., Huang, HC., Jain, L., Zhao, Y. (eds) Recent Advances in Information Hiding and Applications. Intelligent Systems Reference Library, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28580-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-28580-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28579-0
Online ISBN: 978-3-642-28580-6
eBook Packages: EngineeringEngineering (R0)