Application of Particle Swarm Optimization for Traveling Salesman Problem to lossless compression of color palette images

Author

Van Hook, Joshua ; Sahin, Ferat ; Arnavut, Ziya

Author_Institution

Electr. Eng., Rochester Inst. of Technol., Rochester, NY

fYear

2008

fDate

2-4 June 2008

Firstpage

1

Lastpage

5

Abstract

This paper investigates optimal color indexing for the compression of color palette images. This work enhances the recent traveling salesman problem (TSP) based re-indexing technique with particle swarm optimization (PSO). In this work, color re-indexing is done by solving the problem as a TSP using PSO. The proposed technique, yields better compression gains than the recent work that used a cross entropy (CE) based TSP for re-indexing.

Keywords

data compression; image coding; image colour analysis; particle swarm optimisation; travelling salesman problems; color palette images; color reindexing; compression gain; cross entropy based TSP; lossless compression; optimal color indexing; particle swarm optimization; reindexing technique; traveling salesman problem; Application software; Color; Computer science; Cost function; Entropy; Equations; Image coding; Indexing; Particle swarm optimization; Traveling salesman problems; Color image compression; color re-indexing; particle swarm optimization; traveling salesmen problem;

fLanguage

English

Publisher

ieee

Conference_Titel

System of Systems Engineering, 2008. SoSE '08. IEEE International Conference on

Conference_Location

Singapore

Print_ISBN

978-1-4244-2172-5

Electronic_ISBN

978-1-4244-2173-2

Type

conf

DOI

10.1109/SYSOSE.2008.4724207

Filename

4724207