Optimal triangulation in 3D computer vision using a multi-objective evolutionary algorithm

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

Abstract

The triangulation is a process by which the 3D point position can be calculated from two images where that point is visible. This process requires the intersection of two known lines in the space. However, in the presence of noise this intersection does not occur, then it is necessary to estimate the best approximation. One option towards achieving this goal is the usage of evolutionary algorithms. In general, evolutionary algorithms are very robust optimization techniques, however in some cases, they could have some troubles finding the global optimum getting trapped in a local optimum. To overcome this situation some authors suggested removing the local optima in the search space by means of a single-objective problem to a multi-objective transformation. This process is called multi-objectivization. In this paper we successfully apply this multi-objectivization to the triangulation problem. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Vite-Silva, I., Cruz-Cortés, N., Toscano-Pulido, G., & De La Fraga, L. G. (2007). Optimal triangulation in 3D computer vision using a multi-objective evolutionary algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4448 LNCS, pp. 330–339). Springer Verlag. https://doi.org/10.1007/978-3-540-71805-5_36

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