Parallel lossless image compression using Huffman and arithmetic coding
Authors:
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 299-308
Abstract
The authors show that high-resolution images can be encoded and decoded efficiently in parallel. They present an algorithm based on the hierarchical multi-level progressive (MLP) method, used either with Huffman coding or with a new variant of arithmetic coding called quasi-arithmetic coding. The coding step can be parallelized, even though the codes for different pixels are of different lengths; parallelization of the prediction and error modeling components is straightforward.Keywords
This publication has 7 references indexed in Scilit:
- Error modeling for hierarchical lossless image compression2003
- Analysis of arithmetic coding for data compression2002
- High efficiency, multiplication free approximation of arithmetic coding2002
- New methods for lossless image compression using arithmetic coding2002
- A multiplication-free multialphabet arithmetic codeIEEE Transactions on Communications, 1989
- Arithmetic coding for data compressionCommunications of the ACM, 1987
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952