Channel Coding in the Presence of Side Information
Foundations and Trends in Communications and Information Theory
IEEE Transactions on Multimedia
Random-coding lower bounds for the error exponent of joint quantization and watermarking systems
IEEE Transactions on Information Theory
Robust image data hiding using geometric mean quantization
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Contourlet-based image watermarking using optimum detector in a noisy environment
IEEE Transactions on Image Processing
Variations on information embedding in multiple access and broadcast channels
IEEE Transactions on Information Theory
| Hi-index | 754.96 |
We consider the problem of optimum joint public information embedding and lossy compression with respect to a fidelity criterion. The decompressed composite sequence (stegotext) is distorted by a stationary memoryless attack, resulting in a forgery which in turn is fed into the decoder, whose task is to retrieve the embedded information. The goal of this paper is to characterize the maximum achievable embedding rate$R_e$(the embedding capacity$C_e$) as a function of the compression (composite) rate$R_c$and the allowed average distortion level$Delta$, such that the average probability of error in decoding of the embedded message can be made arbitrarily small for sufficiently large block length. We characterize the embedding capacity and demonstrate how it can be approached in principle. We also provide a single-letter expression of the minimum achievable composite rate as a function of$R_e$and$Delta$, below which there exists no reliable embedding scheme.