Parallel Lossless Image Compression Using Huffman and Arithmetic Coding

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.