Multiuser successive refinement and multiple description coding

被引:5
作者
Tian, Chao [1 ]
Chen, Jun [2 ]
Diggavi, Suhas N. [1 ]
机构
[1] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, CH-1015 Lausanne, Switzerland
[2] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
关键词
multiple description coding; rate distortion; source coding; successive refinement;
D O I
10.1109/TIT.2007.913435
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this correspondence, we consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct in a successive-refinement fashion. An achievable region is given for the two-user two-layer case and it provides the complete rate-distortion region for the Gaussian source under the MSE distortion measure. The key observation is that this problem includes the multiple description (MD) problem (with two descriptions) as a subsystem, and the techniques useful in the MD problem can be extended to this case. It is shown that the coding scheme based on the universality of random binning is suboptimal, because multiple Gaussian side informations only at the decoders do incur performance loss, in contrast to the case of single side information at the decoder. It is further shown that unlike the single user case, when there are multiple users, the loss of performance by a multistage coding approach can be unbounded for the Gaussian source. The result suggests that in such a setting, the benefit of using successive refinement is not likely to justify the accompanying performance loss. The MSR problem is also related to the source coding problem where each decoder has its individual side information, while the encoder has the complete set of the side informations. The MSR problem further includes several variations of the MD problem, for which the specialization of the general result is investigated and the implication is discussed.
引用
收藏
页码:921 / 931
页数:11
相关论文
共 50 条
  • [41] Performance comparison of layered coding and multiple description coding in packet networks
    Zhou, YG
    Chan, WY
    GLOBECOM '05: IEEE Global Telecommunications Conference, Vols 1-6: DISCOVERY PAST AND FUTURE, 2005, : 2155 - 2159
  • [42] Successive Refinement of Abstract Sources
    Kostina, Victoria
    Tuncel, Ertem
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (10) : 6385 - 6398
  • [43] On the Multiple Description Coding Problem with One Semi-deterministic Distortion Measure
    Zhou, Lin
    Motani, Mehul
    GLOBECOM 2017 - 2017 IEEE GLOBAL COMMUNICATIONS CONFERENCE, 2017,
  • [44] Estimating Rate-Distortion for Multiple Description Coding Based on Zero Padding
    Chang, Rong-Hua
    Su, Chieh-Wei
    Lin, Chow-Sing
    JOURNAL OF APPLIED SCIENCE AND ENGINEERING, 2016, 19 (02): : 229 - 239
  • [45] Vector Gaussian Successive Refinement With Degraded Side Information
    Xu, Yinfei
    Guang, Xuan
    Lu, Jian
    Chen, Jun
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (11) : 6963 - 6982
  • [46] On Successive Refinement for the Kaspi/Heegard-Berger Problem
    Maor , Alina
    Merhav, Neri
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 57 (08) : 3930 - 3945
  • [47] Multicasting Multiple Description Coding Using p-cycle Network Coding
    Farzamnia, Ali
    Syed-Yusof, Sharifah K.
    Fisal, Norsheila
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2013, 7 (12): : 3118 - 3134
  • [48] KSVD-Based Multiple Description Image Coding
    Sun, Guina
    Meng, Lili
    Liu, Li
    Tan, Yanyan
    Zhang, Jia
    Zhang, Huaxiang
    IEEE ACCESS, 2019, 7 (1962-1972) : 1962 - 1972
  • [49] Space-time multiple description video coding
    Wang, D
    Canagarajah, N
    Bull, D
    VISUAL COMMUNICATIONS AND IMAGE PROCESSING 2006, PTS 1 AND 2, 2006, 6077
  • [50] Optimal overcomplete subband expansions for multiple description coding
    Mehrotra, S
    WAVELET APPLICATIONS IN SIGNAL AND IMAGE PROCESSING VIII PTS 1 AND 2, 2000, 4119 : 787 - 798