On achievable error exponents for watermarking

Pierre Moulin, Ying Wang

Research output: Contribution to journalConference article

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 attack used. Randomized codes outperform deterministic codes, except in the case of memoryless attacks where the same performance is obtained using either kind of code.

Original languageEnglish (US)
Article number31
Pages (from-to)308-317
Number of pages10
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume5681
DOIs
StatePublished - Jul 21 2005
EventProceedings of SPIE-IS and T Electronic Imaging - Security, Steganography, and Watermarking of Multimedia Contents VII - San Jose, CA, United States
Duration: Jan 17 2005Jan 20 2005

Fingerprint

Error Exponent
Watermarking
attack
Attack
exponents
Quantization (signal)
Spread Spectrum
decoders
Modulation
Min-max
embedding
Quantization
modulation

Keywords

  • Coding
  • Game theory
  • Probability of error
  • Randomized codes
  • Universal decoding
  • Watermarking

ASJC Scopus subject areas

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

Cite this

On achievable error exponents for watermarking. / Moulin, Pierre; Wang, Ying.

In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 5681, 31, 21.07.2005, p. 308-317.

Research output: Contribution to journalConference article

@article{8a39d6b2765342a2a0a79478248336c8,
title = "On achievable error exponents for watermarking",
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 attack used. Randomized codes outperform deterministic codes, except in the case of memoryless attacks where the same performance is obtained using either kind of code.",
keywords = "Coding, Game theory, Probability of error, Randomized codes, Universal decoding, Watermarking",
author = "Pierre Moulin and Ying Wang",
year = "2005",
month = "7",
day = "21",
doi = "10.1117/12.587953",
language = "English (US)",
volume = "5681",
pages = "308--317",
journal = "Proceedings of SPIE - The International Society for Optical Engineering",
issn = "0277-786X",
publisher = "SPIE",

}

TY - JOUR

T1 - On achievable error exponents for watermarking

AU - Moulin, Pierre

AU - Wang, Ying

PY - 2005/7/21

Y1 - 2005/7/21

N2 - 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 attack used. Randomized codes outperform deterministic codes, except in the case of memoryless attacks where the same performance is obtained using either kind of code.

AB - 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 attack used. Randomized codes outperform deterministic codes, except in the case of memoryless attacks where the same performance is obtained using either kind of code.

KW - Coding

KW - Game theory

KW - Probability of error

KW - Randomized codes

KW - Universal decoding

KW - Watermarking

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

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

U2 - 10.1117/12.587953

DO - 10.1117/12.587953

M3 - Conference article

AN - SCOPUS:21844480405

VL - 5681

SP - 308

EP - 317

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

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

SN - 0277-786X

M1 - 31

ER -