Highest accuracy fundamental matrix computation

Authors:
Yasuyuki Sugaya;Kenichi Kanatani
Affiliations:
Department of Information and Computer Sciences, Toyohashi University of Technology, Toyohashi, Aichi, Japan;Department of Computer Science, Okayama University, Okayama, Japan
Venue:
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Year:
2007

Citing 10
Cited 2

In Defense of the Eight-Point Algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Compact Fundamental Matrix Computation

PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
One-Dimensional search for reliable epipole estimation

PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology

Compact Fundamental Matrix Computation

PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
Distortion compensation for movement detection based on dense optical flow

ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We compare algorithms for fundamental matrix computation, which we classify into "a posteriori correction", "internal access", and "external access". Doing experimental comparison, we show that the 7-parameter Levenberg-Marquardt (LM) search and the extended FNS (EFNS) exhibit the best performance and that additional bundle adjustment does not increase the accuracy to any noticeable degree.