A relationship between quantization and watermarking rates in the presence of additive Gaussian attacks

Authors:
D. Karakos;A. Papamarcou
Affiliations:
Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Random-coding lower bounds for the error exponent of joint quantization and watermarking systems

IEEE Transactions on Information Theory
Modulated lattice vector quantization: how to make quantization index modulation an efficient variable rate source coder

IEEE Transactions on Communications
Closed-form formulas for private watermarking capacities of laplacian sources with the magnitude-error distortion measure and under additive attacks

IWDW'05 Proceedings of the 4th international conference on Digital Watermarking

Quantified Score

Hi-index	754.90

Visualization

Abstract

A system which embeds watermarks in n-dimensional Gaussian data and distributes them in compressed form is studied. The watermarked/compressed data have to satisfy a distortion constraint, and the watermark has to be recoverable in a private scenario (in which the original data are available at the watermark detector). The performance of the system in the presence of additive Gaussian attacks is considered, and the region of achievable quantization and watermarking rate pairs (RQ,RW) is established. Moreover, two surprising facts are demonstrated: (1) at low RQ, the maximum achievable RW is the same as when there are no attacks; and (2) at high (but finite) RQ, the maximum achievable RW is the same as when there is no compression (RQ=∞). Finally, the performance of related schemes is also discussed.