Branch-and-Bound Methods for Euclidean Registration Problems.

Summary, in English

In this paper, we propose a practical and efficient method for finding the globally optimal solution to the problem of determining the pose of an object. We present a framework that allows us to use point-to-point, point-to-line, and point-to-plane correspondences for solving various types of pose and registration problems involving euclidean (or similarity) transformations. Traditional methods such as the iterative closest point algorithm or bundle adjustment methods for camera pose may get trapped in local minima due to the nonconvexity of the corresponding optimization problem. Our approach of solving the mathematical optimization problems guarantees global optimality. The optimization scheme is based on ideas from global optimization theory, in particular convex underestimators in combination with branch-and-bound methods. We provide a provably optimal algorithm and demonstrate good performance on both synthetic and real data. We also give examples of where traditional methods fail due to the local minima problem.

• Author: Carl Olsson; Fredrik Kahl; Magnus Oskarsson
• Department/s: Mathematics (Faculty of Engineering)
• Publishing year: 2009
• Language: English
• Pages: 783-794
• Publication/Series: IEEE Transactions on Pattern Analysis and Machine Intelligence
• Volume: 31
• Issue: 5
• Links: http://dx.doi.org/10.1109/TPAMI.2008.131
• Document type: Journal article
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Mathematics
• Status: Published
• ISBN/ISSN/Other: ISSN: 1939-3539