CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2009 vol.31 Issue No.05 - May
Issue No.05 - May (2009 vol.31)
Carl Olsson , Lund University, Lund
Fredrik Kahl , Lund University, Lund
Magnus Oskarsson , Lund University, Lund
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.
Registration, camera pose, global optimization, branch-and-bound.
Carl Olsson, Fredrik Kahl, Magnus Oskarsson, "Branch-and-Bound Methods for Euclidean Registration Problems", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.31, no. 5, pp. 783-794, May 2009, doi:10.1109/TPAMI.2008.131