Academic Journals Database
Disseminating quality controlled scientific knowledge

An Algebraic Method for Estimating the Fundamental Matrix with Rank Constraint

ADD TO MY LIST
 
Author(s): Yuanbin Wang | Bin Zhang | Tianshun Yao

Journal: Journal of Computers
ISSN 1796-203X

Volume: 5;
Issue: 7;
Start page: 1027;
Date: 2010;
Original page

Keywords: computer vision | epipolar geometry | fundamental matrix | nonlinear multivariable equations

ABSTRACT
The fundamental matrix captures the intrinsic geometric properties of two images of a same 3D scene. It should be of rank two for all the epipolar lines to intersect in a unique epipole. Traditional methods of enforcing the rank two property of the matrix are to parameterize the fundamental matrix during the estimation. This usually results in a system of nonlinear multivariable polynomial equations of higher degree. The solution of which is then hand over to some numerical techniques. Numerical precision analysis and convergence proof of these solutions are needed but neglected. This paper studies the structure of the typical nonlinear multivariable polynomial equations encountered in the fundamental matrix estimation with rank constraint. An algebraic method is presented to solve this type of equations. The method is based on the classical Lagrange multipliers method. After careful transformations of the problem, we reduce the problem to the solution of a single variable polynomial equation.
Affiliate Program      Why do you need a reservation system?