首页> 外文会议>Annual Allerton Conference on Communication, Control, and Computing >Rate distortion regions of Heegard-Berger problems with successive refinement and scalable coding
【24h】

Rate distortion regions of Heegard-Berger problems with successive refinement and scalable coding

机译:通过连续改进和可伸缩编码对Heegard-Berger问题的失真区域进行评估

获取原文

摘要

In this work, we study two instances of the Heegard-Berger problem. In both settings, an encoder observes a pair of memoryless, arbitrarily correlated, sources (S1n, S2n) and communicates with two receivers over an error-free rate-limited link of capacity R. Both receivers reproduce the source component S2n losslessly; and Receiver 1 also reproduces the source component S1n lossily, to within some prescribed fidelity level D1. Also, Receiver 1 and Receiver 2 are equipped respectively with memoryless side information sequences Y1n and Y2n. The side information sequences are arbitrarily correlated among them, and with the source pair (S1n, S2n). In addition, in the first setting, which is of successive refinement type, the encoder is also connected to Receiver 1 through an additional error-free rate-limited link of capacity R1. In the second setting, which is of reconstruction-scalable coding type, the individual link, of capacity R2, is provided to Receiver 2. We establish single-letter characterizations of the rate-distortion regions of both models in the discrete memoryless case.
机译:在这项工作中,我们研究了Heegard-Berger问题的两个实例。在这两种设置中,编码器均会观察一对无存储器,任意相关的源(S1n,S2n),并通过容量为R的无错速率限制链路与两个接收器进行通信。接收机1也有损地将源分量S1n再现到规定的保真度等级D1内。而且,接收机1和接收机2分别配备有无记忆的辅助信息序列Y1n和Y2n。辅助信息序列在它们之间以及与源对(S1n,S2n)是任意相关的。另外,在第一设置中,它是连续改进类型的,编码器还通过容量为R1的附加无差错速率限制链路连接到接收器1。在第二种设置中,它是可重构缩放的编码类型,容量为R2的单个链接被提供给接收器2。在离散无记忆的情况下,我们建立了两个模型的速率失真区域的单字母特征。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号