Go-ICP: Solving 3D Registration Efficiently and Globally Optimally

• Published in: 2013 IEEE International Conference on Computer Vision pp. 1457 - 1464
• Main Authors: Yang, Jiaolong, Li, Hongdong, Jia, Yunde
• Format: Conference Proceeding Journal Article
• Language: English
• Published: IEEE 01.12.2013
• Subjects: 3D registration; Computer vision; Conferences; Convergence; Erbium; Error functions; ICP; Iterative closest point algorithm; Iterative methods; Optimization; Robustness; shape matching; Tasks; Three dimensional; Three dimensional models; Three-dimensional displays; Uncertainty; Upper bound
• ISSN: 1550-5499
• DOI: 10.1109/ICCV.2013.184

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.