Skip to main content

Image Data Hiding Schemes Based on Graph Coloring

  • Conference paper
Book cover Ubiquitous Intelligence and Computing (UIC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6905))

Included in the following conference series:

  • 1593 Accesses

Abstract

Graph coloring has been applied in a variety of applications, but not for data hiding. Therefore, in this paper, we are proposing two graph coloring-based data hiding schemes that embed secret data in spatial domain of gray scale images. The main idea of our schemes is to use a graph, in which every vertex corresponds to a pixel pair, to hide data by replacing a pair of pixels of one color with a pair of pixels of a different color, with every color corresponding to some bits of the secret message. The performance of the proposed schemes has been evaluated by a joint evaluation of the imperceptibility of the images they produce and their embedding capacity. Also, the validity of the proposed schemes has been proven by comparing them with some other schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Duric, Z., Jacobs, M., Jajodia, S.: Information hiding: steganography and steganalysis, vol. 24, pp. 171–187. Elsevier, Amsterdam (2005)

    Google Scholar 

  2. Chang, C.-C., Lin, C.-Y., Wang, Y.-Z.: New image steganographic methods using run-length approach. Information Sciences 176(22), 3393–3408 (2006)

    Article  MathSciNet  Google Scholar 

  3. Chan, C.-K., Cheng, L.-M.: Hiding data in images by simple LSB substitution. Pattern Recognition 37(3), 469–474 (2004)

    Article  MATH  Google Scholar 

  4. Thien, C.-C., Lin, J.-C.: A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function. Pattern Recognition 36(12), 2875–2881 (2003)

    Article  MATH  Google Scholar 

  5. Yang, C.-H.: Inverted pattern approach to improve image quality of information hiding by LSB substitution. Pattern Recognition 41(8), 2674–2683 (2008)

    Article  MATH  Google Scholar 

  6. Luo, X.-Y., Wang, D.-S., Wang, P., Liu, F.-L.: A review on blind detection for image steganography. Signal Processing 88(9), 2138–2157 (2008)

    Article  MATH  Google Scholar 

  7. Wang, R.-Z., Lin, C.-F., Lin, J.-C.: Image hiding by optimal LSB substitution and genetic algorithm. Pattern Recognition 34(3), 671–683 (2001)

    Article  MATH  Google Scholar 

  8. Chang, C.-C., Hsiao, J.-Y., Chan, C.-S.: Finding optimal least-significant-bit substitution in image hiding by dynamic programming strategy. Pattern Recognition 36(7), 1583–1595 (2003)

    Article  Google Scholar 

  9. Yang, C.-H., Weng, C.-Y., Wang, S.-J., Sun, H.-M.: Adaptive data hiding in edge areas of images with spatial LSB domain systems. IEEE Transactions on Information Forensics and Security 3(3), 488–497 (2008)

    Article  Google Scholar 

  10. Wu, D.-C., Tsai, W.-H.: A steganographic method for images by pixel-value differencing. Pattern Recognition Letters 24(9-10), 1613–1626 (2003)

    Article  MATH  Google Scholar 

  11. 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. IEE Proceedings 152(5), 611–615 (2005)

    Google Scholar 

  12. Yang, C.-H., Wang, S.-J., Weng, C.-Y.: Analyses of pixel-value-differencing schemes with LSB replacement in stegonagraphy. Intelligent Information Hiding and Multimedia Signal Processing 1, 445–448 (2007)

    Article  Google Scholar 

  13. Wang, C.-M., Wu, N.-I., Tsai, C.-S., Hwang, M.-S.: A high quality steganographic method with pixel-value differencing and modulus function. Journal of Systems and Software 81(1), 150–158 (2008)

    Article  Google Scholar 

  14. Hsiao, J.-Y., Chang, C.-T.: An adaptive steganographic method based on the measurement of just noticeable distortion profile. Image and Vision Computing (in press, corrected proof)

    Google Scholar 

  15. Yanez, J., Ramirez, J.: The robust coloring problem. European Journal of Operational Research 148(3), 546–558 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Guruswami, V., Khanna, S.: On the hardness of 4-coloring a 3-collorable graph. In: IEEE Conference on Computational Complexity Proceedings, pp. 188–197 (2000)

    Google Scholar 

  17. Cui, G., Qin, L., Liu, S., Wang, Y., Zhang, X., Cao, X.: Modified pso algorithm for solving planar graph coloring problem. Progress in Natural Science 18(3), 353–357 (2008)

    Article  Google Scholar 

  18. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks Proceedings, vol. 4, pp. 1942–1948 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yue, S., Wang, ZH., Chang, CY., Chang, CC., Li, MC. (2011). Image Data Hiding Schemes Based on Graph Coloring. In: Hsu, CH., Yang, L.T., Ma, J., Zhu, C. (eds) Ubiquitous Intelligence and Computing. UIC 2011. Lecture Notes in Computer Science, vol 6905. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23641-9_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23641-9_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23640-2

  • Online ISBN: 978-3-642-23641-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics