An efficient solution to the five-point relative pose problem

@article{Nistr2004AnES,
  title={An efficient solution to the five-point relative pose problem},
  author={David Nist{\'e}r},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={2004},
  volume={26},
  pages={756-770}
}
  • D. Nistér
  • Published 1 June 2004
  • Computer Science
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient algorithmic solution to the classical five-point relative pose problem is presented. [] Key Method It is the first algorithm well-suited for numerical implementation that also corresponds to the inherent complexity of the problem. We investigate the numerical precision of the algorithm. We also study its performance under noise in minimal as well as overdetermined cases. The performance is compared to that of the well-known 8 and 7-point methods and a 6-point scheme. The algorithm is used in a…
A Fast and Robust Solution to the Five-Pint Relative Pose Problem using Gauss-Newton Optimization on a Manifold
  • M. Sarkis, K. Diepold, K. Hüper
  • Computer Science
    2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07
  • 2007
TLDR
A robust technique to compute the essential matrix of the (3×3) essential matrix is suggested under the assumption that the images are calibrated, and shows that the proposed method delivers faster and more accurate results than the standard techniques.
A Minimal Solution to the Generalized Pose-and-Scale Problem
TLDR
The approach handles general configurations of rays and points and directly estimates the full similarity transformation from the 2D-3D correspondences and is shown to produce higher accuracy solutions to multi-frame loop closure than existing approaches.
A Minimal Solution to the Generalised 3-Point Pose Problem
  • D. Nistér, Henrik Stewénius
  • Mathematics
    Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.
  • 2004
TLDR
It is shown that the Generalised problem has up to eight solutions that can be found as the intersections between a circle and a ruled quartic surface, and an octic polynomial whose roots correspond to the solutions is derived.
Least-squares Optimal Relative Planar Motion for Vehicle-mounted Cameras
TLDR
It is validated both in synthetic experiments and on publicly available real-world datasets that using the proposed solver leads to results superior to the state-of-the-art in terms of geometric accuracy with no noticeable deterioration in the processing time.
The planar two point algorithm
TLDR
It is shown that sometimes two non-degenerate correspondences do not define a unique relative robot pose, but lead to two possible real solutions, and an algorithm which uses this minimal set of correspondences termed the Two-point algorithm is described.
Five-Point Motion Estimation Made Easy
  • Hongdong Li, R. Hartley
  • Computer Science
    18th International Conference on Pattern Recognition (ICPR'06)
  • 2006
TLDR
This paper provides a simpler algorithm based on the hidden variable resultant technique, which eliminates many unknowns at once in the equation solving stage and compute the minimal singular vector of the coefficient matrix, by which all the unknown parameters can be estimated simultaneously.
An efficient solution to the relative pose estimation with a common direction
TLDR
This work derives new constraints on the simplified essential matrix using an elimination strategy based on Gröbner basis and computing the coefficients of these constraints require less computation and only needs to solve a polynomial eigenvalue problem.
Minimal Cases for Computing the Generalized Relative Pose using Affine Correspondences
TLDR
The rotation can be correctly recovered, while both the translation direction and the translation scale cannot be estimated using one AC.
An Efficient Hidden Variable Approach to Minimal-Case Camera Motion Estimation
  • R. Hartley, Hongdong Li
  • Computer Science, Mathematics
    IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2012
TLDR
An efficient new approach for solving two-view minimal-case problems in camera motion estimation, most notably the so-called five-point relative orientation problem and the six-point focal-length problem, based on the hidden variable technique used in solving multivariate polynomial systems.
...
...

References

SHOWING 1-10 OF 61 REFERENCES
An efficient solution to the five-point relative pose problem
  • D. Nistér
  • Computer Science
    2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.
  • 2003
TLDR
An efficient algorithmic solution to the classical five-point relative pose problem is presented, which is the first algorithm well suited for numerical implementation that also corresponds to the inherent complexity of the problem.
Review and analysis of solutions of the three point perspective pose estimation problem
In this paper, the major direct solutions to the three point perspective pose estimation problems are reviewed from a unified perspective beginning with the first solution which was published in 1841
Motion from point matches: Multiplicity of solutions
TLDR
It is shown that the maximum number of solutions to the motion problem is 10 when 5 point matches are available, which settles a question that has been around in the computer vision community for a while.
Reconstruction from Calibrated Cameras—A New Proof of the Kruppa-Demazure Theorem
TLDR
Another proof of this theorem based on a different parameterisation of the problem neither using the epipoles nor the essential matrix is given, which shows that the twisted pair solutions are natural in this context because the kinetic depths are the same for both components.
Subspace methods for recovering rigid motion I: Algorithm and implementation
TLDR
This article shows that the nonlinear equation describing the optical flow field can be split by an exact algebraic manipulation to form three sets of equations, and shows that depth and rotation need not be known or estimated prior to solving for translation.
The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix
TLDR
A variety of robust methods for the computation of the Fundamental Matrix, the calibration-free representation of camera motion, are developed from the principal categories of robust estimators, viz. case deletion diagnostics, M-estimators and random sampling, and the theory required to apply them to non-linear orthogonal regression problems is developed.
Relative orientation
TLDR
A simple iterative scheme for recovering relative orientation that does not require a good initial guess for the baseline and the rotation, and is well known that at least five pairs of rays are needed.
In Defense of the Eight-Point Algorithm
  • R. Hartley
  • Computer Science
    IEEE Trans. Pattern Anal. Mach. Intell.
  • 1997
TLDR
This paper shows that by preceding the eight-point algorithm with a very simple normalization (translation and scaling) of the coordinates of the matched points, results are obtained comparable with the best iterative algorithms.
Flexible camera calibration by viewing a plane from unknown orientations
  • Zhengyou Zhang
  • Physics
    Proceedings of the Seventh IEEE International Conference on Computer Vision
  • 1999
TLDR
Compared with classical techniques which use expensive equipment, such as two or three orthogonal planes, the proposed technique is easy to use and flexible, and advances 3D computer vision one step from laboratory environments to real-world use.
Uniqueness and Estimation of Three-Dimensional Motion Parameters of Rigid Objects with Curved Surfaces
TLDR
It is shown that seven point correspondences are sufficient to uniquely determine from two perspective views the three-dimensional motion parameters (within a scale factor for the translations) of a rigid object with curved surfaces.
...
...