Generalized deformable models, statistical physics, and matching problems Export

@article{Yuille90, abstract = {We describe how to formulate matching and combinatorial problems of vision and neural network theory by generalizing elastic and deformable templates models to include binary matching elements. Techniques from statistical physics, which can be interpreted as computing marginal probability distributions, are then used to analyze these models and are shown to (1) relate them to existing theories and (2) give insight into the relations between, and relative effectivenesses of, existing theories. In particular we exploit the power of statistical techniques to put global constraints on the set of allowable states of the binary matching elements. The binary elements can then be removed analytically before minimization. This is demonstrated to be preferable to existing methods of imposing such constraints by adding bias terms in the energy functions. We give applications to winner-take-all networks, correspondence for stereo and long-range motion, the traveling salesman problem, deformable template matching, learning, content addressable memories, and models of brain development. The biological plausibility of these networks is briefly discussed.}, author = {Yuille, A. L.}, citeulike-article-id = {1352552}, editor = {Press, M. I. T.}, journal = {Neural Computation}, keywords = {correspondence, deformable-models, matching, reference}, pages = {1--24}, posted-at = {2009-10-31 14:15:07}, priority = {2}, title = {Generalized deformable models, statistical physics, and matching problems}, volume = {2}, year = {1990} }

TY - JOUR ID - Yuille90 L3 - citeulike-article-id:1352552 N2 - We describe how to formulate matching and combinatorial problems of vision and neural network theory by generalizing elastic and deformable templates models to include binary matching elements. Techniques from statistical physics, which can be interpreted as computing marginal probability distributions, are then used to analyze these models and are shown to (1) relate them to existing theories and (2) give insight into the relations between, and relative effectivenesses of, existing theories. In particular we exploit the power of statistical techniques to put global constraints on the set of allowable states of the binary matching elements. The binary elements can then be removed analytically before minimization. This is demonstrated to be preferable to existing methods of imposing such constraints by adding bias terms in the energy functions. We give applications to winner-take-all networks, correspondence for stereo and long-range motion, the traveling salesman problem, deformable template matching, learning, content addressable memories, and models of brain development. The biological plausibility of these networks is briefly discussed. JF - Neural Computation EP - 24 TI - Generalized deformable models, statistical physics, and matching problems VL - 2 SP - 1 KW - correspondence KW - deformable-models KW - matching KW - reference AU - Yuille, AL A2 - Press, MIT PY - 1990/// ER -