This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov random field. We approximate the fully connected model with simpler models in which optimal inference is feasible, and contrast them to the well-known probabilistic relaxation method, which can operate over the complete model but does not assure global optimality. The approach is well suited for applications in which there is redundancy in the binary attributes of the graph, such as in the matching of straight line segments. Results demonstrate that, in this application, the proposed models have superior robustness over probabilistic relaxation under additive noise conditions.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Graphical models for graph matching


    Contributors:
    Caetano, T.S. (author) / Caelli, T. (author) / Barone, D.A.C. (author)


    Publication date :

    2004-01-01


    Size :

    355583 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Graphical Models for Graph Matching

    Caetano, T. / Caelli, T. / Barone, D. et al. | British Library Conference Proceedings | 2004


    Matching Dissimilar Graphical Scales

    French, R. H. | NTRS | 1982


    Visual graph mining for graph matching

    Zhang, Quanshi / Song, Xuan / Yang, Yu et al. | British Library Online Contents | 2019


    2.5D Elastic graph matching

    Zafeiriou, S. / Petrou, M. | British Library Online Contents | 2011


    Compatibility Modelling for Graph Matching

    Wilson, R. C. / Hancock, E. R. / University of Naples et al. | British Library Conference Proceedings | 1994