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

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.

[1]  Chunguang Zhou,et al.  Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[2]  Ferat Sahin,et al.  Distributed Particle Swarm Optimization for Structural Bayesian Network Learning , 2007 .

[3]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[4]  Joshua Van Hook,et al.  Application of Particle Swarm Optimization for Traveling Salesman Problem to lossless compression of color palette images , 2008, 2008 IEEE International Conference on System of Systems Engineering.

[5]  Wenjun Zeng,et al.  An efficient color re-indexing scheme for palette-based compression , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[6]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[7]  Khalid Sayood.  Lossless Compression Handbook , 2003 .

[8]  Shie Mannor,et al.  A Tutorial on the Cross-Entropy Method , 2005, Ann. Oper. Res..

[9]  Sebastiano Battiato,et al.  Self Organizing Motor Maps for Color-Mapped Image Re-Indexing , 2007, IEEE Transactions on Image Processing.

[10]  Ziya Arnavut,et al.  Lossless compression of color palette images with one-dimensional techniques , 2006, J. Electronic Imaging.

[11]  Sebastiano Battiato,et al.  An efficient Re-indexing algorithm for color-mapped images , 2004, IEEE Transactions on Image Processing.

[12]  Nasir D. Memon,et al.  On ordering color maps for lossless predictive coding , 1996, IEEE Trans. Image Process..

[13]  Russell C. Eberhart,et al.  Recent advances in particle swarm , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[14]  Armando J. Pinho,et al.  A note on Zeng's technique for color reindexing of palette-based images , 2004, IEEE Signal Processing Letters.

[15]  Soo-Chang Pei,et al.  Effective palette indexing for image compression using self-organization of Kohonen feature map , 2006, IEEE Transactions on Image Processing.

[16]  Armando J. Pinho,et al.  On the relation between Memon's and the modified Zeng's palette reordering methods , 2006, Image Vis. Comput..

[17]  David Malah,et al.  Improved lossless compression of color-mapped images by an approximate solution of the traveling salesman problem , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[18]  Armando J. Pinho,et al.  A survey on palette reordering methods for improving the compression of color-indexed images , 2004, IEEE Transactions on Image Processing.

[19]  Barry R. Secrest.  Traveling Salesman Problem for Surveillance Mission Using Particle Swarm Optimization , 2012 .

[20]  F. Sahin,et al.  Improved lossless compression of color palette images by re-indexing with particle swarm optimization , 2009, 2009 Fifth International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control.

[21]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..