|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'99) - Volume 2
Minimal Projective Reconstruction with Missing Data
Fort Collins, Colorado
June 23-June 25
ISBN: 0-7695-0149-4
| ASCII Text | x | ||
| Long Quan, Anders Heyden, Fredrik Kahl, "Minimal Projective Reconstruction with Missing Data," 2012 IEEE Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 2210, 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'99) - Volume 2, 1999. | |||
| BibTex | x | ||
| @article{ 10.1109/CVPR.1999.784631, author = {Long Quan and Anders Heyden and Fredrik Kahl}, title = {Minimal Projective Reconstruction with Missing Data}, journal ={2012 IEEE Conference on Computer Vision and Pattern Recognition}, volume = {2}, year = {1999}, issn = {1063-6919}, pages = {2210}, doi = {http://doi.ieeecomputersociety.org/10.1109/CVPR.1999.784631}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE Conference on Computer Vision and Pattern Recognition TI - Minimal Projective Reconstruction with Missing Data SN - 1063-6919 SP EP A1 - Long Quan, A1 - Anders Heyden, A1 - Fredrik Kahl, PY - 1999 VL - 2 JA - 2012 IEEE Conference on Computer Vision and Pattern Recognition ER - | |||
The minimal data necessary for projective reconstruction from point correspondences is well-known when the points are visible in all images. In this paper, we formulate and propose solutions to a new family of reconstruction problems from multiple images with 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 [12].First, we develop a framework to parametrize the multiple view geometry, needed to handle the missing data cases. Then we present a solution to the minimal case of 8 points in 3 images, where one of the points is missing in one 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 3 and 4 images are catalogued. Finally, we demonstrate the method on both simulated and real images and show that the algorithms presented in this paper can be used for practical problems.
Citation:
Long Quan, Anders Heyden, Fredrik Kahl, "Minimal Projective Reconstruction with Missing Data," cvpr, vol. 2, pp.2210, 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'99) - Volume 2, 1999
Usage of this product signifies your acceptance of the Terms of Use.
