Skip to main content

On Fastest Optimal Parity Assignments in Palette Images

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7197))

Included in the following conference series:

Abstract

By Optimal Parity Assignment (OPA) approach for hiding secret data in palette images, we consider the fastest Optimal Parity Assignment (FOPA) methods which are OPA and do not take any extra reordering procedures on color space of palettes. We show that our rho-method is a FOPA and it is easily implemented for controlling quality of stego-images. As consequences, two algorithms for hiding data in palette images are presented. The first algorithm is taken on the rho-forest obtained by rho-method on a palette and the second is only on the colors which are not isolated (by distance not far from the others) in the palette. To prevent from steganalysis, by controlling high quality of stego palette images, combinations of FOPA method with enhanced CPT schemes for binary images are introduced. Some experimental results are presented.

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. Chen, Y., Pan, H., Tseng, Y.: A secret of data hiding scheme for two-color images. In: IEEE Symposium on Computers and Communications (2000)

    Google Scholar 

  2. Colour metric, http://www.compuphase.com/index_en.htm

  3. Alman, D.H.: Industrial color difference evaluation. Color Research and Application (18), 137–139 (1993)

    Google Scholar 

  4. Fridrich, J., Du, R.: Secure Steganographic Methods for Palette Images. In: Pfitzmann, A. (ed.) IH 1999. LNCS, vol. 1768, pp. 47–60. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Romana Machado. EZStego[EB/OL], http://www.stego.com

  6. Por, L.Y., Lai, W.K., Alireza, Z., Ang, T.F., Su, M.T., Delina, B.: StegCure: A omprehensive Steganographic Tool using Enhanced LSB Scheme. WSEAS Transactions on Computers 7(8) (August 2008); ISSN: 1109-2750 1309

    Google Scholar 

  7. Zhang, X., Wang, S.: Vulnerability of pixel-value differencing steganography to histogram analysis and modification for enhanced security. Pattern Recognition Letters 25, 331–339 (2004)

    Article  Google Scholar 

  8. Zhang, X., Wang, S.: Analysis of Parity Assignment Steganography in Palette Images. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3683, pp. 1025–1031. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Phan, T.H., Nguyen, H.T.: On the maximality of secret data ratio in CPTE schemes. In: Nguyen, N.T., Kim, C.-G., Janiak, A. (eds.) ACIIDS 2011, Part I. LNCS (LNAI), vol. 6591, pp. 88–99. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Thanh, N.H., Huy, P.T.: Fast and Near Optimal Parity Assignment in Palette Images with Enhanced CPT Scheme. In: Nguyen, N.T., Le, M.T., Świątek, J. (eds.) ACIIDS 2010, Part II. LNCS, vol. 5991, pp. 450–459. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Koval, A., Shih, F.Y., Verkhovsky, B.S.: A Pseudo-Random Pixel Rearrangement Algorithm Based on Gaussian Integers for Image Watermarking. Journal of Information Hiding and Multimedia Signal Processing 2(1), 60–70 (2011)

    Google Scholar 

  12. Huang, H.C., Fang, W.C.: Metadata-Based Image Watermarking for Copyright Protection. Simulation Modelling Practice and Theory 18(4), 436–445 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huy, P.T., Thanh, N.H., Thang, T.M., Dat, N.T. (2012). On Fastest Optimal Parity Assignments in Palette Images. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science(), vol 7197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28490-8_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28490-8_25

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-28490-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics