Go-ICP: Solving 3D Registration Efficiently and Globally Optimally
Date
2013
Authors
Yang, Jiaolong
Li, Hongdong
Jia, Yunde
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE Computer Society
Abstract
Registration is a fundamental task in computer vision. The Iterative Closest Point (ICP) algorithm is one of the widely-used methods for solving the registration problem. Based on local iteration, ICP is however well-known to suffer from local minima. Its performance critically relies on the quality of initialization, and only local optimality is guaranteed. This paper provides the very first globally optimal solution to Euclidean registration of two 3D point sets or two 3D surfaces under the L2 error. Our method is built upon ICP, but combines it with a branch-and-bound (BnB) scheme which searches the 3D motion space SE(3) efficiently. By exploiting the special structure of the underlying geometry, we derive novel upper and lower bounds for the ICP error function. The integration of local ICP and global BnB enables the new method to run efficiently in practice, and its optimality is exactly guaranteed. We also discuss extensions, addressing the issue of outlier robustness.
Description
Keywords
Citation
Collections
Source
Monocular Image 3D Human Pose Estimation under Self-Occlusion
Type
Conference paper
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31