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

► Traveling salesman problem for reindexing is sought using adaptive particle swarm optimization. ► Fast global convergence is obtained by maximizing the co-occurrences. ► Significant reduction in reindexing time compared with state-of-art methods. ► Entropy of the re-indexed image is greatly reduced. ► Histogram of the re-indexed image obtained has highly peaked distribution.