Multiple description wavelet based image coding

被引:148
作者
Servetto, SD [1 ]
Ramchandran, K
Vaishampayan, VA
Nahrstedt, K
机构
[1] Ecole Polytech Fed Lausanne, Lab Commun Audiovisuelles, CH-1015 Lausanne, Switzerland
[2] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
[3] AT&T Labs Res, Informat Sci Res Ctr, Florham Pk, NJ 07932 USA
[4] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
基金
美国国家科学基金会;
关键词
error resilience; image coding; joint source/channel coding; multiple description source coding;
D O I
10.1109/83.841528
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider the problem of coding images for transmission over error-prone channels. The impairments we target are transient channel shutdowns, as would occur in a packet network when a packet is lost, or in a wireless system during a deep fade: when data is delivered it is assumed to be error-free, but some of the data may never reach the receiver. The proposed algorithms are based on a combination of multiple description scalar quantizers with techniques successfully applied to the construction of some of the most efficient subband coders. A given image is encoded into multiple independent packets of roughly equal length. When packets are lost, the quality of the approximation computed at the receiver depends only on the number of packets received, but does not depend on exactly which packets are actually received. When compared with previously reported results on the performance of robust image coders based on multiple descriptions, on standard test images, our coders attain similar PSNR values using typically about 50-60% of the bit rate required by these other state-of-the-art coders, while at the same time providing significantly more freedom in the mechanism for allocation of redundancy among descriptions.
引用
收藏
页码:813 / 826
页数:14
相关论文
共 15 条
[1]   Priority encoding transmission [J].
Albanese, A ;
Blomer, J ;
Edmonds, J ;
Luby, M ;
Sudan, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) :1737-1744
[2]   A linear time erasure-resilient code with nearly optimal recovery [J].
Alon, N ;
Luby, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) :1732-1736
[3]   Asymptotic performance of multiple description transform codes [J].
Batllo, JC ;
Vaishampayan, VA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (02) :703-707
[4]  
ELGAMAL AA, 1982, IEEE T INFORM THEORY, V28, P851, DOI 10.1109/TIT.1982.1056588
[5]   SUCCESSIVE REFINEMENT OF INFORMATION [J].
EQUITZ, WHR ;
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (02) :269-275
[6]   Comparison of different methods of classification in subband coding of images [J].
Joshi, RL ;
Jafarkhani, H ;
Kasner, JH ;
Fischer, TR ;
Farvardin, N ;
Marcellin, MW ;
Bamberger, RH .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1997, 6 (11) :1473-1486
[7]   ON A SOURCE-CODING PROBLEM WITH 2 CHANNELS AND 3 RECEIVERS [J].
OZAROW, L .
BELL SYSTEM TECHNICAL JOURNAL, 1980, 59 (10) :1909-1921
[8]   A new, fast, and efficient image codec based on set partitioning in hierarchical trees [J].
Said, A ;
Pearlman, WA .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 1996, 6 (03) :243-250
[9]   Joint multipath-Doppler diversity in mobile wireless communications [J].
Sayeed, AM ;
Aazhang, B .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (01) :123-132
[10]   Image coding based on a morphological representation of wavelet data [J].
Servetto, SD ;
Ramchandran, K ;
Orchard, MT .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1999, 8 (09) :1161-1174