Abstract In this paper, we try to use graphical model based probabilistic inference methods to solve the problem of contour matching, which is a fundamental problem in computer vision. Specifically, belief propagation is used to develop the contour matching framework. First, an undirected loopy graph is constructed by treating each point of source contour as a graphical node. Then, the distances between the source contour points and the target contour points are used as the observation data, and supplied to this graphical model. During message transmission, we explicitly penalize two kinds of incorrect correspondences: many-to-one correspondence and cross correspondence. A final geometrical mapping is obtained by minimizing the energy function and maximizing a posterior for each node. Comparable experimental results show that better correspondences can be achieved.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Contour Matching Based on Belief Propagation

    Xiang, S. / Nie, F. / Zhang, C. | British Library Conference Proceedings | 2006


    Acyclic belief propagation for stereo matching

    Piovano, L. / Balossino, N. / Lucenteforte, M. et al. | British Library Online Contents | 2009


    Real-time stereo matching based on fast belief propagation

    Xiang, X. | British Library Online Contents | 2012



    Nonparametric belief propagation

    Sudderth, E.B. / Ihler, A.T. / Freeman, W.T. et al. | IEEE | 2003