| Authors | سید جلال الدین موسوی راد,حسین ابراهیم پور کومله |
| Journal | Applied Soft Computing |
| Page number | 105427 |
| Volume number | 97 |
| IF | ثبت نشده |
| Paper Type | Full Paper |
| Published At | 2020-12-01 |
| Journal Grade | Scientific - research |
| Journal Type | Electronic |
| Journal Country | Iran, Islamic Republic Of |
| Journal Index | SCOPUS ,ISI-Listed |
Abstract
Multilevel thresholding is one of the principal methods of image segmentation. These methods
enjoy from image histogram for segmentation. The quality of segmentation depends on the value
of selected thresholds. Since an exhaustive search is made for finding the optimum value of the
objective function, the conventional methods of multilevel thresholding are time-consuming
computationally, especially when the number of thresholds increases. Use of evolutionary
algorithms has attracted a lot of attention under such circumstances. Human mental search
algorithm is a population-based evolutionary algorithm inspired by the manner of human mental
search in online auctions. This algorithm has three interesting operators: 1) clustering for finding
the promising areas, 2) mental search for exploring the surrounding of every solution using Levy
distribution, and 3) moving the solutions toward the promising area. In the present study,
multilevel thresholding is proposed for image segmentation using human mental search
algorithm. Kapur (entropy) and Otsu (between-class variance) criteria were used for this purpose.
The advantages of the proposed method are described using twelve images and in comparison
with other existing approaches, including genetic algorithm, particle swarm optimization,
differential evolution, firefly algorithm, bat algorithm, gravitational search algorithm, and
teaching-learning-based optimization. The obtained results indicated that the proposed method is
highly efficient in multilevel image thresholding in terms of objective function value, peak signal
to noise, structural similarity index, feature similarity index, and curse of dimensionality. In
addition, two nonparametric statistical tests verified the efficiency of the proposed algorithm,
statistically.