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

Authors:
A. J. Pinho;A. J.R. Neves
Affiliations:
Dept. of Electron. & Telecommun., Univ. de Aveiro, Portugal;-
Venue:
IEEE Transactions on Image Processing
Year:
2004

Citing 0
Cited 4

On the relation between Memon's and the modified Zeng's palette reordering methods

Image and Vision Computing
Re-ordering methods in adaptive rank-based re-indexing scheme

PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Efficient reordering algorithm for color palette image using adaptive particle swarm technique

Applied Soft Computing
Securing color information of an image by concealing the color palette

Journal of Systems and Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

Palette reordering is a well-known and very effective approach for improving the compression of color-indexed images. In this paper, we provide a survey of palette reordering methods, and we give experimental results comparing the ability of seven of them in improving the compression efficiency of JPEG-LS and lossless JPEG 2000. We concluded that the pairwise merging heuristic proposed by Memon et al. is the most effective, but also the most computationally demanding. Moreover, we found that the second most effective method is a modified version of Zeng's reordering technique, which was 3%-5% worse than pairwise merging, but much faster.