Translator Disclaimer
17 February 2006 A framework for the design of good watermark identification codes
Author Affiliations +
Abstract
The fundamental difference between the data-hiding and watermark signature verification problems was highlighted in a 2001 paper by Steinberg and Merhav. In data hiding, the maximum number of messages that can be reliably decoded is essentially 2nC, 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: 22nC', 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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Pierre Moulin and Ralf Koetter "A framework for the design of good watermark identification codes", Proc. SPIE 6072, Security, Steganography, and Watermarking of Multimedia Contents VIII, 60721H (17 February 2006); https://doi.org/10.1117/12.644642
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
Back to Top