A framework for the design of good watermark identification codes

Pierre Moulin, Ralf Koetter

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The fundamental difference between the data-hiding and watermark signature verification problems was high-lighted in a 2001 paper by Steinberg and Merhav. In data hiding, the maximum number of messages that can be reliably decoded is essentially 2 nC, where n is the host sequence length and C is the data-hiding capacity. A dramatically different result is obtained for signature verification: in principle one can discriminate between a doubly exponential number of signatures: 2 2nC′, where C′ is the identification capacity. This paper proposes a practical design of codes for the latter application and compares the results with current designs in the literature.

Original languageEnglish (US)
Title of host publicationSecurity, Steganography, and Watermarking of Multimedia Contents VIII - Proceedings of SPIE-IS and T Electronic Imaging
DOIs
StatePublished - 2006
EventSecurity, Steganography, and Watermarking of Multimedia Contents VIII - San Jose, CA, United States
Duration: Jan 16 2006Jan 19 2006

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Volume6072
ISSN (Print)0277-786X

Other

OtherSecurity, Steganography, and Watermarking of Multimedia Contents VIII
CountryUnited States
CitySan Jose, CA
Period1/16/061/19/06

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A framework for the design of good watermark identification codes'. Together they form a unique fingerprint.

Cite this