A framework for the design of good watermark identification codes

Pierre Moulin; Ralf Koetter

doi:10.1117/12.644642

A framework for the design of good watermark identification codes

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Security, Steganography, and Watermarking of Multimedia Contents VIII - Proceedings of SPIE-IS and T Electronic Imaging
DOIs	https://doi.org/10.1117/12.644642
State	Published - 2006
Event	Security, Steganography, and Watermarking of Multimedia Contents VIII - San Jose, CA, United States Duration: Jan 16 2006 → Jan 19 2006

Publication series

Name	Proceedings of SPIE - The International Society for Optical Engineering
Volume	6072
ISSN (Print)	0277-786X

Other

Other	Security, Steganography, and Watermarking of Multimedia Contents VIII
Country/Territory	United States
City	San Jose, CA
Period	1/16/06 → 1/19/06

ASJC Scopus subject areas

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

Online availability

10.1117/12.644642

Library availability

Discover UIUC Full Text

Cite this

A framework for the design of good watermark identification codes. / Moulin, Pierre; Koetter, Ralf.

Security, Steganography, and Watermarking of Multimedia Contents VIII - Proceedings of SPIE-IS and T Electronic Imaging. 2006. 60721H (Proceedings of SPIE - The International Society for Optical Engineering; Vol. 6072).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Moulin, P & Koetter, R 2006, A framework for the design of good watermark identification codes. in Security, Steganography, and Watermarking of Multimedia Contents VIII - Proceedings of SPIE-IS and T Electronic Imaging., 60721H, Proceedings of SPIE - The International Society for Optical Engineering, vol. 6072, Security, Steganography, and Watermarking of Multimedia Contents VIII, San Jose, CA, United States, 1/16/06. https://doi.org/10.1117/12.644642

@inproceedings{b0398adad78249998fa89b3e9b5f3709,

title = "A framework for the design of good watermark identification codes",

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

author = "Pierre Moulin and Ralf Koetter",

year = "2006",

doi = "10.1117/12.644642",

language = "English (US)",

isbn = "0819461121",

series = "Proceedings of SPIE - The International Society for Optical Engineering",

booktitle = "Security, Steganography, and Watermarking of Multimedia Contents VIII - Proceedings of SPIE-IS and T Electronic Imaging",

}

TY - GEN

T1 - A framework for the design of good watermark identification codes

AU - Moulin, Pierre

AU - Koetter, Ralf

PY - 2006

Y1 - 2006

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

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

UR - http://www.scopus.com/inward/record.url?scp=33645696499&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33645696499&partnerID=8YFLogxK

U2 - 10.1117/12.644642

DO - 10.1117/12.644642

M3 - Conference contribution

AN - SCOPUS:33645696499

SN - 0819461121

SN - 9780819461124

T3 - Proceedings of SPIE - The International Society for Optical Engineering

BT - Security, Steganography, and Watermarking of Multimedia Contents VIII - Proceedings of SPIE-IS and T Electronic Imaging

T2 - Security, Steganography, and Watermarking of Multimedia Contents VIII

Y2 - 16 January 2006 through 19 January 2006

ER -

A framework for the design of good watermark identification codes

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this