DOI: 10.3724/SP.J.1146.2007.00126

Journal of Electronics & Information Technology (电子与信息学报) 2008/30:8 PP.1836-1840

Efficient Multiple Description Image Coding over Error-Prone Channels Based on Frame Expansion

Multiple description image coding based on quantized frame expansion performs very well over error-prone channels. In this paper, an efficient multiple description image coding based on frame expansion is proposed. Firstly, an optical uniform tight frame is designed, which can minimize the mean squared error with quantization. Then, basic unit of frame expansion is constructed from wavelet zerotrees and different frames are applied to coefficients in different sub-bands. In that way, different sub-bands gain different protections during the transmission. After quantization and entropy coding, multiple description bit streams are generated from frame expansion. The experiment results prove that compared with other methods based on frame expansion, the scheme can obtain better recovery images under the same channel condition.

Key words:Image transportation,Multiple description coding,Frame expansion,Wavelet zero-trees

ReleaseDate:2014-07-21 15:37:30

[1] Goyal V K. Multiple description coding: Compression meets the netwok. IEEE Signal Processing Magazine, 2001, 18(5): 74-93.

[2] Vaishampayan V A. Design of multiple description scalar quantizers. IEEE Trans. on Information Theory, 1993, 39(3): 821-834.

[3] Wang Y, Orchard M T, and Reibman A. Multiple description image coding for noisy channels by pairing transform coefficients. IEEE First Workshop on Multimedia Signal Processing, Princeton, NJ, 1997: 419-424.

[4] Goyal V K, Kovacevic J, Arean R, and Vetterli M. Multiple description transform coding of images. Proc. of ICIP’98, Chicago, IL, 1998, 1: 674-678.

[5] Goyal V K, Vetterli M, and Thao N T. Quantized overcomplete expansions in IRN: Analysis, synthesis and algorithms. IEEE Trans. on Information Theory, 1998, 44(1): 16-31.

[6] Goyal V K, Kovacevic J, and Vetterli M. Multiple description transform coding: robustness to erasures using tight frame expansions. Proc. of International Symposium on Information Theory’ 98, Cambridge, MA, 1998: 408.

[7] Goyal V K, Kovacevic J, and Vetterli M. Quantized frame expansions as source-channel codes for erasure channels. Proc. of DCC’99, Snowbird, UT, 1999: 326-335.

[8] Kovacevic J, Dragotti P L, and Goyal V K. Filter bank frame expansions with erasures. IEEE Trans. on Information Theory, 2002, 48(6): 1439-1450.

[9] Dragotti P L, Kovacevic J, and Goyal V K. Quantized oversampled filter banks with erasures. Proc. of DCC’2001, Snowbird, UT, 2001: 173-182.

[10] Motwani R and Guillemot C. Tree-structured oversampled filterbanks as joint source-channel codes: Application to image transmission over erasure channels. IEEE Trans. on Signal Processing, 2004, 52(9): 2584-2599.

[11] Daubechies I. Ten Lectures on Wavelets. Philadelphia: SIAM, 1992: 56-101.

[12] Goyal V K, Kovacevic J, and Kelner J A. Quantized frame expansions with erasures. Applied and Computational Harmonic Analysis, 2001, 10(3): 203-233.