Approximate K-D Tree Search for Efficient ICP

9 years 5 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k-d tree. The standard k-d tree uses a tentative backtracking search to identify nearest neighbors. In contrast, the Approximate k-d tree (Ak-d tree) applies a depthfirst nontentative search to the k-d tree structure. This search improves runtime efficiency, with the tradeoff of reducing the accuracy of the determined correspondences. This approximate search is applied to early iterations of the Iterative Closest Point Algorithm, transitioning to the standard k-d tree for the final iterations after the change in the mean square error of the correspondences becomes sufficiently small. The method benefits both from the improved time performance of the approximate search in early iterations as well as the full accuracy of the complete search in later iterations. Experimental results indicate that the time efficie...
Michael A. Greenspan, Mike Yurick
Added 23 Aug 2010
Updated 23 Aug 2010
Type Conference
Year 2003
Where 3DIM
Authors Michael A. Greenspan, Mike Yurick
Comments (0)