On achievable error exponents for watermarking

Pierre Moulin; Ying Wang

doi:10.1117/12.587953

21 March 2005 On achievable error exponents for watermarking

Pierre Moulin, Ying Wang

Proceedings Volume 5681, Security, Steganography, and Watermarking of Multimedia Contents VII; (2005) https://doi.org/10.1117/12.587953
Event: Electronic Imaging 2005, 2005, San Jose, California, United States

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.

Citation Download Citation

Pierre Moulin and Ying Wang "On achievable error exponents for watermarking", Proc. SPIE 5681, Security, Steganography, and Watermarking of Multimedia Contents VII, (21 March 2005); https://doi.org/10.1117/12.587953

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