Minimal Projective Reconstruction with Missing Data - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Minimal Projective Reconstruction with Missing Data

Abstract

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. 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 in 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.

Keywords

Fichier principal
Vignette du fichier
10.1.1.6.4116.pdf (192.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00590119 , version 1 (05-05-2011)

Identifiers

Cite

Anders Heyden, Fredrik Kahl, Long Quan. Minimal Projective Reconstruction with Missing Data. IEEE Conference on Computer Vision and Pattern Recognition (CVPR '99), May 1999, Fort Collins, United States. pp.210--216, ⟨10.1109/CVPR.1999.784631⟩. ⟨inria-00590119⟩
225 View
189 Download

Altmetric

Share

Gmail Facebook X LinkedIn More