Go-ICP: Solving 3D Registration Efficiently and Globally Optimally
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...[Show more]
|Collections||ANU Research Publications|
|Source:||Monocular Image 3D Human Pose Estimation under Self-Occlusion|
|01_Yang_Go-ICP:_Solving_3D_2013.pdf||2.29 MB||Adobe PDF||Request a copy|
|02_Yang_Go-ICP:_Solving_3D_2013.pdf||1.07 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.