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
Mark W. Orletsky, Michael T. Goodrich, Joseph S.B. Mitchell, "Approximate Geometric Pattern Matching Under Rigid Motions", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 21, no. , pp. 371-379, April 1999, doi:10.1109/34.761267
96 ms
(Ver 3.1 (10032016))