Context Clustering in Lossless Compression of Gray-Scale Image
We consider and evaluate the context clustering method for lossless image compression based on the existing LOCO-I algorithm used in JPEG-LS — the latest lossless image compression standard. We employ the LOCO-I Medpredictor to enroll the error pixels. The contexts are defined by calculating gradient of current pixels. The three directional gradients are quantized with different codebook size (7, 9, 19) respectively. The error pixels are then corrected and encoded by the clustered-contexts. A main advantage of using the context clustering method is that it can eliminate the storage of probability vector. An adaptive arithmetic encoder is also introduced to yield a higher compression rate.
KeywordsGrayscale Image Lossless Compression Current Pixel Codebook Size Adaptive Coder
- 1.Howard, P., Vitter, J.: Fast and Efficient Lossless Image Compression. In: Storer, J., Cohn, M. (eds): Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, March 30–April 1, 1993. IEEE Computer Society Press (1993) 351–360Google Scholar
- 2.Weinberger M., Seroussi G., Sapiro G.: A Low Complexity, Context-Based, Lossless Image Compression Algorithm. In: Storer, J., Cohn, M. (eds): Proceedings of the 6th Data Compression Conference, Snowbird, Utah, March 31–April 3, 1996. IEEE Computer Society Press (1996) 140–149Google Scholar
- 5.Ekstrand, N.: Lossless Compression of Grayscale Images via Context Tree Weighting. In: Storer, J., Cohn, M. (eds): Proceedings of the 6th Data Compression Conference, Snowbird, Utah, March 31–April 3, 1996. IEEE Computer Society Press (1996) 132–139Google Scholar
- 6.Greene, D.H., Yao F., Zhang T.: A Linear Algorithm for Optimal Context Clustering with Application to Bi-level Image Coding. In: Proceedings of the 1998 IEEE Int. Conf. on Image Processing, Chicago, Illinois, October 4–7, 1998. IEEE Computer Society (1998) 508–511Google Scholar