Sciweavers

141 search results - page 2 / 29
» The Parallel Iterative Closest Point Algorithm
Sort
View
MICCAI
2004
Springer
14 years 5 months ago
Robust Generalized Total Least Squares Iterative Closest Point Registration
Abstract. This paper investigates the use of a total least squares approach in a generalization of the iterative closest point (ICP) algorithm for shape registration. A new General...
Raúl San José Estépar, Anders...
IJCV
2006
142views more  IJCV 2006»
13 years 5 months ago
Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
Helmut Pottmann, Qi-Xing Huang, Yong-Liang Yang, S...
ICRA
2008
IEEE
308views Robotics» more  ICRA 2008»
13 years 11 months ago
Dynamic time warping for binocular hand tracking and reconstruction
— We show how matching and reconstruction of contour points can be performed using Dynamic Time Warping (DTW) for the purpose of 3D hand contour tracking. We evaluate the perform...
Javier Romero, Danica Kragic, Ville Kyrki, Antonis...
3DIM
2001
IEEE
13 years 8 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
2007
IEEE
13 years 11 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...