Error resilient arithmetic coding of still images

This paper examines the use of arithmetic coding in conjunction with the error resilient entropy code (EREC). The constraints on the coding model are discussed and simulation results are presented and compared to those obtained using Huffman coding. These results show that without the EREC, arithmetic coding is less resilient than Huffman coding, while with the EREC both systems yield comparable results.

[1]  Jorma Rissanen,et al.  Compression of Black-White Images with Arithmetic Coding , 1981, IEEE Trans. Commun..

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

[3]  A. R. Reibman,et al.  Self-synchronizing variable-length codes for image transmission , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  Nick G. Kingsbury,et al.  Still image coding for noisy channels , 1994, Proceedings of 1st International Conference on Image Processing.

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