We develop a framework for the unsupervised texture segmentation problem based on dominant sets, a new graph-theoretic concept that has proven to be relevant in pairwise data clustering as well as image segmentation problems. A remarkable correspondence between dominant sets and the extrema of a quadratic form over the standard simplex allows us to use continuous optimization techniques such as replicator dynamics from evolutionary game theory. Such systems are attractive as can easily be implemented in a parallel network of locally interacting computational units, thereby motivating analog VLSI implementations. We present experimental results on various textured images which confirm the effectiveness of the approach.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Unsupervised texture segmentation by dominant sets and game dynamics


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


    Publication date :

    2003-01-01


    Size :

    334150 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Unsupervised Texture Segmentation by Dominant Sets and Game Dynamics

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


    Unsupervised Texture Segmentation with Nonparametric Neighborhood Statistics

    Awate, S. P. / Tasdizen, T. / Whitaker, R. T. | British Library Conference Proceedings | 2006


    Unsupervised multiresolution texture segmentation using wavelet decomposition

    Palisson, P. / Zegadi, N. / Peyrin, F. et al. | IEEE | 1994


    Unsupervised Multiresolution Texture Segmentation using Wavelet Decomposition

    Palisson, P. / Zegadi, N. / Peyrin, F. et al. | British Library Conference Proceedings | 1994


    Unsupervised texture segmentation based on latent topic assignment

    Feng, H. / Jiang, Z. / Shi, J. | British Library Online Contents | 2013