Skip to main content

A High Capacity Reversible Watermarking Scheme Based on an Integer Transform

  • Conference paper
Advances in Multimedia Information Processing - PCM 2009 (PCM 2009)

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

Included in the following conference series:

Abstract

In this paper, we present a novel reversible watermarking scheme based on an improved integer transform. Our scheme puts emphasis on the high embedding capacity with low distortion. For instance, one can embed more than 1.5 BPP in Lena by the proposed scheme in a single pass embedding, and meanwhile the resulting PSNR is relatively good. Experiment results show that the performance of our scheme is better than some state-of-the-art algorithms.

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 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 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. Kamstra, L., Heijmans, H.J.A.M.: Reversible data embedding into images using wavelet techniques and sorting. IEEE Trans. Image Process. 14(12), 2082–2090 (2005)

    Article  MathSciNet  Google Scholar 

  2. Ni, Z., Shi, Y.Q., Ansari, N., Su, W.: Reversible data hiding. IEEE Trans. Circuits Syst. Video Technol. 16(3), 354–362 (2006)

    Article  Google Scholar 

  3. Coltuc, D., Chassery, J.M.: Very fast watermarking by reversible contrast mapping. IEEE Signal Process. Lett. 14(4), 255–258 (2007)

    Article  Google Scholar 

  4. Hu, Y., Lee, H.K., Chen, K., Li, J.: Difference expansion based reversible data hiding using two embedding directions. IEEE Trans. Multimedia 10(8), 1500–1512 (2008)

    Article  Google Scholar 

  5. Coltuc, D., Chassery, J.M.: High capacity reversible watermarking. In: Proc. IEEE ICIP, pp. 2565–2568 (2006)

    Google Scholar 

  6. Chaumount, M., Puech, W.: A high capacity reversible watermarking scheme. In: Visual Communications and Image Processing 2009. Proc. SPIE, vol. 7257, p. 72571H (2009)

    Google Scholar 

  7. Coltuc, D., Chassery, J.M.: Simple reversible watermarking schemes: further results. In: Security, Steganography, and Watermarking of Multimedia Contents VIII. Proc. SPIE, vol. 6072 (2006)

    Google Scholar 

  8. Tian, J.: Reversible data embedding using a difference expansion. IEEE Trans. Circuits Syst. Video Technol. 13(8), 890–896 (2003)

    Article  Google Scholar 

  9. Weng, S., Zhao, Y., Pan, J.S., Ni, R.: Reversible watermarking based on invariability and adjustment on pixel pairs. IEEE Signal Process. Lett. 15, 721–724 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, G., Li, X., Yang, B. (2009). A High Capacity Reversible Watermarking Scheme Based on an Integer Transform. In: Muneesawang, P., Wu, F., Kumazawa, I., Roeksabutr, A., Liao, M., Tang, X. (eds) Advances in Multimedia Information Processing - PCM 2009. PCM 2009. Lecture Notes in Computer Science, vol 5879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10467-1_133

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10467-1_133

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10466-4

  • Online ISBN: 978-3-642-10467-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics