Evaluating robustness of template matching algorithms as a multi-objective optimisation problem

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Template matching has multiple applications on different problems in computer vision. Image distortions remain as the main challenge that template matching algorithms have to overcome. Thus, measuring robustness of algorithms against distortion conditions is an important task. Moreover, a comparison among template matching algorithms is difficult to achieve due to the lack of a standard evaluation methodology. In this paper, a measurement for quantifying the robustness of template matching algorithms against a single distortion is introduced. In addition, a procedure for comparing template matching algorithms is presented, aiming to become an evaluation standard. The comparison of template matching algorithms is formulated as a Multi-objective Optimisation problem. Experimental evaluation of the proposed procedure, using the robustness coefficient, is conducted by comparing algorithms based on full-search and different similarity measurements.

Cite

CITATION STYLE

APA

Bernal, J., Trujillo, M., & Cabezas, I. (2014). Evaluating robustness of template matching algorithms as a multi-objective optimisation problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8827, pp. 30–37). Springer Verlag. https://doi.org/10.1007/978-3-319-12568-8_4

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