Error exponents for watermarking game with squared-error constraints

Tie Liu; Pierre Moulin

doi:10.1109/isit.2003.1228204

Error exponents for watermarking game with squared-error constraints

Research output: Contribution to journal › Conference article › peer-review

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 language	English (US)
Pages (from-to)	190
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/isit.2003.1228204
State	Published - 2003
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Online availability

10.1109/isit.2003.1228204

Library availability

Discover UIUC Full Text

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",

doi = "10.1109/isit.2003.1228204",

language = "English (US)",

pages = "190",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8096",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

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

AU - Liu, Tie

AU - Moulin, Pierre

PY - 2003

Y1 - 2003

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

U2 - 10.1109/isit.2003.1228204

DO - 10.1109/isit.2003.1228204

M3 - Conference article

AN - SCOPUS:0142008347

SN - 2157-8096

SP - 190

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -

Error exponents for watermarking game with squared-error constraints

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this