Distributed Rate-Distortion With Common Components
Distributed Rate-Distortion With Common Components
复制标题
具有通用组件的分布式率失真
DOI：
10.1109/tit.2011.2145570
复制
发表时间：
2011
影响因子：
2.5
通讯作者：
Y. Altug
中科院分区：
文献类型：
--
作者：
Aaron B. Wagner;Benjamin G. Kelly;Y. Altug
我们描述了一种具有分布式编码的率失真方案，其中要压缩的信源包含一个公共分量。我们表明，在某些情况下该方案是最优的，并且它严格优于现有的方案，现有的方案没有充分利用公共分量。这证明了对于在一个信源上有失真约束的双编码器问题，独立量化后接着独立分箱不是最优的。我们还表明，对于目标是无损重现其中一个信源的三编码器问题，独立量化和分箱是次优的。这提供了一个与科尔纳（Körner）和马顿（Marton）之前提供的反例从根本上不同的反例。证明依赖于熵功率不等式的二进制模拟以及二进制对称怀纳 - 齐夫（Wyner - Ziv）问题存在的速率损失。
We describe a scheme for rate-distortion with distributed encoding in which the sources to be compressed contain a common component. We show that this scheme is optimal in some situations and that it strictly improves upon existing schemes, which do not make full use of common components. This establishes that independent quantization followed by independent binning is not optimal for the two-encoder problem with a distortion constraint on one source. We also show that independent quantization and binning is suboptimal for the three-encoder problem in which the goal is to reproduce one of the sources losslessly. This provides a counterexample that is fundamentally different from one provided earlier by Körner and Marton. The proofs rely on the binary analogue of the entropy power inequality and the existence of a rate loss for the binary symmetric Wyner-Ziv problem.