Skip to main content

A Wavelet Packets Watermarking Algorithm Based on Chaos Encryption

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3980))

Included in the following conference series:

Abstract

In this paper, a wavelet packets watermarking algorithm based on chaos encryption for still digital images is presented. The watermarking is changed into bit sequence by modular arithmetic, at the same time, a random sequence is gotten by using a chaos map and deal with it also by modular arithmetic. After getting these two sequences, we do XOR arithmetic, then getting a new encrypted watermarking sequence. At the embedding stage, wavelet packets decomposition is used for original image, then embedding encrypted watermarking sequence into some frequency bands of original image by repeatedly embedding four times. At the extracting stage, wavelet packets decomposition for original image and watermarked image are used to inverse process. The experiment results demonstrated the new algorithm is robust for scaling, cropping, JPEG compression and noise attack.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

  • Coria-Mendoza, L., Nasiopoulos, P., Ward, R.: A Robust Watermarking Scheme Based on Informed Coding and Informed Embedding. In: IEEE International Conference on Image Processing ICIP 2005, Genova, Italy (2005)

    Google Scholar 

  • Li, C.-T.: Reversible Watermarking Scheme with Image-independent Embedding Capacity. IEE Proceedings - Vision, Image, and Signal Processing 152(6), 779–786 (2005)

    Article  Google Scholar 

  • Ni, J.Q., Zhang, R.Y., Huang, J.W., Wang, C.T.: A Robust Multi-bit Image Watermarking Algorithm Based on HMM in Wavelet Domain. In: Barni, M., Cox, I., Kalker, T., Kim, H.-J. (eds.) IWDW 2005. LNCS, vol. 3710, pp. 110–123. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  • Podilchuk, C.I., Zeng, W.: Image-Adaptive Watermarking Using Visual Models. IEEE Journal on Selected Areas in Communications 16(4), 525–539 (1998)

    Article  Google Scholar 

  • Paquet, A., Ward, R.K., Pitas, I.: Wavelet Packets-based Digital Watermarking for Image Verification and Authentication. Signal Processing, Special Issue on Security of Data Hiding Technologies 83(10), 2117–2132 (2003)

    MATH  Google Scholar 

  • Wang, H.J.M., Su, P.C., Kuo, C.C.J.: Wavelet-based Digital. Image Watermarking. Optics Express 3(12), 491–496 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cong, J., Jiang, Y., Qu, Z., Zhang, Z. (2006). A Wavelet Packets Watermarking Algorithm Based on Chaos Encryption. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751540_100

Download citation

  • DOI: https://doi.org/10.1007/11751540_100

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34070-6

  • Online ISBN: 978-3-540-34071-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics