Determining the structure of the world and the motion of the observer from image changes has been a central problem in computer vision for over fteen years Since the early work on Structure from Motion SFM by Longuet Higgins and Pradzny several techniques have been developed to compute the motion of the camera the shape of moving objects or distances to points in the world However the image changes are non linearly related to camera mo tion and distances to points in the world Thus solving the problem typically requires non linear optimization techniques that can be unstable or computa tionally ine cient Linear algorithms are preferable since they are computa tionally advantageous and since linear estimation is much better understood than non linear estimation Our paper describes an unbiased completely linear algorithm for Structure from Motion This work is similar to that of Jepson Heeger except that we employ spherical projection The use of a spherical imaging geometry allows a simpler and more intuitive derivation of the algo rithm and produces an unbiased estimator Experimental results are provided that demonstrate the performance of the algorithm
[1]
Edward H. Adelson,et al.
Probability distributions of optical flow
,
1991,
Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[2]
Allan D. Jepson,et al.
Linear subspace methods for recovering translational direction
,
1994
.
[3]
F. A. Seiler,et al.
Numerical Recipes in C: The Art of Scientific Computing
,
1989
.
[4]
C. Tomasi,et al.
Factoring image sequences into shape and motion
,
1991,
Proceedings of the IEEE Workshop on Visual Motion.
[5]
H. C. Longuet-Higgins,et al.
A computer algorithm for reconstructing a scene from two projections
,
1981,
Nature.