One of the most famous approaches for the segmentation of color images is finding clusters in the color space. Shapes of these clusters are often complex and the time complexity of the existing algorithms for finding clusters of different shapes is usually high. In this paper, a novel clustering algorithm is proposed and used for the image segmentation purpose. This algorithm distinguishes clusters of different shapes using a two-stage clustering approach in a reasonable time. In the first stage, the mean-shift clustering algorithm is used and the data points are grouped into some sub-clusters. In the second stage, connections between sub-clusters are established according to a dissimilarity measure and final clusters are formed. Experimental results show the ability of the proposed algorithm for finding clusters of arbitrary shapes in synthetic datasets and also for the segmentation of color images.
Finding Arbitrary Shaped Clusters and Color Image Segmentation
2008 Congress on Image and Signal Processing ; 1 ; 593-597
2008-05-01
566030 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Fuzzy Image Segmentation of Generic Shaped Clusters
British Library Conference Proceedings | 2005
|Fuzzy image segmentation of generic shaped clusters
IEEE | 2005
|Finding "anomalies" in an arbitrary image
IEEE | 2001
|Finding "Anomalies" in an Arbitrary Image
British Library Conference Proceedings | 2001
|Method for multispectral image segmentation based on the shape of the color clusters [2949-52]
British Library Conference Proceedings | 1996
|