A survey on palette reordering methods for improving the compression of color-indexed images

Self organizing motor maps for color-mapped image re-indexing

Palette re-ordering is an effective approach for improving the compression of color-indexed images. If the spatial distribution of the indexes in the image is smooth, greater compression ratios may be obtained. As is already known, obtaining an optimal re-indexing scheme is not a trivial task. In this paper, we provide a novel algorithm for palette re-ordering problem making use of a motor map neural network. Experimental results show the real effectiveness of the proposed method both in terms of compression ratio and zero-order entropy of local differences. Also, its computational complexity is competitive with previous works in the field.

Effective palette indexing for image compression using self-organization of Kohonen feature map

The process of limited-color image compression usually involves color quantization followed by palette re-indexing. Palette re-indexing could improve the compression of color-indexed images, but it is still complicated and consumes extra time. Making use of the topology-preserving property of self-organizing Kohonen feature map, we can generate a fairly good color index table to achieve both high image quality and high compression, without re-indexing. Promising experiment results will be presented.

Adaptive prediction trees for image compression

This paper presents a complete general-purpose method for still-image compression called adaptive prediction trees. Efficient lossy and lossless compression of photographs, graphics, textual, and mixed images is achieved by ordering the data in a multicomponent binary pyramid, applying an empirically optimized nonlinear predictor, exploiting structural redundancies between color components, then coding with hex-trees and adaptive runlength/Huffman coders. Color palettization and order statistics prefiltering are applied adaptively as appropriate. Over a diverse image test set, the method outperforms standard lossless and lossy alternatives. The competing lossy alternatives use block transforms and wavelets in well-studied configurations. A major result of this paper is that predictive coding is a viable and sometimes preferable alternative to these methods.