Adaptive preprocessing scheme using rank for lossless indexed image compression

Abstract

This paper proposes a brand-new preprocessing scheme using the ranking of co-occurrence count about indices in neighboring pixels. Original indices in an index image are substituted by their ranks. Arithmetic coding, then, is followed. Using this proposed algorithm, a better compression efficiency can be expected with higher data redundancy because the indices of the most pixels are concentrated to the relatively few rank numbers. Experimental results show that the proposed algorithm achieves a better compression performance up to 26-48% over GIF, arithmetic coding and Zeng's scheme. © Springer-Verlag Berlin Heidelberg 2005.