Digital Image Processing
An Ant Colony Optimization Heuristic for Solving Maximum Independent Set Problems
ICCIMA '03 Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications
Hybridization of the ant colony optimization with the k-means algorithm for clustering
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
In this paper the ant colony optimization (ACO) is used in the K-means algorithm for improving the image segmentation. The learning mechanism of this algorithm is formulated by using the ACO meta-heuristic. As the pheromone dominates the exploration of ants for problem solutions, preliminary experiments on pheromone's update are reported. Two methods for defining and updating pheromone values are proposed and tested: one with the spatial coordinate distances and the other without using such a distance. The ACO improves the K-means algorithm by making it less dependent on the initial parameters.