Implications for High Capacity Data Hiding in Presence of Lossy Compression

Authors:
Deepa Kundur
Affiliations:
-
Venue:
ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
Year:
2000

Citing 3
Cited 2

Elements of information theory

Elements of information theory
Digital watermarking for copyright protection of MPEG2 compressed video

IEEE Transactions on Consumer Electronics
Image-adaptive watermarking using visual models

IEEE Journal on Selected Areas in Communications

Source Requantization: Successive Degradation and Bit Stealing

DCC '02 Proceedings of the Data Compression Conference
A robust information hiding methodology in wavelet domain

SIP '07 Proceedings of the Ninth IASTED International Conference on Signal and Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive capacity bounds for watermarking and data hiding in the presence of JND perceptual coding for a class of techniques that do not suffer from host signal interference. By modeling the lossy compression distortions on the hidden data using non-Gaussian statistics, we demonstrate that binary antipodal channel codes achieve capacity. It is shown that the data hiding capacity is at most equal to the loss in storage efficiency bit rate if watermarking and quantization for lossy compression occur in the same domain.