Globally Optimal Inlier Set Maximization with Unknown Rotation and Focal Length

Jean-Charles Bazin¹, Yongduek Seo², Richard Hartley³, and Marc Pollefeys¹

¹Department of Computer Science, ETH Zurich, Switzerland

²Department of Media Technology, Sogang University, South Korea

³Australian National University and NICTA, Canberra, Australia

Abstract. Identifying inliers and outliers among data is a fundamental problem for model estimation. This paper considers models composed of rotation and focal length, which typically occurs in the context of panoramic imaging. An efficient approach consists in computing the underlying model such that the number of inliers is maximized. The most popular tool for inlier set maximization must be RANSAC and its numerous variants. While they can provide interesting results, they are not guaranteed to return the globally optimal solution, i.e. the model leading to the highest number of inliers. We propose a novel globally optimal approach based on branch-and-bound. It computes the rotation and the focal length maximizing the number of inlier correspondences and considers the reprojection error in the image space. Our approach has been successfully applied on synthesized data and real images.

Keywords: Consensus set maximization, branch-and-bound, inlier detection, RANSAC

LNCS 8690, p. 803 ff.

Full article in PDF | BibTeX

lncs@springer.com
© Springer International Publishing Switzerland 2014