Graph-matching is a task of pivotal importance in high-level vision since it provides a means by which abstract pictorial descriptions can be matched to one another. This paper describes an efficient algorithm for inexact graph-matching. The method is purely structural, that is to say it uses only the edge or connectivity structure of the graph and does not draw on node or edge attributes. We make two contributions. Commencing from a probability distribution for matching errors, we show how the problem of graph-matching can be posed as maximum likelihood estimation using the apparatus of the EM algorithm. Our second contribution is to cast the recovery of correspondence matches between the graph nodes in a matrix framework. This allows us to efficiently recover correspondence matches using singular value decomposition. We experiment with the method on both real-world and synthetic data. Here we demonstrate that the method offers comparable performance to more computationally demanding methods.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A robust eigendecomposition framework for inexact graph-matching


    Beteiligte:
    Luo, B. (Autor:in) / Hancock, E.R. (Autor:in)


    Erscheinungsdatum :

    2001-01-01


    Format / Umfang :

    599474 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    A Robust Eigendecomposition Framework for Inexact Graph-Matching

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


    A Maximum Likelihood Framework for Iterative Eigendecomposition

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


    Region Correspondence by Inexact Attributed Planar Graph Matching

    Wang, C. / Abe, K. / IEEE Computer Society et al. | British Library Conference Proceedings | 1995


    A maximum likelihood framework for iterative eigendecomposition

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


    Inexact graph matching based on kernels for object retrieval in image databases

    Lebrun, J. / Gosselin, P. H. / Philipp-Foliguet, S. | British Library Online Contents | 2011