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
|Translated title of the contribution||Error resilient arithmetic coding of still images|
|Title of host publication||Unknown|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||109 - 112|
|ISBN (Print)||07803258x, 0780332598|
|Publication status||Published - Sep 1996|
|Event||International Conference on Image Processing - Lausanne, Switzerland|
Duration: 1 Sep 1996 → …
|Conference||International Conference on Image Processing|
|Period||1/09/96 → …|
Bibliographical noteConference Proceedings/Title of Journal: IEEE International Conference on Image Processing
Rose publication type: Conference contribution
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to email@example.com.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.