How hard is 3-view triangulation really?
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 686-693 Vol. 1
- https://doi.org/10.1109/iccv.2005.115
Abstract
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maximum likelihood) objective function. Internally, the solution is found by computing roots of multivariate polynomial equations, directly solving the conditions for stationarity. The solver makes use of standard methods from computational commutative algebra to convert the root-finding problem into a 47 /spl times/ 47 nonsymmetric eigenproblem. Although there are in general 47 roots, counting both real and complex ones, the number of real roots is usually much smaller. We also show experimentally that the number of stationary points that are local minima and lie in front of each camera is small but does depend on the scene geometry.Keywords
This publication has 15 references indexed in Scilit:
- L/sub X/ minimization in geometric reconstruction problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- An efficient solution to the five-point relative pose problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Exact two-image structure from motionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Bundle Adjustment — A Modern SynthesisPublished by Springer Nature ,2000
- Determining the Epipolar Geometry and its Uncertainty: A ReviewInternational Journal of Computer Vision, 1998
- TriangulationComputer Vision and Image Understanding, 1997
- Robust parameterization and computation of the trifocal tensorImage and Vision Computing, 1997
- Number of Solutions for Motion and Structure from Multiple Frame CorrespondenceInternational Journal of Computer Vision, 1997
- Algebraic methods for image processing and computer visionIEEE Transactions on Image Processing, 1996
- MultiPolynomial Resultant AlgorithmsJournal of Symbolic Computation, 1993