We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set of vertices, a notion that generalizes that of a maximal complete subgraph to edge-weighted graphs. We also establish a correspondence between dominant sets and the extrema of a quadratic form over the standard simplex, thereby allowing us the use of continuous optimization techniques such as replicator dynamics from evolutionary game theory. Such systems are attractive as they can be coded in a few lines of any high-level programming language, can easily be implemented in a parallel network of locally interacting units, and offer the advantage of biological plausibility. We present experimental results on real-world images which show the effectiveness of the proposed approach.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A new graph-theoretic approach to clustering and segmentation


    Contributors:
    Pavan, M. (author) / Pelillo, M. (author)


    Publication date :

    2003-01-01


    Size :

    388535 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A New Graph-Theoretic Approach to Clustering and Segmentation

    Pavan, M. / Pelillo, M. / IEEE | British Library Conference Proceedings | 2003


    An adaptive spatial information-theoretic fuzzy clustering algorithm for image segmentation

    Wang, Z. / Song, Q. / Soh, Y. C. et al. | British Library Online Contents | 2013


    Segmentation of Video by Clustering and Graph Analysis

    Yeung, M. / Yeo, B.-L. / Liu, B. | British Library Online Contents | 1998


    Selection of Grippers-A Fuzzy Graph Theoretic Approach

    Goyal, S. / Grover, S. | British Library Conference Proceedings | 2012