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 find 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 fine 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.
Bibtex:
@inproceedings{gelfand-2005-rr,
author = "Natasha Gelfand and Niloy J. Mitra and Leonidas J. Guibas
and Helmut Pottmann",
title = "Robust Global Registration",
booktitle = {{SGP} 2005: Third Eurographics Symposium on
Geometry processing},
publisher = {Eurographics Association},
isbn = "3-905673-24-X",
pages = "197-206",
editor = "Matthieu Desbrun and Helmut Pottmann",
xxurl="http://graphics.stanford.edu/projects/lgl/papers/gmgp-rgr-05/gmgp-rgr-05.pdf",
url="/geom/ig/papers/gmgp-rgr-05.pdf",
year = 2005,
}
|
|
