Share Email Print
cover

Proceedings Paper

A framework for the design of good watermark identification codes
Author(s): Pierre Moulin; Ralf Koetter
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

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

Paper Details

Date Published: 17 February 2006
PDF: 10 pages
Proc. SPIE 6072, Security, Steganography, and Watermarking of Multimedia Contents VIII, 60721H (17 February 2006); doi: 10.1117/12.644642
Show Author Affiliations
Pierre Moulin, Univ. of Illinois at Urbana Champaign (United States)
Ralf Koetter, Univ. of Illinois at Urbana Champaign (United States)


Published in SPIE Proceedings Vol. 6072:
Security, Steganography, and Watermarking of Multimedia Contents VIII
Edward J. Delp III; Ping Wah Wong, Editor(s)

© SPIE. Terms of Use
Back to Top