Error-resilient and progressive transmission and decoding of compressed images

This paper describes an approach for structuring and transmitting a sequence of variable length codewords in order to allow for a robust and progressive transmission over noisy channels. The dependencies within the resulting bitstream can be easily modeled with a stochastic automaton leading naturally to efficient soft decoding techniques with a complexity comparable to the complexity obtained with classical bitstream structures. Simulation results reveal, with both theoretical sources and real images, high performances in terms of symbol error rates and mean square reconstruction error at no cost in compression efficiency with both hard and soft decoding.

[1]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[2]  Thomas J. Ferguson,et al.  Self-synchronizing Huffman codes , 1984, IEEE Trans. Inf. Theory.

[3]  M. Wada,et al.  Reversible variable length codes , 1995, IEEE Trans. Commun..

[4]  Nick G. Kingsbury,et al.  The EREC: an error-resilient technique for coding variable-length blocks of data , 1996, IEEE Trans. Image Process..

[5]  Khalid Sayood,et al.  Joint source/channel coding for variable length codes , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[6]  Thomas E. Fuja,et al.  Joint source-channel decoding of variable-length encoded sources , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[7]  John D. Villasenor,et al.  Reversible variable length codes for efficient and robust image and video coding , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[8]  Joachim Hagenauer,et al.  Symbol-by-Symbol MAP Decoding of Variable Length Codes , 2000 .

[9]  Joint source/channel coding for variable length codes , 2000, IEEE Trans. Commun..

[10]  Christine Guillemot,et al.  Joint source-channel turbo decoding of entropy-coded sources , 2001, IEEE J. Sel. Areas Commun..