A framework for the design of good watermark identification codes

Pierre Moulin; Ralf Koetter

doi:10.1117/12.644642

17 February 2006 A framework for the design of good watermark identification codes

Pierre Moulin, Ralf Koetter

Proceedings Volume 6072, Security, Steganography, and Watermarking of Multimedia Contents VIII; 60721H (2006) https://doi.org/10.1117/12.644642
Event: Electronic Imaging 2006, 2006, San Jose, California, United States

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 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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available