On the duality between distributed source coding and data hiding

Published 22 January 2003

J. Chou, S. Sandeep Pradhan, Kannan Ramchandran

DOI10.1109/acssc.1999.832000

Citations91

TL;DR

A powerful constructive approach to the watermarking problem, emphasizing the dual roles of "source codes" and "channel codes" is proposed, and various source and channel codes are explored to achieve watermarks that are robust to attackers.

Abstract

Inspired by a previously proposed constructive framework for the distributed source coding problem, we propose a powerful constructive approach to the watermarking problem, emphasizing the dual roles of "source codes" and "channel codes". In our framework, we explore various source and channel codes to achieve watermarks that are robust to attackers in terms of maximizing the distortion between the corrupted coded-source signal and the original signal while holding the distortion between the coded-source signal and the original signal constant. Simulations show that performance gains are accredited to a careful choice of source and channel codes.

Keywords

Computer ScienceEngineering

Elements of Information Theory

37,533 Citations2001Thomas M. Cover, Joy A. Thomas

IEEE Transactions on Image ProcessingSecure spread spectrum watermarking for multimedia

5,271 Citations1997Ingemar J. Cox, Joe Kilian +2 more

IEEE Transactions on Information TheoryNoiseless coding of correlated information sources

4,013 Citations1973D. Slepian, J.K. Wolf

The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.

IEEE Transactions on Information TheoryWriting on dirty paper (Corresp.)

3,779 Citations1983Mónica Costa

It is shown that the optimal transmitter adapts its signal to the state S rather than attempting to cancel it, which is also the capacity of a standard Gaussian channel with signal-to-noise power ratio P/N.

IEEE Transactions on Information TheoryThe rate-distortion function for source coding with side information at the decoder

3,039 Citations1976A.D. Wyner, J. Ziv

The quantity R \ast (d) is determined, defined as the infimum ofrates R such that communication is possible in the above setting at an average distortion level not exceeding d + \varepsilon .

IEEE Transactions on Information TheoryDistributed source coding using syndromes (DISCUS): design and construction

959 Citations2003S. Sandeep Pradhan, Kannan Ramchandran

This work addresses the problem of compressing correlated distributed sources, i.e., correlated sources which are not co-located or which cannot cooperate to directly exploit their correlation and provides a constructive practical framework based on algebraic trellis codes dubbed as DIstributed Source Coding Using Syndromes (DISCUS), that can be applicable in a variety of settings.

IEEE Transactions on Information TheoryInformation-theoretic analysis of information hiding

673 Citations2003Pierre Moulin, Joseph A. O’Sullivan

Lecture notes in computer scienceAn Information-Theoretic Model for Steganography

673 Citations1998Christian Cachin

IEEE Transactions on Information TheoryOn the capacity of computer memory with defects

335 Citations1983C. Heegard, Abbas El Gamal

A computer memory with defects is modeled as a discrete memoryless channel with states that are statistically determined, and Arimoto-Blahut type algorithms are used to compute the storage capacity.

Distributed source coding using syndromes (DISCUS): design and construction

301 Citations1999S. Sandeep Pradhan, Kannan Ramchandran

This work introduces a new construction and practical framework for tackling the problem of distributed source coding based on the judicious incorporation of channel coding principles into this source coding problem and focuses in this paper on trellis-structured constructions of the framework to illustrate its utility.