Sciweavers

263 search results - page 2 / 53
» Efficient Variants of the ICP Algorithm
Sort
View
3DIM
2001
IEEE
13 years 10 months ago
A Nearest Neighbor Method for Efficient ICP
A novel solution is presented to the Nearest Neighbor Problem that is specifically tailored for determining correspondences within the Iterative Closest Point Algorithm. The refer...
Michael A. Greenspan, Guy Godin
3DIM
2003
IEEE
13 years 10 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
ICMCS
2006
IEEE
227views Multimedia» more  ICMCS 2006»
14 years 9 days 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, ...
ICPR
2008
IEEE
14 years 21 days ago
Registration by using a pseudo color attribute
This paper presents a new variant of the classical Iterative Closest Point (ICP) algorithm. The ICP result depends heavily on the matching between 3D points of the two cloud of po...
Felipe Trujillo-Romero, Michel Devy
CVPR
2007
IEEE
14 years 8 months ago
Optimal Step Nonrigid ICP Algorithms for Surface Registration
We show how to extend the ICP framework to nonrigid registration, while retaining the convergence properties of the original algorithm. The resulting optimal step nonrigid ICP fra...
Brian Amberg, Sami Romdhani, Thomas Vetter