Loading...
Parallel Lossless Image Compression Using Huffman and Arithmetic Coding
Howard, Paul G. Vitter, Jeffrey Scott
Howard, Paul G.
Vitter, Jeffrey Scott
Citations
Altmetric:
Abstract
We show that high-resolution images can be encoded and decoded e ciently in parallel. We
present an algorithm based on the hierarchical MLP method, used either with Hu man coding
or with a new variant of arithmetic coding called quasi-arithmetic coding. The coding step can
be parallelized, even though the codes for di erent pixels are of di erent lengths; parallelization
of the prediction and error modeling components is straightforward.
Description
Date
1996
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Research Projects
Organizational Units
Journal Issue
Keywords
Data compression, Huffman coding, Arithmetic coding, Parallel algorithms
Citation
P. G. Howard and J. S. Vitter. “Parallel Lossless Image Compression Using Huffman and Arithmetic Coding,” Information Processing Letters, 59, 1996, 65–73. An extended abstract appears in Proceedings of the 1992 IEEE Data Compression Conference (DCC ’92), Snowbird, UT, March 1992, 299–308. http://dx.doi.org/10.1016/0020-0190(96)00090-7