K.B. Atkinson, Close Range Photogrammetry and Machine Vision. Whittles Publishing, 1996.
S. Carlsson and D. Weinshall, "Dual Computation of Projective Shape and Camera Positions from Multiple Images," Int',l J. Computer Vision, vol. 27, no. 3, pp. 227-241, 1998. [CrossRef]
D. Cox, J. Little and D. O',Shea, Ideals, Varities, and Algorithms. New York: Springer-Verlag, 1992. [CrossRef]
O.D. Faugeras, "What Can Be Seen in Three Dimensions with an Uncalibrated Stereo Rig?" Proc. European Conf. Computer Vision, pp. 563-578, 1992.
O.D. Faugeras and S. Maybank, "Motion from Point Matches: Multiplicity of Solutions," Technical Report 1157, INRIA, Rocquencourt, France, 1990. [CrossRef]
M.A. Fischler and R.C. Bolles, "Random Sample Consencus, A Paradigm for Model Fitting with Application to Image Analysis and Automated Cartography," Comm. Assoc. Computer Machine, vol. 24, pp. 381-395, 1981.
B. Triggs, "Linear Projective Reconstruction from Matching Tensors," Image and Vision Computing, vol. 15, no. 8, pp. 617-625, 1997. [CrossRef]
Z. Zhang, R. Deriche, O.D. Faugeras and Q.T. Luong, "A Robust Technique for Matching Two Uncalibrated Images through the Recovery of the Unknown Apipolar Geometry," technical teport, INRIA, Rocquencourt, France, 1994. [CrossRef]
The minimal data necessary for projective reconstruction from image points is well-known when each object point is visible in all images. We formulate and propose solutions to a family of reconstruction problems for multiple images from minimal data, where there are missing points in some of the images. The ability to handle the minimal cases with missing data is of great theoretical and practical importance. It is unavoidable to use them to bootstrap robust estimation such as RANSAC and LMS algorithms and optimal estimation such as bundle adjustment. First, we develop a framework to parameterize the multiple view geometry needed to handle the missing data cases. Then, we present a solution to the minimal case of eight points in three images, where one different point is missing in each of the three images. We prove that there are, in general, as many as 11 solutions for this minimal case. Furthermore all minimal cases with missing data for three and four images are catalogued. Finally, we demonstrate the method on both simulated and real images and show that the algorithms presented in the paper can be used for practical problems