International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 29 - Number 11 |
Year of Publication: 2011 |
Authors: B.Sathya, R.Manavalan |
10.5120/3688-5127 |
B.Sathya, R.Manavalan . Image Segmentation by Clustering Methods: Performance Analysis. International Journal of Computer Applications. 29, 11 ( September 2011), 27-32. DOI=10.5120/3688-5127
Image segmentation plays a significant role in computer vision. It aims at extracting meaningful objects lying in the image. Generally there is no unique method or approach for image segmentation. Clustering is a powerful technique that has been reached in image segmentation. The cluster analysis is to partition an image data set into a number of disjoint groups or clusters. The clustering methods such as k means, improved k mean, fuzzy c mean (FCM) and improved fuzzy c mean algorithm (IFCM) have been proposed. K means clustering is one of the popular method because of its simplicity and computational efficiency. The number of iterations will be reduced in improved K compare to conventional K means. FCM algorithm has additional flexibility for the pixels to belong to multiple classes with varying degrees of membership. Demerit of conventional FCM is time consuming which is overcome by improved FCM. The experimental results exemplify that the proposed algorithms yields segmented gray scale image of perfect accuracy and the required computer time reasonable and also reveal the improved fuzzy c mean achieve better segmentation compare to others. The quality of segmented image is measured by statistical parameters: rand index (RI), global consistency error (GCE), variations of information (VOI) and boundary displacement error (BDE).