Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. (2004)
Washington, D.C., USA
June 27, 2004 to July 2, 2004
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CVPR.2004.118
Tibério S. Caetano , University of Alberta and Universidade Federal do Rio Grande do Sul
Terry Caelli , University of Alberta
Dante A. C. Barone , Universidade Federal do Rio Grande do Sul
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.
T. S. Caetano, T. Caelli and D. A. Barone, "Graphical Models for Graph Matching," Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.(CVPR), Washington, D.C., USA, 2004, pp. 466-473.