Error exponents for watermarking game with squared-error constraints

Tie Liu, Pierre Moulin

Research output: Contribution to journalConference article

Abstract

An overview is given of an error-exponent game for the following two popular systems: spread-spectrum (SS) watermarking with nearest-neighbor decoding, and quantization-index-modulation (QIM) watermarking with lattice decoding. It is shown that in both systems, the optimal attack has the same distribution. A closed-form expression for the error is also given.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Oct 20 2003
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

Fingerprint

Error Exponent
Watermarking
Decoding
Game
Quantization (signal)
Spread Spectrum
Nearest Neighbor
Quantization
Closed-form
Modulation
Attack

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

@article{82a6078e331a49dd80e093cc4eed1821,
title = "Error exponents for watermarking game with squared-error constraints",
abstract = "An overview is given of an error-exponent game for the following two popular systems: spread-spectrum (SS) watermarking with nearest-neighbor decoding, and quantization-index-modulation (QIM) watermarking with lattice decoding. It is shown that in both systems, the optimal attack has the same distribution. A closed-form expression for the error is also given.",
author = "Tie Liu and Pierre Moulin",
year = "2003",
month = "10",
day = "20",
language = "English (US)",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8095",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Error exponents for watermarking game with squared-error constraints

AU - Liu, Tie

AU - Moulin, Pierre

PY - 2003/10/20

Y1 - 2003/10/20

N2 - An overview is given of an error-exponent game for the following two popular systems: spread-spectrum (SS) watermarking with nearest-neighbor decoding, and quantization-index-modulation (QIM) watermarking with lattice decoding. It is shown that in both systems, the optimal attack has the same distribution. A closed-form expression for the error is also given.

AB - An overview is given of an error-exponent game for the following two popular systems: spread-spectrum (SS) watermarking with nearest-neighbor decoding, and quantization-index-modulation (QIM) watermarking with lattice decoding. It is shown that in both systems, the optimal attack has the same distribution. A closed-form expression for the error is also given.

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

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

M3 - Conference article

AN - SCOPUS:0142008347

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

ER -