Article ID Journal Published Year Pages File Type
496345 Applied Soft Computing 2012 9 Pages PDF
Abstract
► 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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science Applications
Preview
Efficient reordering algorithm for color palette image using adaptive particle swarm technique
Authors
, , ,