The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—We present techniques for matching point-sets in two and three dimensions under rigid-body transformations. We prove bounds on the worst-case performance of these algorithms to be within a small constant factor of optimal and conduct experiments to show that the average performance of these matching algorithms is often better than that predicted by the worst-case bounds.</p>
INDEX TERMS
Hausdorff distance, pattern matching, registration.
CITATION

M. W. Orletsky, M. T. Goodrich and J. S. Mitchell, "Approximate Geometric Pattern Matching Under Rigid Motions," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 21, no. , pp. 371-379, 1999.
doi:10.1109/34.761267
89 ms
(Ver 3.3 (11022016))