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.
Highest Accuracy Fundamental Matrix Computation
Asian Conference on Computer Vision ; 2007 ; Tokyo, Japan November 18, 2007 - November 22, 2007
2007-01-01
11 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Singular Value Decomposition , Fundamental Matrix , Bundle Adjustment , Computer Vision Application , Reprojection Error Computer Science , Image Processing and Computer Vision , Computer Imaging, Vision, Pattern Recognition and Graphics , Pattern Recognition , Artificial Intelligence , Biometrics , Algorithm Analysis and Problem Complexity
Fundamental matrix from optical flow: optimal computation and reliability evaluation
British Library Online Contents | 2000
|Fully automated panel line with highest accuracy minimizes reworking and assembling
Tema Archiv | 2008
|Towards Ultimate Motion Estimation: Combining Highest Accuracy with Real-Time Performance
British Library Conference Proceedings | 2005
|Engineering Index Backfile | 1948