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
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Image classification using biologically inspired systems
MobiMedia '06 Proceedings of the 2nd international conference on Mobile multimedia communications
Computer Methods and Programs in Biomedicine
Using ant colony optimization and self-organizing map for image segmentation
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
A knowledge synthesizing approach for classification of visual information
VISUAL'07 Proceedings of the 9th international conference on Advances in visual information systems
Applying hybrid Kepso clustering to web pages
Proceedings of the 48th Annual Southeast Regional Conference
Ant colony optimization for the K-means algorithm in image segmentation
Proceedings of the 48th Annual Southeast Regional Conference
A survey: hybrid evolutionary algorithms for cluster analysis
Artificial Intelligence Review
Image classification using an ant colony optimization approach
SAMT'06 Proceedings of the First international conference on Semantic and Digital Media Technologies
Aggregation pheromone density based image segmentation
ICVGIP'06 Proceedings of the 5th Indian conference on Computer Vision, Graphics and Image Processing
Efficient stochastic algorithms for document clustering
Information Sciences: an International Journal
Hi-index | 0.00 |
In this paper the novel concept of ACO and its learning mechanism is integrated with the K-means algorithm to solve image clustering problems. The learning mechanism of the proposed algorithm is obtained by using the defined parameter called pheromone, by which undesired solutions of the K-means algorithm is omitted. The proposed method improves the K-means algorithm by making it less dependent on the initial parameters such as randomly chosen initial cluster centers, hence more stable.