Skip to main content

Performance Analysis of Data Hiding

  • Conference paper
  • First Online:
Advances in Multimedia Information Processing — PCM 2001 (PCM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2195))

Included in the following conference series:

  • 623 Accesses

Abstract

This paper presents a theoretical performance analysis of data hiding, which inserts invisible/inaudible digital watermarks in media data. The analysis relates payload limit, minimum watermark-signal- to-noise ratio, probability of watermark detection error, and bandwidth of the watermarking channel. The usage of such a channel for large payload, direct sequence spread spectrum (DSSS) with and without coding for error recovery is discussed. The paper finally illustrates how the analytical results can be applied in practice, in terms of selecting parameters of watermarking under quantization, by introducing analytical prediction of the decreasing SNR against quantization step size.

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. M. Barni, F. Bartolini, A. de Rosa, and A. Piva, “Capacity of the watermark channel: How many bits can be hidden within a digital image?,” in Proc. SPIE, San Jose, CA, Jan. 1999, vol. 3657, pp. 437–448.

    Google Scholar 

  2. G-I. Lin P. Moulin, M.K. Mihcak, “An information-theoretic model for image watermarking and data hiding,” in Proc. ICIP’00, Oct. 2000.

    Google Scholar 

  3. I. Cox, J. Kilian, T. Leighton, and T. Shamoon, “Secure spread spectrum watermarking for multimedia,” IEEE Trans. on Image Procesing, vol. 6, no. 12, pp. 1673–1687, Dec. 1997.

    Article  Google Scholar 

  4. M. Barni, F. Bartolini, and A. Piva, “A dct-domain system for robust image watermarking,” Signal Procesing, vol. 66, no. 3, pp. 357–372, May 1998.

    Article  MATH  Google Scholar 

  5. J. Proakis, Digital Communications, 3rd ed., New York: McGrawHill, 1995.

    Google Scholar 

  6. G. K. Wallace, “The jpeg still picture compression standard,” Communications of the ACM, CACM, vol. 34, no. 4, pp. 30–44, 1991.

    Article  Google Scholar 

  7. Independent JPEG Group, “jpegsr6b.zip,” http://www.ijg.org.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shimizu, S. (2001). Performance Analysis of Data Hiding. In: Shum, HY., Liao, M., Chang, SF. (eds) Advances in Multimedia Information Processing — PCM 2001. PCM 2001. Lecture Notes in Computer Science, vol 2195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45453-5_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-45453-5_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics