Skip to main content

Performance Measurement of Watermark Embedding Patterns

  • Conference paper
Digital Watermarking (IWDW 2003)

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

Included in the following conference series:

Abstract

Segmented watermarking is an approach to multiple watermarking that can be used to acknowledge the contribution of multiple authors or to embed a fingerprint code word, but is susceptible to cropping attacks that discard portions of the watermarked media. Careful selection of the watermark embedding pattern can increase the resilience of a segmented watermark in the presence of cropping attacks. In this paper, we consider performance measures for embedding patterns and compare the performance of several proposed embedding patterns using these measures.

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

  1. Abdel-Ghaffar, K., El Abbadi, A.: Optimal allocation of two-dimensional data. In: International Conference on Database Theory, Delphi, Greece, pp. 409–418 (1997)

    Google Scholar 

  2. Atallah, M., Frikken, K.: Cropping-resilient segmented multiple watermarking. In: Workshop on Algorithms and Discrete Structures (2003)

    Google Scholar 

  3. Du, H.C., Sobolewski, J.S.: Disk allocation for cartesian product files on multipledisk systems. ACM Transactions on Database Systems 7, 82–101 (1982)

    Article  MATH  Google Scholar 

  4. Kim, M.H., Pramanik, S.: Optimal file distribution for partial match retrieval. In: ACM International Conference on Management of Data, Chicago, USA, pp. 173–182 (1988)

    Google Scholar 

  5. Prabhakar, S., Abdel-Ghaffar, K., Agrawal, D., El Abbadi, A.: Efficient retrieval of multi-dimensional datasets through parallel I/O. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 78–87 (1998)

    Google Scholar 

  6. Sheppard, N.P., Safavi-Naini, R., Ogunbona, P.: On multiple watermarking. In: Workshop on Security and Multimedia at ACM Multimedia, Ottawa, Canada, pp. 3–6 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Scealy, R., Safavi-Naini, R., Sheppard, N.P. (2004). Performance Measurement of Watermark Embedding Patterns. In: Kalker, T., Cox, I., Ro, Y.M. (eds) Digital Watermarking. IWDW 2003. Lecture Notes in Computer Science, vol 2939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24624-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24624-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21061-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics