This paper presents an iterative maximum likelihood framework for perceptual grouping. We pose the problem of perceptual grouping as one of pairwise relational clustering. The method is quite generic and can be applied to a number of problems including region segmentation and line-linking. The task is to assign image tokens to clusters in which there is strong relational affinity between token pairs. The parameters of our model are the cluster memberships and the link weights between pairs of tokens. Commencing from a simple probability distribution for these parameters, we show how they may be estimated using an EM-like algorithm. The cluster memberships are estimated using an eigendecomposition method. Once the cluster memberships are to hand, then the updated link-weights are the expected values of their pairwise products. The new method is demonstrated on region segmentation and line-segment grouping problems where it is shown to outperform a noniterative eigenclustering method.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A maximum likelihood framework for iterative eigendecomposition


    Contributors:


    Publication date :

    2001-01-01


    Size :

    824392 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Maximum Likelihood Framework for Iterative Eigendecomposition

    Robles-Kelly, A. / Hancock, E. / IEEE | British Library Conference Proceedings | 2001


    Maximum Likelihood Motion Segmentation Using Eigendecomposition

    Robles-Kelly, A. / Hancock, E. / IEEE | British Library Conference Proceedings | 2001


    Maximum likelihood motion segmentation using eigendecomposition

    Robles-Kelly, A. / Hancock, E.R. | IEEE | 2001



    A Robust Eigendecomposition Framework for Inexact Graph-Matching

    Luo, B. / Hancock, E. / IEEE | British Library Conference Proceedings | 2001