Efficient reordering algorithm for color palette image using adaptive particle swarm technique

Authors:
P. Niraimathi;M. S. Sudhakar;K. Bhoopathy Bagan
Affiliations:
Department of Electronics Engineering, Madras Institute of Technology, Anna University, Chennai 600 044, India;Department of Electronics Engineering, Madras Institute of Technology, Anna University, Chennai 600 044, India;Department of Instrumentation Engineering, Madras Institute of Technology, Anna University, Chennai 600 044, India
Venue:
Applied Soft Computing
Year:
2012

Citing 7
Cited 0

Improved lossless compression of color-mapped images by an approximate solution of the traveling salesman problem

ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03
Particle swarm optimization-based algorithms for TSP and generalized TSP

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

Image and Vision Computing
On ordering color maps for lossless predictive coding

IEEE Transactions on Image Processing
A survey on palette reordering methods for improving the compression of color-indexed images

IEEE Transactions on Image Processing
Effective palette indexing for image compression using self-organization of Kohonen feature map

IEEE Transactions on Image Processing
Self Organizing Motor Maps for Color-Mapped Image Re-Indexing

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Palette re-ordering is a class of pre-processing methods aiming at finding a permutation of color palette such that the resulting image of indexes is more amenable for compression. The objective is to manipulate the palette index such that the adjacent symbols are assigned close indices in the symbol space, thus enhancing the compressibility of the image with many lossless compressors. Finding an exact reordered palette would certainly be exhaustive and computationally complex. To address this issue, a heuristic approach based on Traveling Salesman Problem formulation (NP hard) is sought. In this paper, the solution to this NP hard problem is presented by using an Adaptive Particle Swarm Optimization to achieve fast global convergence by maximizing the co-occurrences.