By Topic

Hyperspectal image clustering using ant colony optimization(ACO) improved by K-means algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Sun Xu ; Center for Earth Obs. & Digital Earth, Chinese Acad. of Sci., Beijing, China ; Zhang Bing ; Yang Lina ; Li Shanshan
more authors

Based on the comparison of K-means algorithm and ant colony optimization (ACO) algorithm in image clustering, this essay proposed a K-means-ACO algorithm to solve the problem of misclassification of K-means and slow convergence of ACO. K-means-ACO algorithm takes the results of K-means as the elicitation information of ACO, which adds illumination probability and illumination pixels in ants seeking rules of ACO, permits ants select nodes according to pheromone concentrations directly instead of probability, makes the elicitation information can be fully without altering the random search quality of ACO. Through the verification of simulation data and real data, the K-means-ACO algorithm can improve the clustering accuracy for adjusting the misclassification of K-means, and improve the ACO's convergence speed.

Published in:

Advanced Computer Theory and Engineering (ICACTE), 2010 3rd International Conference on  (Volume:2 )

Date of Conference:

20-22 Aug. 2010