Approximate geometric pattern matching under rigid motions
- 1 April 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 21 (4), 371-379
- https://doi.org/10.1109/34.761267
Abstract
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.Keywords
This publication has 32 references indexed in Scilit:
- An optimal algorithm for approximate nearest neighbor searching in fixed dimensionsJournal of the ACM, 1998
- Geometric pattern matching under Euclidean motionComputational Geometry, 1997
- Approximate decision algorithms for point set congruenceComputational Geometry, 1994
- The upper envelope of voronoi surfaces and its applicationsDiscrete & Computational Geometry, 1993
- Generalized approximate algorithms for point set congruenceLecture Notes in Computer Science, 1993
- On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the planePublished by Association for Computing Machinery (ACM) ,1992
- Pose estimation from corresponding point dataIEEE Transactions on Systems, Man, and Cybernetics, 1989
- Closed-form solution of absolute orientation using orthonormal matricesJournal of the Optical Society of America A, 1988
- Least-Squares Fitting of Two 3-D Point SetsIeee Transactions On Pattern Analysis and Machine Intelligence, 1987
- Closed-form solution of absolute orientation using unit quaternionsJournal of the Optical Society of America A, 1987