Triangulation using differential evolution

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

Abstract

Triangulation is one step in Computer Vision where the 3D points are calculated from 2D point correspondences over 2D images. When these 2D points are free of noise, the triangulation is the intersection point of two lines, but in the presence of noise this intersection does not occur and then the best solution must be estimated. We propose in this article a fast algorithm that uses Differential Evolution to calculate the optimal triangulation. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Landa-Becerra, R., & De La Fraga, L. G. (2008). Triangulation using differential evolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4974 LNCS, pp. 359–364). https://doi.org/10.1007/978-3-540-78761-7_38

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