Recovering an algebraic curve using its projections from different points: applications to static and dynamic computational vision

• Autores: Mina Teicher, Michael Fryers, Jeremy Yimeryahu Kaminski
• Localización: Journal of the European Mathematical Society, ISSN 1435-9855, Vol. 7, Nº 2, 2005, págs. 145-172
• Idioma: inglés
• DOI: 10.4171/jems/25
• Texto completo no disponible (Saber más ...)
• Resumen

  • We study some geometric configurations related to the projection of an irreducible algebraic curve embedded in $\C \PP^3$ onto embedded projective planes. These configurations are motivated by applications to static and dynamic computational vision. More precisely, we study how an irreducible closed algebraic curve $X$ embedded in $\C \PP^3$, which degree is $d$ and genus $g$, can be recovered using its projections from points onto embedded projective planes. The different embeddings are unknown. The only input is the defining equation of each projected curve. We show how both the embeddings and the curve in $\C \PP^3$ can be recovered modulo some action of the group of projective transformations of $\C \PP^3$. In particular in the case of two projections, we show how in a generic situation, a characteristic matrix of the pair of embeddings can be recovered. In the process we address dimensional issues and as a result establish the minimal number of irreducible algebraic curves required to compute this characteristic matrix up to a finite-fold ambiguity, as a function of their degrees and genus. Then we use this matrix to recover the class of the couple of maps and as a consequence to recover the curve. For a generic situation, two projections define a curve with two irreducible components. One component has degree $d(d-1)$ and the other has degree $d$, being the original curve. Then we consider another problem. $N$ projections, with known projections operators and $N >> 1$, are considered as an input and we want to recover the curve. The recovery can be done by linear computations in the dual space and in the Grassmannian of lines in $\C \PP^3$. Those computations are respectively based on the dual variety and on the variety of intersecting lines. In both cases a simple lower bound for the number of necessary projections is given as a function of the degree and the genus. A closely related question is also considered. Each point of a finite closed subset of an irreducible algebraic curve, is projected onto a plane from a point. For each point the center of projection is different. The projections operators are known. We show when and how the recovery of the algebraic curve is possible, in function of the degree of the curve, and of the degree of the curve of minimal degree generated by the centers of projection. Eventually we show how these questions were motivated by applications to static and dynamic computational vision. A second part of this work is devoted to several applications to this field. The results in this paper solve a long standing problem in computer vision that could not have been solved without algebraic-geometric methods.