Skip to Main content Skip to Navigation
Conference papers

Globally Optimal Line Clustering and Vanishing Point Estimation in Manhattan World

Abstract : The projection of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotation estimation and 3D reconstruction. Urban environments generally exhibit some dominant orthogonal VPs. Given a set of lines extracted from a calibrated image, this paper aims to (1) determine the line clustering, i.e. find which line belongs to which VP, and (2) estimate the associated orthogonal VPs. None of the existing methods is fully satisfactory because of the inherent difficulties of the problem, such as the local minima and the chicken-and-egg aspect. In this paper, we present a new algorithm that solves the problem in a mathematically guaranteed globally optimal manner and can inherently enforce the VP orthogonality. Specifically, we formulate the task as a consensus set maximization problem over the rotation search space, and further solve it efficiently by a branch-and-bound procedure based on the Interval Analysis theory. Our algorithm has been validated successfully on sets of challenging real images as well as synthetic data sets.
Document type :
Conference papers
Complete list of metadata
Contributor : Cédric Demonceaux Connect in order to contact the contributor
Submitted on : Tuesday, May 15, 2012 - 10:15:10 PM
Last modification on : Tuesday, October 19, 2021 - 5:34:09 PM


  • HAL Id : hal-00697707, version 1


Jean-Charles Bazin, Yongduek Seo, Cédric Demonceaux, Pascal Vasseur, Katsushi Ikeuchi, et al.. Globally Optimal Line Clustering and Vanishing Point Estimation in Manhattan World. IEEE Conf. on Computer Vision and Pattern Recognition, Jun 2012, Providence, Rhode Island, United States. ⟨hal-00697707⟩



Record views