Title
Robust Global Registration
Abstract
We present an algorithm for the automatic alignment of two 3D shapes (data and model), without any assumptions about their initial positions. The algorithm computes for each surface point a descriptor based on local geometry that is robust to noise. A small number of feature points are automatically picked from the data shape according to the uniqueness of the descriptor value at the point. For each feature point on the data, we use the descriptor values of the model to nd potential corresponding points. We then develop a fast branch-and-bound algorithm based on distance matrix comparisons to select the optimal correspondence set and bring the two shapes into a coarse alignment. The result of our alignment algorithm is used as the initialization to ICP (iterative closest point) and its variants for ne registration of the data to the model. Our algorithm can be used for matching shapes that overlap only over parts of their extent, for building models from partial range scans, as well as for simple symmetry detection, and for matching shapes undergoing articulated motion.
Year
Venue
Keywords
2005
Symposium on Geometry Processing
coarse alignment,potential corresponding point,descriptor value,feature point,closest point,fast branch-and-bound algorithm,algorithm compute,robust global registration,automatic alignment,alignment algorithm,surface point,willmore energy,branch and bound algorithm,geometric flow,discrete differential geometry,distance matrix,iterative closest point
Field
DocType
ISBN
Small number,Uniqueness,Discrete differential geometry,Mathematical optimization,Geometric flow,Computer science,Distance matrix,Initialization,Willmore energy,Iterative closest point
Conference
3-905673-24-X
Citations 
PageRank 
References 
182
9.73
23
Authors
4
Search Limit
100182
Name
Order
Citations
PageRank
Natasha Gelfand1123667.99
Niloy J. Mitra23813176.15
Leonidas J. Guibas3130841262.73
Helmut Pottmann42979212.76