On joint information embedding and lossy compression

作     者：Maor, A Merhav, N 

作者机构：Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION THEORY》 (IEEE Trans. Inf. Theory)

年 卷 期：2005年第51卷第8期

页      面：2998-3008页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Manuscript received July 16, 2003 revised March 27, 2005. This correspondence is part of A. Maor’s M.Sc. thesis. The material in this correspondence was presented in part at the IEEE International Symposium on Information Theory, Chicago, IL, Jun./Jul. 2004. The authors are with the Department of Electrical Engineering, Technion– Israel Institute of Technology, Technion City, Haifa 32000, Israel (e-mail: alinam@tx.technion.ac.il merhav@ee.technion.ac.il). Communicated by R. W. Yeung, Associate Editor for Shannon Theory. Digital Object Identifier 10.1109/TIT.2005.851767 

主　　题：entropy coding information embedding information hiding lossless/lossy compression rate-distortion theory watermarking 

摘      要：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-c as a function of the embedding rate R-c and the average distortion level 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-c and Delta, above which there exist no reliable embedding schemes.