1996 · 243 citations · 15 references
ComputingComputer ScienceComputational GeometryComputer VisionMachine Vision3D ReconstructionCamera GeometryDepth EstimationGeometry ProcessingMulti-view GeometryScene ReconstructionFundamental MatrixGeometric ReconstructionProjective ReconstructionScene Depth ReconstructionScene Reconstruction From ImagesScene Reconstruction From Multiple ViewsStructure From Motion
This paper describes a family of factorization-based algorithms that recover 3D projective structure and motion from multiple uncalibrated perspective images of 3D points and lines. They can be viewed as generalizations of the Tomasi-Kanade algorithm from affine to fully perspective cameras, and from points to lines. They make no restrictive assumptions about scene or camera geometry, and unlike most existing reconstruction methods they do not rely on 'privileged' points or images. All of the available image data is used, and each feature in each image is treated uniformly. The key to projective factorization is the recovery of a consistent set of projective depths (scale factors) for the image points: this is done using fundamental matrices and epipoles estimated from the image data. We compare the performance of the new techniques with several existing ones, and also describe an approximate factorization method that gives similar results to SVD-based factorization, but runs much more quickly for large problems.
15
Numerical recipes in C: the art of scientific computing
Choice Reviews Online · 1993 · 18.1K citations · Full text
Numerical recipes in Pascal: the art of scientific computing
Choice Reviews Online · 1990 · 11.9K citations
In defence of the 8-point algorithm
Richard Hartley · 2002 · 645 citations