×

Robust multiple description distributed video coding using optimized zero-padding. (English) Zbl 1181.94024

Summary: Distributed video coding (DVC) arouses high interests due to its property of low-complexity encoding. This paper proposes a robust multiple description DVC (MDDVC) under the constraint of low-complexity encoding. In MDDVC, zeros are padded to each frame and the resulting big-size video is divided into multiple descriptions. Then, each description is compressed by a hybrid DVC (HDVC) codec and transmitted over different channel. When one channel does not work, the lost HDVC description is estimated by the received from other channel, which guarantees the robustness of the system; MDDVC moves the complex motion estimation totally to the decoder so it features low-complexity encoding. In the pre-processing, an optimized zero-padding is also proposed to improve the performance. Experimental results exhibit that the proposed MDDVC scheme achieves better rate-distortion performance and robustness than the referenced especially when packet-loss rate is high.

MSC:

94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
68U10 Computing methodologies for image processing
Full Text: DOI

References:

[1] Girod B, Aaron A, Rane S, et al. Distributed video coding. Proceed IEEE, 2005, 93(1): 71–83 · doi:10.1109/JPROC.2004.839619
[2] Puri R, Ramchandran K. PRISM: an uplink-friendly multimedia coding paradigm. In: Proceedings of International Conference on Acoustics, Speech, and Signal Processing, 2003, 4: 856–859
[3] Artigas X, Ascenso J, Dalai M, et al. The DISCOVER codec: architecture, techniques and evaluation. In: Proceedings of Picture Coding Symposium, 2007. 1950–1953
[4] Rane S, Aaron A, Girod B. Systematic lossy forward error protection for error-resilient digital video broadcasting–a Wyner-Ziv coding approach. In: Proceedings of International Conference on Image Processing, 2004. 609–612
[5] Crave O, Guillemot C, Pesquet-Popescu B, et al. Distributed temporal multiple description coding for robust video transmission. EURASIP J Wireless Commun Netw, 2008. Article ID: 183536 · Zbl 1184.94208
[6] Bai H, Zhao Y, Zhu C. Multiple description video coding using adaptive temporal subsampling. In: Proceedings of International Conference on Multimedia & Expo, 2007. 1331–1334
[7] Wang D, Canagarajah N, Redmill D, et al. Multiple description video coding based on zero padding. In: Proceedings of International Symposium on Circuits and Systems, 2004. 205–208
[8] Fan Y H, Wang J, Sun J, et al. A novel multiple description video codec based on Slepian-Wolf coding. In: Proceedings of IEEE Data Compression Conference, 2008. 515
[9] Wu M, Vetro A, Chen CW. Multiple description image coding with distributed source coding and side information. In: Proceedings of SPIE Multimedia System and Application, 2004, VII: 3–10
[10] Aaron A, Varodayan D, Girod B. Wyner-Ziv residual coding of video. In: Proceedings of Picture Coding Symposium, 2006. 2–7 · Zbl 1172.94546
[11] Tang C, Cheung N, Ortega A, et al. Efficient inter-band prediction and wavelet based compression for hyerspectral imagery: a distributed source coding approach. In: Proceedings of IEEE Data Compression Conference, 2005. 437–446
[12] Wang A, Zhao Y. Efficient wavelet zero-tree video coding based on Wyner-Ziv coding and lattice vector quantization. In: Proceedings of International Conference on Innovative Computing, Information and Control, 2006. 245–258
[13] Varodayan D, Aaron A, Girod B. Rate-adaptive distributed source coding using low-density parity-check codes. In: Proceedings of Asilomar Conference on Signals, Systems and Computers, 2005. 1–8 · Zbl 1172.94546
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.