Block-based histogram packing of color-quantized images
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
On the relation between Memon's and the modified Zeng's palette reordering methods
Image and Vision Computing
A color re-indexing scheme using genetic algorithm
MUSP'06 Proceedings of the 6th WSEAS international conference on Multimedia systems & signal processing
Speedup of color palette indexing in self-organization of Kohonen feature map
Expert Systems with Applications: An International Journal
Adaptive preprocessing scheme using rank for lossless indexed image compression
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Securing color information of an image by concealing the color palette
Journal of Systems and Software
| Hi-index | 0.02 |
Linear predictive techniques perform poorly when used with color-mapped images where pixel values represent indices that point to color values in a look-up table. Reordering the color table, however, can lead to a lower entropy of prediction errors. In this paper, we investigate the problem of ordering the color table such that the absolute sum of prediction errors is minimized. The problem turns out to be intractable, even for the simple case of one-dimensional (1-D) prediction schemes. We give two heuristic solutions for the problem and use them for ordering the color table prior to encoding the image by lossless predictive techniques. We demonstrate that significant improvements in actual bit rates can be achieved over dictionary-based coding schemes that are commonly employed for color-mapped images