Abstract
We study the following problem in computer vision from the perspective of algebraic geometry: Using m pinhole cameras we take m pictures of a line in . This produces m lines in
and the question is which m-tuples of lines can arise that way. We are interested in polynomial equations and therefore study the complex Zariski closure of all such tuples of lines. The resulting algebraic variety is a subvariety of
and is called line multiview variety. In this article, we study its ideal. We show that for generic cameras the ideal is generated by
-minors of a specific matrix. We also compute Gröbner bases and discuss to what extent our results carry over to the non-generic case.
Acknowledgments
Part of this work was completed while the authors visited the Czech Institute of Informatics, Robotics, and Cybernetics as part of the Intelligent Machine Perception Project. We thank Tomas Pajdla for the invitation.
Notes
1 The proof is similar to the computation in [5, Section 3]
2 Recall (see e.g. [6, Section 2.7, Theorem 9]) that a polynomial ideal has a unique reduced Gröbner basis with respect to any monomial order. A Gröbner basis G is said to be reduced if every has leading coefficient 1 and, for distinct
the leading term
does not divide any term of