A PSO Based Merge Algorithm for Color Image Segmentation

Komal Mittal, Anuradha Panjeta

Abstract


This paper proposes an improved method of image segmentation by using particle swarm optimization (PSO) based merge. The PSO algorithm is used to find optimum number of clusters which will be used as a limiting value in merge algorithm. The performance of algorithm is measured using a validity index which is measured division of intra-cluster distance whose minimum value is desired and inter-cluster distance for which a maximum value is required. Once optimum number of cluster is found then PSO clustering algorithm is again applied to generate large number of clusters, then from these large numbers of clusters, pair of clusters with most similar characteristics are merged iteratively until numbers of clusters are reduced up to optimum number of clusters. The similarity measure is taken as Davies-Bouldin Index. The proposed merge algorithm is performing better than simple PSO algorithm.

Keywords


Particle Swarm Optimization (PSO); Clustering; Image segmentation

Full Text:

PDF




Copyright (c) 2015 Komal Mittal, Anuradha Panjeta

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

 

All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 


Paper submission: ijr@pen2print.org