A New Approach of Dynamic Clustering Based on Particle Swarm Optimization and Application in Image Segmentation

keywords: Particle swarm optimization, neighborhood search, diversity, global optimization, dynamic clustering, image segmentation
This paper presents a new approach of dynamic clustering based on improved Particle Swarm Optimization (PSO) and which is applied to image segmentation (called DCPSONS). Firstly, the original PSO algorithm is improved by using diversity mechanism and neighborhood search strategy. The improved PSO is then combined with the well-known data clustering k-means algorithm for dynamic clustering problem where the number of clusters has not yet been known. Finally, DCPSONS is applied to image segmentation problem, in which the number of clusters is automatically determined. Experimental results in using sixteen benchmark data sets and several images of synthetic and natural benchmark data demonstrate that the proposed DCPSONS algorithm substantially outperforms other competitive algorithms in terms of accuracy and convergence rate.
mathematics subject classification 2000: 68T01
reference: Vol. 36, 2017, No. 3, pp. 637–663