Application of particle swarm optimization for traveling salesman problem to lossless compression of color palette images

被引：0

作者：

Electrical Engineering, Rochester Institute of Technology, Rochester, NY 14623, United States ^{[1
]}

不详 ^{[2
]}

机构：

[1] Electrical Engineering, Rochester Institute of Technology, Rochester

[2] Computer Science, SUNY Fredonia, Fredonia

来源：

IEEE Int. Conf. Syst. Syst. Eng., SoSE | 2008年

关键词：

Color image compression; Color re-indexing; Particle swarm optimization; Traveling salesmen problem;

D O I：

10.1109/SYSOSE.2008.4724207

中图分类号：

学科分类号：

摘要：

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. © 2008 IEEE.

引用

共 4 条

[1] Arnavut Z., Sahin F., Lossless Compression of Color Palette Images with One Dimensional Techniques, Journal of Electronic Imaging, 15, 2, (2006)
[2] Wang K.-P., Huang L., Zhou C.-G., Pang W., Particle swarm optimization for traveling salesman problem, International Conference on Machine Learning and Cybernetics, pp. 1583-1585, (2003)
[3] Shi X.H., Liang Y.C., Lee H.P., Lu C., Wang Q.X., Particle swarm optimization-based algorithms for TSP and generalized TSP, Information Processing Letters, 103, 5, pp. 169-176, (2007)
[4] Sahin F., Devasia A., Distributed Particle Swarm Optimization for Structural Bayesian Network Learning, Swarm Intelligence: Focus on Ant and Particle Swarm Optimization, pp. 505-532, (2007)

← 1 →