21 March 2005 On achievable error exponents for watermarking
Author Affiliations +
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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Pierre Moulin, Pierre Moulin, Ying Wang, Ying Wang, "On achievable error exponents for watermarking", Proc. SPIE 5681, Security, Steganography, and Watermarking of Multimedia Contents VII, (21 March 2005); doi: 10.1117/12.587953; https://doi.org/10.1117/12.587953
PROCEEDINGS
10 PAGES


SHARE
Back to Top