On Joint Information Embedding and Lossy Compression
Alina Maor, Neri Merhav · IEEE Transactions on Information Theory · 2005
We consider the problem of optimum joint information embedding and lossy compression with respect to a fidelity criterion. The goal is to find the minimum achievable compression (composite) rate R/sub c/ as a function of the embedding rate R/sub e/ and the average distortion level /spl Delta/ allowed, 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 minimum achievable composite rate for both the public and the private versions of the problem and demonstrate how this minimum can be approached in principle. We also provide an alternative single-letter expression of the maximum achievable embedding rate (embedding capacity) as a function of R/sub c/ and /spl Delta/, above which there exist no reliable embedding schemes.