A Solution for the Registration of Multiple 3D Point Sets Using Unit Quaternions
Abstract
Registering 3D point sets is a common problem in computer vision. The case of two point sets has been analytically well solved by several authors. In this paper we present an analytic solution for solving the problem of a simultaneous registration of M point sets, M >2, by rigid motions. The solution is based on the use of unit quaternions for the representation of the rotations. We show that the rotation optimization can be decoupled from the translation one. The optimal translations are given by the resolution of a linear equation system which depends on the rotated centroid of the overlaps. The unit quaternions representing the best rotations are optimized by applying an iterative process on symmetric 4×4 matrices. The matrices correspond to the mutual overlaps between the point sets. We have applied this method to the registration of several overlapping 3D surfaces sampled on an object. Our results on simulated and real data show that the algorithm works efficiently.
Cite
Text
Benjemaa and Schmitt. "A Solution for the Registration of Multiple 3D Point Sets Using Unit Quaternions." European Conference on Computer Vision, 1998. doi:10.1007/BFB0054732Markdown
[Benjemaa and Schmitt. "A Solution for the Registration of Multiple 3D Point Sets Using Unit Quaternions." European Conference on Computer Vision, 1998.](https://mlanthology.org/eccv/1998/benjemaa1998eccv-solution/) doi:10.1007/BFB0054732BibTeX
@inproceedings{benjemaa1998eccv-solution,
title = {{A Solution for the Registration of Multiple 3D Point Sets Using Unit Quaternions}},
author = {Benjemaa, Raouf and Schmitt, Francis},
booktitle = {European Conference on Computer Vision},
year = {1998},
pages = {34-50},
doi = {10.1007/BFB0054732},
url = {https://mlanthology.org/eccv/1998/benjemaa1998eccv-solution/}
}