A linear solving method for rank 2 fundamental matrix of non-compulsary contraint

  • Authors:
  • Shimin Wang;Juan Wang;Yue Zhao

  • Affiliations:
  • School of Mathematics and Statistics, Yunnan University, China;School of Mathematics and Statistics, Yunnan University, China;School of Mathematics and Statistics, Yunnan University, China

  • Venue:
  • ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Solving the fundamental matrix is an improtant research topic in computer vision. The relationship between the epipole and the parameters of fundamental matrix can be found from the fundamental matrix of rank 2. A new model is equivalent to the fundamental matrix of rank 2. The model of the fundamental matrix, whose rank equals 2. The can be provided. According to the relationship between the parameters, the epipole and the fundamental matrix model, a linear method which aviods the objective function of unconstraint programming solving a nonlinear equation with the element 4 and the power 8 is provided. It realized stable estimation of the fundamental matrix. In the same scene, our algotithm compared with the 8-Points algorithm and the RANSAC algorithm, indicates that our algorithm has smaller errors under certain case. The comparison of results indicates our method algorithm is feasible and has stronger practicability by experiment.