GFT: GPU fast triangulation of 3D points

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

Abstract

Traditionally triangulating 3D points from image features is a complex task that involves non-linear optimization techniques that are computationally very expensive. This work proposes an algorithm based on Monte Carlo simulations that fits well on the graphics hardware and can perform the triangulation in real time. Results are compared against the well known Levenberg-Mardquart using real video sequences, showing that it achieves the same precision but in much less time. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sánchez, J. R., Álvarez, H., & Borro, D. (2010). GFT: GPU fast triangulation of 3D points. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6375 LNCS, pp. 235–242). https://doi.org/10.1007/978-3-642-15907-7_29

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