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

Jiaolong Yang, Hongdong Li, Yunde Jia; The IEEE International Conference on Computer Vision (ICCV), 2013, pp. 1457-1464

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 pointsets or two 3D surfaces under the L 2 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.

Related Material


[pdf]
[bibtex]
@InProceedings{Yang_2013_ICCV,
author = {Yang, Jiaolong and Li, Hongdong and Jia, Yunde},
title = {Go-ICP: Solving 3D Registration Efficiently and Globally Optimally},
booktitle = {The IEEE International Conference on Computer Vision (ICCV)},
month = {December},
year = {2013}
}