Share Email Print

Proceedings Paper

On achievable error exponents for watermarking
Author(s): Pierre Moulin; Ying Wang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Probability-of-error exponents have recently been derived for watermarking systems based on spread-spectrum and quantization-index modulation methods. This paper takes this work one step further and presents minmax error exponents for any embedding scheme and any attack (subject to distortion constraints) at all rates below capacity. The decoders used are universal: they do not know the attck used. Randomized codes outperform deterministic codes, except in the case of memoryless attacks where the same performance is obtained using either kind of code.

Paper Details

Date Published: 21 March 2005
PDF: 10 pages
Proc. SPIE 5681, Security, Steganography, and Watermarking of Multimedia Contents VII, (21 March 2005); doi: 10.1117/12.587953
Show Author Affiliations
Pierre Moulin, Univ. of Illinois/Urbana-Champaign (United States)
Ying Wang, Univ. of Illinois/Urbana-Champaign (United States)

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

© SPIE. Terms of Use
Back to Top