Least square for Grassmann-Cayley agelbra in homogeneous coordinates

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Lesueur, V., & Nozick, V. (2014). Least square for Grassmann-Cayley agelbra in homogeneous coordinates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8334, pp. 133–144). Springer Verlag. https://doi.org/10.1007/978-3-642-53926-8_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free