.png){kind=icon}
.png){kind=icon}
Return
Tree-based binary image dissimilarity measure with meta-heuristic optimization
.png){kind=icon}
OA
AI
DOI：10.1007/s10044-015-0511-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Binary image dissimilarity measure
Binary image tree representation
Meta-heuristic optimization
Genetic algorithm
Particle swarm optimization
Simulated annealing
Journal
IF:
2
Papers:
1.9K
Citations:
1.9K