Parallel Lossless Image Compression Using Huffman and Arithmetic Coding

View/ Open
Issue Date
1996Author
Howard, Paul G.
Vitter, Jeffrey Scott
Publisher
Elsevier
Type
Article
Article Version
Scholarly/refereed, author accepted manuscript
Metadata
Show full item recordAbstract
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.
Collections
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
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.