Computer Vision and Image Understanding
Determining the Epipolar Geometry and its Uncertainty: A Review
International Journal of Computer Vision
Integrating Local Affine into Global Projective Images in the Joint Image Space
ECCV '00 Proceedings of the 6th European Conference on Computer Vision-Part I
Multiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision
Robust Computation and Parametrization of Multiple View Relations
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
How Hard is 3-View Triangulation Really?
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Quasiconvex Optimization for Robust Geometric Reconstruction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Practical Global Optimization for Multiview Geometry
International Journal of Computer Vision
Multiple-View Geometry Under the {$L_\infty$}-Norm
IEEE Transactions on Pattern Analysis and Machine Intelligence
A fast optimal algorithm for L2 triangulation
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Hi-index | 0.00 |
Given two images, the optimal triangulation of a measured corresponding point pair is to basically find out the real roots of a 6-degree polynomial. Since for each point pair, this root finding process should be done, the optimal triangulation for the whole image is computationally intensive. In this work, via the 3D cone expression of fundamental matrix, called the fundamental cone, together with the Lagrange's multiplier method, the optimal triangulation problem is reformulated. Under this new formulation, the optimal triangulation for a measured point pair is converted to finding out the closest point on the fundamental cone to the measured point in the joint image space, then 3 efficient suboptimal algorithms, each of them can satisfy strictly the epipolar constraint of the two images, are proposed. In our first suboptimal algorithm, the closest point on the generating cone to the measured point is used as the approximation of the optimal solution, which is to find out the real roots of a 4-degree polynomial; in our second suboptimal algorithm, the closest point on the generating line to the measured point is used as the approximation of the optimal solution, which is to find out the real roots of a 2-degree polynomial. Finally, in our third suboptimal algorithm, the converging point of the Sampson approximation sequence is used as the approximation of the optimal solution. Experiments with simulated data as well as real images show that our proposed 3 suboptimal algorithms can achieve comparable estimation accuracy compared with the original optimal triangulation, but with much less computational load. For example, our second and third suboptimal algorithms take only about a 1/5 runtime of the original optimal solution. Besides, under our new formulation, rather than recompute the two Euclidian transformation matrices for each measured point pair, a fixed Euclidian transformation matrix is used for all image point pairs, which, in addition to its mathematical elegance and computational efficiency, is able to remove the dependency of the resulting polynomial's degree on the parameterization of the epipolar pencil in either the first image or in the second image, a drawback in the original optimal triangulation.