Abstract
In this paper, we present a method of evaluating binary image dissimilarity based on tree representation and heuristic optimization. Starting from the image, a graph structure of a binary tree is constructed that splits the set of image foreground pixels into consecutive subsets attached to tree nodes. Next, instead of comparing two images themselves, one compares the trees and expresses image dissimilarity as tree dissimilarity, which can be characterized by a nonlinear function. The goal is to find its minimum, as it corresponds with the best match of compared trees. Searching for the minimum would be ineffective with analytical optimization methods. Hence, we have approached the issue with three meta-heuristic algorithms, namely genetic algorithm, particle swarm optimization (PSO) and simulated annealing. The presented results show that PSO achieved the best results. The proposed method is compared with other binary image comparison approaches. The performed tests that are described in the paper show that it outperforms its competitors and can be successfully applied to compare binary images.
Author supplied keywords
Cite
CITATION STYLE
Zieliński, B., & Iwanowski, M. (2016). Tree-based binary image dissimilarity measure with meta-heuristic optimization. Pattern Analysis and Applications, 19(1), 1–10. https://doi.org/10.1007/s10044-015-0511-1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.