QIM watermarking games

Anil Kumar Goteti, Pierre Moulin

Research output: Contribution to journalConference article

Abstract

Quantization Index Modulation (QIM) methods are widely used for blind data embedding and watermarking. Given a QIM watermarking code, we ask what is the attacker's noise distribution that maximizes probability of error of the detector. For memoryless attacks, the problem is reduced to a convex programming problem. Next, we derive QIM code parameters that are minmax optimal.

Original languageEnglish (US)
Pages (from-to)717-720
Number of pages4
JournalProceedings - International Conference on Image Processing, ICIP
Volume5
StatePublished - Dec 1 2004
Event2004 International Conference on Image Processing, ICIP 2004 - , Singapore
Duration: Oct 18 2004Oct 21 2004

Fingerprint

Quantization (signal)
Watermarking
Modulation
Convex optimization
Detectors

ASJC Scopus subject areas

  • Engineering(all)

Cite this

QIM watermarking games. / Goteti, Anil Kumar; Moulin, Pierre.

In: Proceedings - International Conference on Image Processing, ICIP, Vol. 5, 01.12.2004, p. 717-720.

Research output: Contribution to journalConference article

@article{67ba52f377d946a090c9d62a09eff1a9,
title = "QIM watermarking games",
abstract = "Quantization Index Modulation (QIM) methods are widely used for blind data embedding and watermarking. Given a QIM watermarking code, we ask what is the attacker's noise distribution that maximizes probability of error of the detector. For memoryless attacks, the problem is reduced to a convex programming problem. Next, we derive QIM code parameters that are minmax optimal.",
author = "Goteti, {Anil Kumar} and Pierre Moulin",
year = "2004",
month = "12",
day = "1",
language = "English (US)",
volume = "5",
pages = "717--720",
journal = "Proceedings - International Conference on Image Processing, ICIP",
issn = "1522-4880",

}

TY - JOUR

T1 - QIM watermarking games

AU - Goteti, Anil Kumar

AU - Moulin, Pierre

PY - 2004/12/1

Y1 - 2004/12/1

N2 - Quantization Index Modulation (QIM) methods are widely used for blind data embedding and watermarking. Given a QIM watermarking code, we ask what is the attacker's noise distribution that maximizes probability of error of the detector. For memoryless attacks, the problem is reduced to a convex programming problem. Next, we derive QIM code parameters that are minmax optimal.

AB - Quantization Index Modulation (QIM) methods are widely used for blind data embedding and watermarking. Given a QIM watermarking code, we ask what is the attacker's noise distribution that maximizes probability of error of the detector. For memoryless attacks, the problem is reduced to a convex programming problem. Next, we derive QIM code parameters that are minmax optimal.

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

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

M3 - Conference article

AN - SCOPUS:20444476696

VL - 5

SP - 717

EP - 720

JO - Proceedings - International Conference on Image Processing, ICIP

JF - Proceedings - International Conference on Image Processing, ICIP

SN - 1522-4880

ER -