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 条
  • [1] On the Role of the Refinement Layer in Multiple Description Coding and Scalable Coding
    Wang, Jia
    Chen, Jun
    Zhao, Lei
    Cuff, Paul
    Permuter, Haim
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (03) : 1443 - 1456
  • [2] On multistage successive refinement for Wyner-Ziv source coding with degraded side informations
    Tian, Chao
    Diggavi, Suhas N.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (08) : 2946 - 2960
  • [3] An improvement to multiple description transform coding
    Wang, Y
    Reibman, AR
    Orchard, MT
    Jafarkhani, H
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2002, 50 (11) : 2843 - 2854
  • [4] Distortion Minimization in Gaussian Layered Broadcast Coding With Successive Refinement
    Ng, Chris T. K.
    Guenduez, Deniz
    Goldsmith, Andrea J.
    Erkip, Elza
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (11) : 5074 - 5086
  • [5] Additive successive refinement
    Tuncel, E
    Rose, K
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (08) : 1983 - 1991
  • [6] Successive Refinement With Decoder Cooperation and Its Channel Coding Duals
    Asnani, Himanshu
    Permuter, Haim H.
    Weissman, Tsachy
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (09) : 5511 - 5533
  • [7] Tree-Structured Multiple Description Coding
    Jean Cardinal
    Journal of VLSI signal processing systems for signal, image and video technology, 2003, 33 : 287 - 294
  • [8] Tree-structured multiple description coding
    Cardinal, J
    JOURNAL OF VLSI SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2003, 33 (03): : 287 - 294
  • [9] LEARNED LAYERED CODING FOR SUCCESSIVE REFINEMENT IN THE WYNER-ZIV PROBLEM
    Joukovsky, Boris
    De Weerdt, Brent
    Deligiannis, Nikos
    2024 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, ICASSP 2024, 2024, : 6020 - 6024
  • [10] Multiple description coding using pairwise correlating transforms
    Wang, Y
    Orchard, MT
    Vaishampayan, V
    Reibman, AR
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2001, 10 (03) : 351 - 366