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

• Volume: 007, Issue: 2, page 1-28
• ISSN: 1435-9855

top

Abstract

top
We study some geometric configurations related to projections of an irreducible algebraic curve embedded in $ℂ{ℙ}^{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 $ℂ{ℙ}^{3}$, of degree $d$ and genus $g$, can be recovered using its projections from points onto embedded projective planes. The embeddings are unknown. The only input is the defining equation of each projected curve. We show how both the embeddings and the curve in $ℂ{ℙ}^{3}$ can be recovered modulo some action of the group of projective transformations of $ℂ{ℙ}^{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 find 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. In a generic situation, two projections define a curve with two irreducible components. One component has degree $d\left(d-1\right)$ and the other has degree $d$, being the original curve. Then we consider another problem. $N$ projections, with known projection operators and $N\gg 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 $ℂ{ℙ}^{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 projection center is different. The projection operators are known. We show when and how the recovery of the algebraic curve is possible, in terms of the degree of the curve, and of the degree of the curve of minimal degree generated by the projection centers. Finally, we show how these questions are 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 be solved without algebraic-geometric methods.

How to cite

top

Kaminski, Jeremy Yirmeyahu, Fryers, Michael, and Teicher, Mina. "Recovering an algebraic curve using its projections from different points. Applications to static and dynamic computational vision." Journal of the European Mathematical Society 007.2 (2005): 1-28. <http://eudml.org/doc/277539>.

@article{Kaminski2005,
abstract = {We study some geometric configurations related to projections of an irreducible algebraic curve embedded in $\mathbb \{C\}\mathbb \{P\}^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 $\mathbb \{C\}\mathbb \{P\}^3$, of degree $d$ and genus $g$, can be recovered using its projections from points onto embedded projective planes. The embeddings are unknown. The only input is the defining equation of each projected curve. We show how both the embeddings and the curve in $\mathbb \{C\}\mathbb \{P\}^3$ can be recovered modulo some action of the group of projective transformations of $\mathbb \{C\}\mathbb \{P\}^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 find 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. In 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 projection operators and $N\gg 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 $\mathbb \{C\}\mathbb \{P\}^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 projection center is different. The projection operators are known. We show when and how the recovery of the algebraic curve is possible, in terms of the degree of the curve, and of the degree of the curve of minimal degree generated by the projection centers. Finally, we show how these questions are 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 be solved without algebraic-geometric methods.},
author = {Kaminski, Jeremy Yirmeyahu, Fryers, Michael, Teicher, Mina},
journal = {Journal of the European Mathematical Society},
keywords = {plane and space curves; projections; machine vision; structure from motion},
language = {eng},
number = {2},
pages = {1-28},
publisher = {European Mathematical Society Publishing House},
title = {Recovering an algebraic curve using its projections from different points. Applications to static and dynamic computational vision},
url = {http://eudml.org/doc/277539},
volume = {007},
year = {2005},
}

TY - JOUR
AU - Kaminski, Jeremy Yirmeyahu
AU - Fryers, Michael
AU - Teicher, Mina
TI - Recovering an algebraic curve using its projections from different points. Applications to static and dynamic computational vision
JO - Journal of the European Mathematical Society
PY - 2005
PB - European Mathematical Society Publishing House
VL - 007
IS - 2
SP - 1
EP - 28
AB - We study some geometric configurations related to projections of an irreducible algebraic curve embedded in $\mathbb {C}\mathbb {P}^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 $\mathbb {C}\mathbb {P}^3$, of degree $d$ and genus $g$, can be recovered using its projections from points onto embedded projective planes. The embeddings are unknown. The only input is the defining equation of each projected curve. We show how both the embeddings and the curve in $\mathbb {C}\mathbb {P}^3$ can be recovered modulo some action of the group of projective transformations of $\mathbb {C}\mathbb {P}^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 find 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. In 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 projection operators and $N\gg 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 $\mathbb {C}\mathbb {P}^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 projection center is different. The projection operators are known. We show when and how the recovery of the algebraic curve is possible, in terms of the degree of the curve, and of the degree of the curve of minimal degree generated by the projection centers. Finally, we show how these questions are 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 be solved without algebraic-geometric methods.
LA - eng
KW - plane and space curves; projections; machine vision; structure from motion
UR - http://eudml.org/doc/277539
ER -

NotesEmbed?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.