Sciweavers

Share
15 search results - page 1 / 3
» Cached k-d tree search for ICP algorithms
Sort
View
3DIM
2007
IEEE
9 years 8 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
ICMCS
2006
IEEE
227views Multimedia» more  ICMCS 2006»
9 years 7 months ago
Adaptive Dual AK-D Tree Search Algorithm for ICP Registration Applications
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
Jiann-Der Lee, Shih-Sen Hsieh, Chung-Hsien Huang, ...
VMV
2003
170views Visualization» more  VMV 2003»
9 years 2 months ago
Performance Analysis of Nearest Neighbor Algorithms for ICP Registration of 3-D Point Sets
There are many nearest neighbor algorithms tailormade for ICP, but most of them require special input data like range images or triangle meshes. We focus on ef´Čücient nearest nei...
Timo Zinßer, Jochen Schmidt, Heinrich Nieman...
3DIM
2003
IEEE
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...
Michael A. Greenspan, Mike Yurick
3DPVT
2002
IEEE
219views Visualization» more  3DPVT 2002»
9 years 6 months ago
A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
Timothée Jost, Heinz Hügli
books