This paper deals with the problem of reconstructing the locations of a number of points in space from three different images taken by uncalibrated cameras. It is assumed that the correspondences between the points in the different images are known. In the case of six points this paper shows that there are in general three solutions to the problem of determining the shape of the object, but some of them may be complex and some may not be physically realisable (e.g. points behind the camera). The solutions are given by a third degree polynomial with coefficients depending on the coordinates of the points in the image. It is also shown how a priori information of the object, such as planarity of subsets of the points, can be used to make reconstruction. In this case the reconstruction is unique and it is obtained by a linear method. Furthermore it is shown how additional points in the first two images can be used to predict the location of the corresponding point in the third image, without calculating the epipoles. Finally, a linear method for the reconstruction in the case of at least seven point matches are given (Less)
[1]
Karl Johan Åström,et al.
Proximity measures for recognition
,
1994
.
[2]
Gunnar Sparr.
Depth computations from polyhedral images
,
1992,
Image Vis. Comput..
[3]
Amnon Shashua,et al.
Trilinearity in Visual Recognition by Alignment
,
1994,
ECCV.
[4]
A. Heyden.
Reconstruction from Three Images of Six Point Objects
,
1994
.
[5]
Long Quan,et al.
Invariants of 6 Points from 3 Uncalibrated Images
,
1994,
ECCV.
[6]
Anders Heyden,et al.
Reconstruction from image sequences by means of relative depths
,
1995,
Proceedings of IEEE International Conference on Computer Vision.
[7]
Gunnar Sparr,et al.
A Common Framework for Kinetic Depth, Reconstruction and Motion for Deformable Objects
,
1994,
ECCV.
[8]
Gunnar Sparr.
Depth Computations from Polyhedral Images
,
1992,
ECCV.
[9]
Olivier D. Faugeras,et al.
What can two images tell us about a third one?
,
1994,
ECCV.