Global Registration of Multiple 3D Point Sets via Optimization-on-a-Manifold
dc.contributor.author | Krishnan, Shankar | en_US |
dc.contributor.author | Lee, Pei Yean | en_US |
dc.contributor.author | Moore, John B. | en_US |
dc.contributor.author | Venkatasubramanian, Suresh | en_US |
dc.contributor.editor | Mathieu Desbrun and Helmut Pottmann | en_US |
dc.date.accessioned | 2014-01-29T09:31:13Z | |
dc.date.available | 2014-01-29T09:31:13Z | |
dc.date.issued | 2005 | en_US |
dc.description.abstract | We propose a novel algorithm to register multiple 3D point sets within a common reference frame using a manifold optimization approach. The point sets are obtained with multiple laser scanners or a mobile scanner. Unlike most prior algorithms, our approach performs an explicit optimization on the manifold of rotations, allowing us to formulate the registration problem as an unconstrained minimization on a constrained manifold. This approach exploits the Lie group structure of SO3 and the simple representation of its associated Lie algebra so3 in terms of R3. Our contributions are threefold. We present a new analytic method based on singular value decompositions that yields a closed-form solution for simultaneous multiview registration in the noise-free scenario. Secondly, we use this method to derive a good initial estimate of a solution in the noise-free case. This initialization step may be of use in any general iterative scheme. Finally, we present an iterative scheme based on Newton's method on SO3 that has locally quadratic convergence. We demonstrate the efficacy of our scheme on scan data taken both from the Digital Michelangelo project and from scans extracted from models, and compare it to some of the other well known schemes for multiview registration. In all cases, our algorithm converges much faster than the other approaches, (in some cases orders of magnitude faster), and generates consistently higher quality registrations. | en_US |
dc.description.seriesinformation | Eurographics Symposium on Geometry Processing 2005 | en_US |
dc.identifier.isbn | 3-905673-24-X | en_US |
dc.identifier.issn | 1727-8384 | en_US |
dc.identifier.uri | https://doi.org/10.2312/SGP/SGP05/187-196 | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.title | Global Registration of Multiple 3D Point Sets via Optimization-on-a-Manifold | en_US |
Files
Original bundle
1 - 1 of 1