Symbol mapping and context filtering for lossless image compression
Guang Yi Deng · 2002
Key building blocks of lossless image compression algorithms include adaptive prediction, context-based error feedback and adaptive entropy coding. This paper presents a new algorithm which includes two other building blocks-symbol mapping and context filtering. Experimental results show that the compression performance of the proposed algorithm is very close to that of CALIC and is better than that of LOGO and S+P. It is different from CALIC in the following aspects: (1) an adaptive median-FIR predictor, (2) a new error representation scheme using symbol mapping, (3) a different context calculation scheme for the prediction error, and (4) a new context filtering scheme.