Efficient Computation of Vanishing Points

نویسندگان

  • Jana Kosecka
  • Wei Zhang
چکیده

Man-made environments posses a lot of regularities which simplify otherwise difficult pose estimation and visual reconstruction tasks. The constraints arising from parallel and orthogonal lines and planes can be efficiently exploited at various stages of vision processing pipeline. In this paper we propose an approach for estimation of vanishing points by exploiting the constraints of structured man-made environments, where the majority of lines is aligned with the principal orthogonal directions of the world coordinate frame. We combine efficient image processing techniques used in the line detection and initialization stage with simultaneous grouping and estimation of vanishing directions using expectation maximization (EM) algorithm. Since we assume uncalibrated camera the estimated vanishing points can be used towards partial camera calibration and estimation of the relative orientation of the camera with respect to the scene. The presented approach is computationally efficient and has been verified extensively by experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vanishing Point and Vanishing Line Estimation with Line Clustering

In conventional methods for detecting vanishing points and vanishing lines, the observed feature points are clustered into collections that represent different lines. The multiple lines are then detected and the vanishing points are detected as points of intersection of the lines. The vanishing line is then detected based on the points of intersection. However, for the purpose of optimization, ...

متن کامل

Characterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints

This paper studies the convex multiobjective optimization problem with vanishing constraints‎. ‎We introduce a new constraint qualification for these problems‎, ‎and then a necessary optimality condition for properly efficient solutions is presented‎. ‎Finally by imposing some assumptions‎, ‎we show that our necessary condition is also sufficient for proper efficiency‎. ‎Our results are formula...

متن کامل

Approximate computation of zero-dimensional polynomial ideals

The Buchberger-Möller algorithm is a well-known efficient tool for computing the vanishing ideal of a finite set of points. If the coordinates of the points are (imprecise) measured data, the resulting Gröbner basis is numerically unstable. In this paper we introduce a numerically stable Approximate Vanishing Ideal (AVI) Algorithm which computes a set of polynomials that almost vanish at the gi...

متن کامل

Vanishing Point Detection by Segment Clustering on the Projective Space

The analysis of vanishing points on digital images provides strong cues for inferring the 3D structure of the depicted scene and can be exploited in a variety of computer vision applications. In this paper, we propose a method for estimating vanishing points in images of architectural environments that can be used for camera calibration and pose estimation, important tasks in large-scale 3D rec...

متن کامل

A New Method for Vanishing Points Detection in 3d Reconstruction from a Single View

From a single view that contains a three dimensional scene is possible to obtain substantial information about the object and even its partial reconstruction. This analysis can provide, in the case of Photogrammetry, measures of the original object, and in the case of Computer Vision, useful information to 3D reconstruction. Nevertheless, to carry out this analysis, a critical part of the proce...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002