Sciweavers

263 search results - page 1 / 53
» Efficient Variants of the ICP Algorithm
Sort
View
3DIM
2001
IEEE
13 years 8 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
3DIM
2003
IEEE
13 years 10 months ago
Reliable and Rapidly-Converging ICP Algorithm Using Multiresolution Smoothing
Autonomous range acquisition for 3D modeling requires reliable range registration, for both the precise localization of the sensor and combining the data from multiple scans for v...
Kok-Lim Low, Anselmo Lastra
ICPR
2002
IEEE
14 years 6 months ago
The Trimmed Iterative Closest Point Algorithm
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension o...
Dmitry Chetverikov, D. Svirko, Dmitry Stepanov, Pa...
IROS
2006
IEEE
163views Robotics» more  IROS 2006»
13 years 11 months ago
Pair-wise Registration of 3D/Color Data Sets with ICP
- The ICP (Iterative Closest Point) algorithm remains a very popular method for the registration of 3D data sets, when an initial guess of the relative pose between them is known. ...
Lounis Douadi, Marie-José Aldon, Andr&eacut...
CGI
2004
IEEE
13 years 8 months ago
Range Image Registration via Probability Field
This paper presents a powerful variant of the ICP (Iterative Closest Point) algorithm for registering range images using a probability field. The probability field (p-field) repre...
Haitao Zhang, Olaf A. Hall-Holt, Arie E. Kaufman