JCP 2010 Vol.5(7): 1027-1037 ISSN: 1796-203X
doi: 10.4304/jcp.5.7.1027-1037
doi: 10.4304/jcp.5.7.1027-1037
An Algebraic Method for Estimating the Fundamental Matrix with Rank Constraint
Yuanbin Wang, Bin Zhang, and Tianshun Yao
School of Information Science and Engineering, Northeastern University, China
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.
Index Terms—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.
Index Terms—computer vision, epipolar geometry, fundamental matrix, nonlinear multivariable equations
Cite: Yuanbin Wang, Bin Zhang, and Tianshun Yao, " An Algebraic Method for Estimating the Fundamental Matrix with Rank Constraint," Journal of Computers vol. 5, no. 7, pp. 1027-1037, 2010.
General Information
ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO, ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
-
Nov 14, 2019 News!
Vol 14, No 11 has been published with online version [Click]
-
Mar 20, 2020 News!
Vol 15, No 2 has been published with online version [Click]
-
Dec 16, 2019 News!
Vol 14, No 12 has been published with online version [Click]
-
Sep 16, 2019 News!
Vol 14, No 9 has been published with online version [Click]
-
Aug 16, 2019 News!
Vol 14, No 8 has been published with online version [Click]
- Read more>>