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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Finding Arbitrary Shaped Clusters and Color Image Segmentation


    Contributors:


    Publication date :

    2008-05-01


    Size :

    566030 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Fuzzy Image Segmentation of Generic Shaped Clusters

    Ali, M. A. / Karmakar, G. C. / Dooley, L. S. | British Library Conference Proceedings | 2005


    Fuzzy image segmentation of generic shaped clusters

    Ali, M.A. / Karmakar, G.C. / Dooley, L.S. | IEEE | 2005


    Finding "Anomalies" in an Arbitrary Image

    Honda, T. / Nayar, S. / IEEE | British Library Conference Proceedings | 2001


    Finding "anomalies" in an arbitrary image

    Honda, T. / Nayar, S.K. | IEEE | 2001


    Method for multispectral image segmentation based on the shape of the color clusters [2949-52]

    Kroupnova, N. H. / SPIE | British Library Conference Proceedings | 1996