PARALLEL LOSSLESS IMAGE COMPRESSION USING HUFFMAN AND ARITHMETIC CODING

We show that high-resolution images can be encoded and decoded efficie ntly in parallel, We present an algorithm based on the hierarchical ML P method, used either with Huffman coding or with a new variant of ari thmetic coding called quasi-arithmetic coding. The coding step can be parallelized, even though the codes for different pixels are of differ ent lengths; parallelization of the prediction and error modeling comp onents is straightforward.