Sciweavers

114 search results - page 3 / 23
» On the ICP algorithm
Sort
View
COMPGEOM
2006
ACM
13 years 9 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
VMV
2003
170views Visualization» more  VMV 2003»
13 years 9 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 efficient nearest nei...
Timo Zinßer, Jochen Schmidt, Heinrich Nieman...
3DIM
2003
IEEE
14 years 1 months ago
Geometrically Stable Sampling for the ICP Algorithm
The Iterative Closest Point (ICP) algorithm is a widely used method for aligning three-dimensional point sets. The quality of alignment obtained by this algorithm depends heavily ...
Natasha Gelfand, Szymon Rusinkiewicz, Leslie Ikemo...
3DIM
2001
IEEE
13 years 11 months ago
Efficient Variants of the ICP Algorithm
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variant...
Szymon Rusinkiewicz, Marc Levoy
ICMCS
2006
IEEE
227views Multimedia» more  ICMCS 2006»
14 years 1 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, ...