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

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.