Sciweavers

Share
5 search results - page 1 / 1
» A Multi-Resolution Scheme ICP Algorithm for Fast Shape Regis...
Sort
View
3DPVT
2002
IEEE
219views Visualization» more  3DPVT 2002»
9 years 7 months ago
A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
Timothée Jost, Heinz Hügli
ECCV
2002
Springer
10 years 4 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
IVC
2006
227views more  IVC 2006»
9 years 2 months ago
Automatic registration of overlapping 3D point clouds using closest points
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
Yonghuai Liu
MICCAI
2004
Springer
10 years 3 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...

Publication
372views
10 years 3 months ago
Multi-Objects Interpretation
We describe a general-purpose method for the accurate and robust interpretation of a data set of p-dimensional points by several deformable prototypes. This method is based on the ...
Jean-Philippe Tarel
books