Heuristic optimization algorithms for a tree-based image dissimilarity measure

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

Abstract

In this paper, we present an application of three heuristic optimization algorithms to computing tree-based image dissimilarity. Genetic algorithm, particle swarm optimization and simulated annealing have been applied to optimize a blackbox function which aims to determine a difference between two trees, constructed upon binary images. Presented results show that the particle swarm optimization achieved the best results. Both PSO and the simulated annealing outperformed the genetic algorithm. We also draw conclusions on parameter adjustment for the considered methods. © Springer International Publishing Switzerland 2013.

Cite

CITATION STYLE

APA

Zieliński, B., & Iwanowski, M. (2013). Heuristic optimization algorithms for a tree-based image dissimilarity measure. Advances in Intelligent Systems and Computing, 226, 91–100. https://doi.org/10.1007/978-3-319-00969-8_9

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