Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3645
Articles: 2'500'096
Articles rated: 2609

18 April 2024
 
  » arxiv » math.AG/0208099

 Article overview


Recovering an Algebraic Curve Using its Projections From Different Points. Applications to Static and Dynamic Computational Vision
M. Fryers ; J.Y. Kaminski ; M. Teicher ;
Date 13 Aug 2002
Subject Algebraic Geometry; Complex Variables MSC-class: 14Q99; 68T45 | math.AG math.CV
AbstractWe study how an irreducible closed algebraic curve X embedded in CP^3 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 CP^3 can be recovered modulo some actions of the group of projective transformations of CP^3. For two projections, we show how in a generic situation, a characteristic matrix of the two embeddings can be recovered. We also 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 degree and genus. Then we use this matrix to recover the class of the couple of maps and as a consequence to recover the 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 CP^3. 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 different point. 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 of minimal degree generated by the centers of projection. A second part is devoted to applications to computer vision. The results in this paper solve a long standing problem in computer vision that could not have been solved without algebraic-geometric methods.
Source arXiv, math.AG/0208099
Other source [GID 847902] math.AG/0208099
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser claudebot






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica