IEEE Transactions on Pattern Analysis and Machine Intelligence
In Defense of the Eight-Point Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Determining the Epipolar Geometry and its Uncertainty: A Review
International Journal of Computer Vision
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
International Journal of Computer Vision - Special issue on a special section on visual surveillance
On the Fitting of Surfaces to Data with Covariances
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiple view geometry in computer vision
Multiple view geometry in computer vision
Estimating the fundamental matrix by transforming image points in projective space
Computer Vision and Image Understanding
Nonlinear Estimation of the Fundamental Matrix with Minimal Parameters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Statistical Optimization for Geometric Computation: Theory and Practice
Statistical Optimization for Geometric Computation: Theory and Practice
Estimation of Nonlinear Errors-in-Variables Models for Computer Vision Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
High Accuracy Fundamental Matrix Computation and Its Performance Evaluation
IEICE - Transactions on Information and Systems
Globally Optimal Estimates for Geometric Reconstruction Problems
International Journal of Computer Vision
Performance evaluation of iterative geometric fitting algorithms
Computational Statistics & Data Analysis
International Journal of Computer Vision
Highest accuracy fundamental matrix computation
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
One-Dimensional search for reliable epipole estimation
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
Highest accuracy fundamental matrix computation
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Hi-index | 0.00 |
A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likelihood (ML) principle, minimizing the reprojection error. The rank constraint is incorporated by the EFNS procedure. Although our algorithm produces the same solution as all existing ML-based methods, it is probably the most practical of all, being small and simple. By numerical experiments, we confirm that our algorithm behaves as expected.