Secret Hiding Using Side Match Vector Quantization

  • Conference paper
Soft Computing as Transdisciplinary Science and Technology

Part of the book series: Advances in Soft Computing ((AINSC,volume 29))

  • 915 Accesses

Abstract

Since side match vector quantization (SMVQ) provides better image quality of reconstructed image and compression bit rate than vector quantization (VQ) does, it becomes another choice to compress the transmitting images when the bandwidth is limited. To expand the cover media for transmitting confidential information, we propose a novel data hiding scheme which embeds secret data into the SMVQ-compressed image. In terms of the payload capacity, the visual quality, and the compression rate, experimental results confirm that the performances of our scheme are better than that of other information hiding schemes for VQ-based and SMVQ-based compressed images. In addition, the embedded secret data can be extracted from the stego-image without referencing the original cover image.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** 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.

Similar content being viewed by others

References

  1. R. J. Anderson and F. A. P. Petitcolas (1998) “On the Limits of Steganography,” IEEE Journal of Selected Areas in Communications, Vol. 16, pp. 474–481.

    Article  Google Scholar 

  2. D. Artz (2001) “Digital Steganography: Hiding Data Within Data,” IEEE Internet Computing, Vol. 5, No.3, pp. 75–80.

    Article  Google Scholar 

  3. N. Bourbakits and C. Alexopoulos (1992) “Picture Data Encryption Using Scan Patterns,” Pattern Recognition, Vol. 25, No. 6, pp. 567–581.

    Article  Google Scholar 

  4. C. C. Chang, G. M. Chen and M. H. Lin (2004) “Information Hiding Based on Search-Order Coding for VQ Indices,” Pattern Recognition Letters, Vol. 25, pp. 1253–1261.

    Article  Google Scholar 

  5. C. C. Chang, M. H. Lin, and Y. C. Hu (Jun. 2002) “A Fast and Secure Image Hiding Scheme Based on LSB Substitution,” International Journal of Pattern Recognition and Artificial Intelligence, Vol. 16, No. 4, pp. 399–416.

    Article  Google Scholar 

  6. C. C. Chang and W. C. Wu (Sept. 2004) “A Steganographic Scheme for Hiding Secret Data Using Side Match Vector Quantization,” to appear in IEICE Transactions on Information and Systems.

    Google Scholar 

  7. Q. Cheng and T. S. Huang (2001) “An Adaptive Approach to Transform-Domain Information Hiding and Optimum Detection Structure,” IEEE Transactions on Multimedia, Vol. 3, No.3, pp. 273–284.

    Article  Google Scholar 

  8. “DES Encryption Standard (DES),” National Bureau of Standards (U.S.), Federal Information Processing Standards Publication 46, National Technical Information Service, Springfield, VA, Apr. 1997.

    Google Scholar 

  9. R. M. Gray (1984) “Vector Quantization,” IEEE Acoustics, Speech and Signal Processing Magazine, Vol. 1, pp. 4–29.

    Google Scholar 

  10. J. K. Jan and Y. M. Tseng (1996) “On the Security of Image Encryption Scheme,” Information Processing Letters, Vol. 60, pp. 261–265.

    Article  MathSciNet  Google Scholar 

  11. S. Katzenbeisser and F. A. P. Petitcolas (2000) “Information Hiding Techniques for Steganography and Digital Watermarking,” Artech House Books.

    Google Scholar 

  12. T. Kim (1992) “Side Match and Overlap Match Vector Quantizers for Images,” IEEE Transactions on Image Processing, Vol. 1, pp. 170–185.

    Article  Google Scholar 

  13. M. Jo and H. D. Kim (2002) “A Digital Image Watermarking Scheme Based on Vector Quantization,” IEICE Transactions on Information and Systems, Vol. E85-D, No. 6, pp. 1054–1056.

    Google Scholar 

  14. M. H. Lin, Y. C. Hu and C. C. Chang (2002) “Both Color and Gray Scale Secret Images Hiding in a Color Image,” International Journal on Pattern Recognition and Artificial Intelligence, Vol. 16, No. 6, pp.697–713.

    Article  Google Scholar 

  15. Y. Linde., A. Buzo and R. M. Gray (1980) “An Algorithm for Vector Quantizer Design,” IEEE Transactions on Communications, Vol. 28, pp. 84–95.

    Article  Google Scholar 

  16. R. L. Rivest, A. Shamir and L. Adleman (1978) “A Scheme for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the Association for Computing Machinery, Vol. 21, No. 2, pp. 120–126.

    MATH  MathSciNet  Google Scholar 

  17. P. Y. Tsai, M. H. Lin and C. C. Chang (2004) “An Adaptive Steganographic Scheme for Color Image,” Fundamenta Informaticae, Vo. 62, No. 3–4, pp. 275–289.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, CC., Tai, WL., Lin, CC. (2005). Secret Hiding Using Side Match Vector Quantization. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-32391-0_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25055-5

  • Online ISBN: 978-3-540-32391-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Navigation