| dc.contributor.author | Howard, Paul G. | |
| dc.contributor.author | Vitter, Jeffrey Scott | |
| dc.date.accessioned | 2011-03-21T18:19:57Z | |
| dc.date.available | 2011-03-21T18:19:57Z | |
| dc.date.issued | 1996 | |
| dc.identifier.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 | |
| dc.identifier.uri | http://hdl.handle.net/1808/7207 | |
| dc.description.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. | |
| dc.language.iso | en_US | |
| dc.publisher | Elsevier | |
| dc.subject | Data compression | |
| dc.subject | Huffman coding | |
| dc.subject | Arithmetic coding | |
| dc.subject | Parallel algorithms | |
| dc.title | Parallel Lossless Image Compression Using Huffman and Arithmetic Coding | |
| dc.type | Article | |
| kusw.kuauthor | Vitter, Jeffrey Scott | |
| kusw.oastatus | fullparticipation | |
| dc.identifier.doi | 10.1016/0020-0190(96)00090-7 | |
| kusw.oaversion | Scholarly/refereed, author accepted manuscript | |
| kusw.oapolicy | This item meets KU Open Access policy criteria. | |
| dc.rights.accessrights | openAccess | |
