.png){kind=icon}
.png){kind=icon}
Return
Dynamic clustering using particle swarm optimization with application in image segmentation
.png){kind=icon}
PRE
AI
DOI：10.1007/s10044-005-0015-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new dynamic clustering approach (DCPSO), based on particle swarm optimization, is proposed. This approach is applied to image segmentation. The proposed approach automatically determines the optimum number of clusters and simultaneously clusters the data set with minimal user interference. The algorithm starts by partitioning the data set into a relatively large number of clusters to reduce the effects of initial conditions. Using binary particle swarm optimization the best number of clusters is selected. The centers of the chosen clusters is then refined via the K-means clustering algorithm. The proposed approach was applied on both synthetic and natural images. The experiments conducted show that the proposed approach generally found the optimum number of clusters on the tested images. A genetic algorithm and random search version of dynamic clustering is presented and compared to the particle swarm version.
Keywords:
unsupervised clustering
clustering validation
particle swarm optimization
image segmentation
Journal
IF:
2
Papers:
1.9K
Citations:
1.9K
Organization
No organization information available