Error resilience and recovery in streaming of embedded video
2002, Signal Processing
https://doi.org/10.1016/S0165-1684(02)00301-8Abstract
The three-dimensional (3-D) SPIHT coder is a scalable or embedded coder that has proved its e ciency and its real-time capability in compression of video. A forward-error-correcting (FEC) channel (RCPC) code combined with a single automatic repeat request (ARQ) proved to be an e ective means for protecting the bitstream. There were two problems with this scheme: the noiseless reverse channel ARQ may not be feasible in practice; and, in the absence of channel coding and ARQ, the decoded sequence was hopelessly corrupted even for relatively clean channels. In this paper, we introduce a new method of partitioning wavelet coe cients into spatio-temporal (s-t) tree blocks to achieve error resilience. Each of these s-t blocks corresponds to the full 3-D image region, because roots of these trees are wavelet coe cients taken at ÿxed intervals in the root low-frequency subband. Previously, we reported on grouping contiguous root subband coe cients to generate s-t tree blocks that correspond to local 3-D regions. The new procedure brings higher error resilience, since lost coe cients can be concealed with the surrounding coe cients even if some of the coded s-t blocks are totally missing. The bitstreams of the coded s-t blocks are packetized and encoded with a channel code to correct errors and to prevent decoding of erroneous data after errors are detected. Because the separately encoded s-t blocks produce embedded bitstreams, the packets from the bitstreams are interleaved to generate an embedded composite bitstream. The embedded property, whereby successive compressed bits convey successively smaller value information, suggests unequal error protection, where earlier bits are more strongly protected by the channel code than later bits. Therefore, unequal error protection is also incorporated into our video bitstreams to bring an even higher degree of resilience to channel bit errors. Our claims are supported by extensive simulations with decoding of the various 3-D SPIHT bitstreams compared to each other and to MPEG-2. Superiority to MPEG-2 in noiseless and noisy channels, under equal conditions with or without FEC, is clearly demonstrated by the results of these simulations. ? 2002 Published by Elsevier Science B.V.
References (19)
- M. Antonini, M. Barlaud, P. Mathieu, I. Daubechies, Image coding using wavelet transform, IEEE Trans. Image Process. 1 (1992) 205-220.
- A. Aydin Alatan, M. Zhao, A.N. Akansu, Unequal error protection of SPIHT encoded image bit streams, IEEE J. Selected Areas Commun. 18 (June 2000) 814-818.
- G. Castagnoli, J. Ganz, P. Graber, Optimum redundancy check codes with 16-bit, IEEE Trans. Commun. 38 (January 1990) 111-114.
- S. Cho, W.A. Pearlman, A full-featured error resilient scalable video codec based on the Set Partitioning in Hierarchical Trees (SPIHT) algorithm, IEEE Trans. Circuits Systems Video Technol. 12 (March 2002) 157-171.
- C.D. Creusere, A family of image compression algorithms which are robust to transmission errors, Proc. SPIE 2668 (January 1996) 82-92.
- C.D. Creusere, Robust image coding using the embedded zerotree wavelet algorithm, Proceedings of the Data Compression Conference, March 1996, p. 432.
- C.D. Creusere, A new method of robust image compression based on the embedded zerotree wavelet algorithm, IEEE Trans. Image Process. 6 (10) (October 1997) 1436-1442.
- G.D. Forney Jr., The Viterbi algorithm, Proc. IEEE 61 (January 1994) 169-176.
- J. Hagenauer, Rate-compatible punctured convolutional codes (RCPC codes) and their applications, IEEE Trans. Commun. 36 (April 1988) 389-400.
- B.-J. Kim, W.A. Pearlman, An embedded wavelet video coder using three-dimensional set partitioning in hierarchical trees, Proceedings of the Data Compression Conference, March 1997, pp. 251-260.
- B.-J. Kim, Z. Xiong, W.A. Pearlman, Low bit-rate scalable video coding with 3D set partitioning in hierarchical trees (3D SPIHT), IEEE Trans. Circuits Systems Video Technol. 10 (December 2000) 1374-1387.
- B.-J. Kim, Z. Xiong, W.A. Pearlman, Y.S. Kim, Progressive video coding for noisy channels, J. Visual Commun. Image Representation 10 (1999) 173-185.
- T.V. Ramabadran, S.S. Gaitonde, A tutorial on CRC computations, IEEE Micro 8 (August 1988) 62-75.
- A. Said, W.A. Pearlman, A new, fast and e cient image codec based on set partitioning in hierarchical trees, IEEE Trans. Circuits Systems Video Technol. 6 (June 1996) 243-250.
- N. Seshadri, C. Sundberg, List Viterbi decoding algorithm with applications, IEEE Trans. Commun. 42 (1994) 111-114.
- J.M. Shapiro, Embedded image coding using zerotrees of wavelet coe cient, IEEE Trans. Signal Process. 41 (December 1993) 3445-3462.
- P.G. Sherwood, K. Zeger, Progressive image coding on noisy channels, Proceedings of the DCC, April 1997, pp. 72-81.
- P.G. Sherwood, Zeger, Progressive image coding for noisy channels, IEEE Signal Process. Lett. 4 (July 1997) 189-191.
- Z. Xiong, B.-J. Kim, W.A. Pearlman, Progressive video coding for noisy channels, Proceedings of the IEEE International Conference on Image Processing (ICIP '98), Vol.1, October 1998, pp. 334 -337.