Clustering techniques are broadly used in researchare as where pattern recognition is needed, like in signal processing, automatic voice analysis, computer vision, and data mining. However, for each specific problem, the adequate technique must be selected in order to achieve better results. In this paper, a comparative analysis between the three mostly used clustering techniques (k-means, ISODATA, and the sequential clustering algorithm) is presented. The goal of the analysis is to compare the efficiency of each algorithm applied to numerical databases and images. The results of the application of the algorithms to a setof 25 images (natural and artificial) and 5 numerical databases are presented and discussed.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Analysis of Clustering Algorithms for Image Segmentation and Numerical Databases


    Contributors:


    Publication date :

    2008-09-01


    Size :

    2315781 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Context-dependent segmentation and matching in image databases

    Greenspan, H. / Dvir, G. / Rubner, Y. | British Library Online Contents | 2004


    Benchmarking Image Segmentation Algorithms

    Estrada, F. J. / Jepson, A. D. | British Library Online Contents | 2009


    Region Segmentation Using K-Mean Clustering and Genetic Algorithms

    Horita, Y. / Murai, T. / Miyahara, M. et al. | British Library Conference Proceedings | 1994


    Image Segmentation by Unsupervised Sparse Clustering

    Jeon, Byoung-Ki / Jung, Yun-Beom / Hong, Ki-Sang | IEEE | 2005