Geometric pattern matching under Euclidean motion
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications, pp. 113-124, 1997.
hausdorff distancecomputer visionupper boundpattern matching
Given two planar sets A and B , we examine the problem of determining the smallest ϵ such that there is a Euclidean motion (rotation and translation) of A that brings each member of A within distance ϵ of some member of B . We establish upper bounds on the combinatorial complexity of this subproblem in model-based computer vision, when th...More
Full Text (Upload PDF)
PPT (Upload PPT)