Least Square for Grassmann-Cayley Agelbra in Homogeneous Coordinates - HAL Accéder directement au contenu
Communication dans un congrès Année : 2014

Least Square for Grassmann-Cayley Agelbra in Homogeneous Coordinates

Résumé

This paper presents some tools for least square computation in Grassmann-Cayley algebra, more specifically for elements expressed in homogeneous coordinates. We show that building objects with the outer product from k-vectors of same grade presents some properties that can be expressed in term of linear algebra and can be treated as a least square problem. This paper mainly focuses on line and plane fitting and intersections computation, largely used in computer vision. We show that these least square problems written in Grassmann-Cayley algebra have a direct reformulation in linear algebra, corresponding to their standard expression in projective geometry and hence can be solved using standard least square tools.
Fichier principal
Vignette du fichier
GCCV2013.pdf ( 472.37 Ko ) Télécharger
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01510077, version 1 (19-04-2017)

Identifiants

Citer

Vincent Lesueur, Vincent Nozick. Least Square for Grassmann-Cayley Agelbra in Homogeneous Coordinates. GCCV 2013, Oct 2013, Guanajuato, Mexico. pp.133 - 144, ⟨10.1007/978-3-642-53926-8_13⟩. ⟨hal-01510077⟩
106 Consultations
348 Téléchargements
Dernière date de mise à jour le 25/06/2024
comment ces indicateurs sont-ils produits

Altmetric

Partager

Gmail Facebook Twitter LinkedIn Plus