A Parallel Algorithm for Lossless Image Compression by Block Matching


Storer [1] generalized the LZ1 method to lossless image compression and suggested that v ery fast encoders are possible b y showing a square greedy matching LZ1 compression heuristic, which can be implemented by a simple hashing scheme and achieves 60 to 70 percent of the compression of JBIG1 on the CCITT bi-level image test set. The image must be scanned… (More)
DOI: 10.1109/DCC.2002.999993