The Likelihood Encoder for Lossy Compression
The Likelihood Encoder for Lossy Compression
复制标题
有损压缩的似然编码器
DOI：
--
复制
发表时间：
2014
影响因子：
2.5
通讯作者：
H. Poor
中科院分区：
文献类型：
--
作者：
Eva C. Song;P. Cuff;H. Poor
在有损信源压缩的背景下研究了似然编码器。似然编码器的分析基于软覆盖引理。它表明，使用的似然编码器与软覆盖引理产生简单的可扩展性证明经典的信源编码问题。点对点率失真函数、在解码器处具有边信息的率失真函数（即，Wyner-Ziv问题），以及多终端信源编码内界（即，Berger-Tung问题）。此外，针对点对点情况使用非渐进分析来检查该方法提供的过度失真的上限。似然编码器还涉及到最近的替代技术，使用随机分箱的属性。
A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering lemma yields simple achievability proofs for classical source coding problems. The cases of the point-to-point rate-distortion function, the rate-distortion function with side information at the decoder (i.e., the Wyner-Ziv problem), and the multi-terminal source coding inner bound (i.e., the Berger-Tung problem) are examined in this paper. Furthermore, a non-asymptotic analysis is used for the point-to-point case to examine the upper bound on the excess distortion provided by this method. The likelihood encoder is also related to a recent alternative technique using the properties of random binning.