Optimal sparse-QIM codes for zero-rate blind watermarking

Pierre Moulin, Anil K. Goteti, Ralf Koetter

Research output: Contribution to journalConference article

Abstract

The problem of blind watermarking of an arbitrary host signal in ℝ n under squared-error distortion constraints and Gaussian attacks is considered in this paper. While distortion-compensated lattice quantization index modulation (QIM) using nearly spherical Voronoi cells is known to be asymptotically capacity-achieving in this setup, our results suggest that such schemes are suboptimal in terms of error probability when the number of possible messages is subexponential in n. Our conjecture is substantiated by examples involving low-dimensional lattices and is related to the simplex conjecture in coding theory.

Original languageEnglish (US)
Pages (from-to)III73-III76
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume3
StatePublished - Sep 28 2004
EventProceedings - IEEE International Conference on Acoustics, Speech, and Signal Processing - Montreal, Que, Canada
Duration: May 17 2004May 21 2004

Fingerprint

Quantization (signal)
Watermarking
Modulation
modulation
messages
attack
coding
cells
Error probability

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Optimal sparse-QIM codes for zero-rate blind watermarking. / Moulin, Pierre; Goteti, Anil K.; Koetter, Ralf.

In: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, Vol. 3, 28.09.2004, p. III73-III76.

Research output: Contribution to journalConference article

@article{280f74e386e14f2ea7bac20860b11381,
title = "Optimal sparse-QIM codes for zero-rate blind watermarking",
abstract = "The problem of blind watermarking of an arbitrary host signal in ℝ n under squared-error distortion constraints and Gaussian attacks is considered in this paper. While distortion-compensated lattice quantization index modulation (QIM) using nearly spherical Voronoi cells is known to be asymptotically capacity-achieving in this setup, our results suggest that such schemes are suboptimal in terms of error probability when the number of possible messages is subexponential in n. Our conjecture is substantiated by examples involving low-dimensional lattices and is related to the simplex conjecture in coding theory.",
author = "Pierre Moulin and Goteti, {Anil K.} and Ralf Koetter",
year = "2004",
month = "9",
day = "28",
language = "English (US)",
volume = "3",
pages = "III73--III76",
journal = "Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing",
issn = "0736-7791",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Optimal sparse-QIM codes for zero-rate blind watermarking

AU - Moulin, Pierre

AU - Goteti, Anil K.

AU - Koetter, Ralf

PY - 2004/9/28

Y1 - 2004/9/28

N2 - The problem of blind watermarking of an arbitrary host signal in ℝ n under squared-error distortion constraints and Gaussian attacks is considered in this paper. While distortion-compensated lattice quantization index modulation (QIM) using nearly spherical Voronoi cells is known to be asymptotically capacity-achieving in this setup, our results suggest that such schemes are suboptimal in terms of error probability when the number of possible messages is subexponential in n. Our conjecture is substantiated by examples involving low-dimensional lattices and is related to the simplex conjecture in coding theory.

AB - The problem of blind watermarking of an arbitrary host signal in ℝ n under squared-error distortion constraints and Gaussian attacks is considered in this paper. While distortion-compensated lattice quantization index modulation (QIM) using nearly spherical Voronoi cells is known to be asymptotically capacity-achieving in this setup, our results suggest that such schemes are suboptimal in terms of error probability when the number of possible messages is subexponential in n. Our conjecture is substantiated by examples involving low-dimensional lattices and is related to the simplex conjecture in coding theory.

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

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

M3 - Conference article

AN - SCOPUS:4544256760

VL - 3

SP - III73-III76

JO - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

JF - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

SN - 0736-7791

ER -