Stabilizing the Focal Length Computation for 3-D Reconstruction from Two Uncalibrated Views

Authors:
Kenichi Kanatani;Atsutada Nakatsuji;Yasuyuki Sugaya
Affiliations:
Department of Computer Science, Okayama University, Okayama, Japan 700-8530;Internet Terminals Division, NEC Engineering, Ltd., Yokohama, Kanagawa, Japan 183-8502;Department of Computer Science, Okayama University, Okayama, Japan 700-8530
Venue:
International Journal of Computer Vision
Year:
2006

Citing 13
Cited 6

Some Properties of the E Matrix in Two-View Motion Estimation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Geometric computation for machine vision

Geometric computation for machine vision
A robust technique for matching two uncalibrated images through the recovery of the unknown epipolar geometry

Artificial Intelligence - Special volume on computer vision
Geometric Information Criterion for Model Selection

International Journal of Computer Vision
Self-Calibration and Metric Reconstruction Inspite of Varying and Unknown Intrinsic Camera Parameters

International Journal of Computer Vision - 1998 Marr Prize
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 visiond

Multiple view geometry in computer visiond
Statistical Optimization for Geometric Computation: Theory and Practice

Statistical Optimization for Geometric Computation: Theory and Practice
Estimation of Relative Camera Positions for Uncalibrated Cameras

ECCV '92 Proceedings of the Second European Conference on Computer Vision
Euclidean Reconstruction from Image Sequences with Varying and Unknown Focal Length and Principal Point

CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
From Projective to Euclidean Space Under any Practical Situation, a Criticism of Self-Calibration

ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Uncertainty Modeling and Model Selection for Geometric Inference

IEEE Transactions on Pattern Analysis and Machine Intelligence

Direct 3D metric reconstruction from multiple views using differential evolution

Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Behaviour of SFM algorithms with erroneous calibration

Computer Vision and Image Understanding
Building detection and 3D reconstruction from two-view of monocular camera

ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I
Building face reconstruction from sparse view of monocular camera

ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Practical structure and motion recovery from two uncalibrated images using ε Constrained Adaptive Differential Evolution

Pattern Recognition
Stable two view reconstruction using the six-point algorithm

ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to reconstruct 3-D shape from two uncalibrated views, one needs to resolve two problems: (i) the computed focal lengths can be imaginary; (ii) the computation fails for fixated images. We present a practical remedy for these by subsampling feature points and fixing the focal length. We first summarize theoretical backgrounds and then do simulations, which reveal a rather surprising fact that when the focal length is actually fixed, not using that knowledge yields better results for non-fixated images. We give an explanation to this seeming paradox and derive a hybrid method switching the computation by judging whether or not the images are fixated. Doing simulations and real image experiments, we demonstrate the effectiveness of our method.