Sciweavers

114 search results - page 6 / 23
» On the ICP algorithm
Sort
View
ECCV
2002
Springer
14 years 9 months ago
Multi-scale EM-ICP: A Fast and Robust Approach for Surface Registration
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
Sébastien Granger, Xavier Pennec
3DIM
2007
IEEE
14 years 2 months ago
Predetermination of ICP Registration Errors And Its Application to View Planning
We present an analytical method to estimate the absolute registration error bounds if two surfaces were to be aligned using the ICP (Iterative Closest Point) algorithm. The estima...
Kok-Lim Low, Anselmo Lastra
3DIM
2001
IEEE
13 years 11 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 11 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
ICRA
2009
IEEE
166views Robotics» more  ICRA 2009»
14 years 2 months ago
Laser-based geometric modeling using cooperative multiple mobile robots
— In order to construct three-dimensional shape models of large-scale architectural structures using a laser range finder, a number of range images are taken from various viewpo...
Ryo Kurazume, Yusuke Noda, Yukihiro Tobata, Kai Li...