Evolutionary algorithm for dense pixel matching in presence of distortions

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

Abstract

Dense pixel matching is an essential step required by many computer vision applications. While a large body of work has addressed quite successfully the rectified scenario, accurate pixel correspondence between an image and a distorted version remains very challenging. Exploiting an analogy between sequences of genetic material and images, we propose a novel genetics inspired algorithm where image variability is treated as the product of a set of image mutations. As a consequence, correspondence for each scanline of the initial image is formulated as the optimisation of a path in the second image minimising a fitness function penalising mutations. This optimisation is performed by a evolutionary algorithm which, in addition to provide fast convergence, implicitly ensures consistency between successive scanlines. Performance evaluation on locally and globally distorted images validates our bio-inspired approach.

Cite

CITATION STYLE

APA

Dos-Santos-Paulino, A. C., Nebel, J. C., & Flórez-Revuelta, F. (2014). Evolutionary algorithm for dense pixel matching in presence of distortions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8602, pp. 439–450). Springer Verlag. https://doi.org/10.1007/978-3-662-45523-4_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