GFT: GPU fast triangulation of 3D points

Authors:
Jairo R. Sánchez;Hugo Álvarez;Diego Borro
Affiliations:
CEIT and Tecnun, University of Navarra, San Sebastián, Spain;CEIT and Tecnun, University of Navarra, San Sebastián, Spain;CEIT and Tecnun, University of Navarra, San Sebastián, Spain
Venue:
ICCVG'10 Proceedings of the 2010 international conference on Computer vision and graphics: Part II
Year:
2010

Citing 8
Cited 0

Multiple view geometry in computer vision

Multiple view geometry in computer vision
Bundle Adjustment - A Modern Synthesis

ICCV '99 Proceedings of the International Workshop on Vision Algorithms: Theory and Practice
Programmable Stream Processors

Computer
Structure from Motion Using Sequential Monte Carlo Methods

International Journal of Computer Vision
Distinctive Image Features from Scale-Invariant Keypoints

International Journal of Computer Vision
GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation (Gpu Gems)

GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation (Gpu Gems)
Multiple View Geometry and the L_"-norm

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Parallel Tracking and Mapping for Small AR Workspaces

ISMAR '07 Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality

Quantified Score

Hi-index	0.00

Visualization

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.