Ant Colony Optimization with Horizontal and Vertical Crossover Search: Fundamental Visions for Multi-threshold Image Segmentation

11/01/2020
by   Ali Asghar Heidari, et al.
1

The ant colony optimization (ACO) is the most exceptionally fundamental swarm-based solver for realizing discrete problems. In order to make it also suitable for solving continuous problems, a variant of ACO (ACOR) has been proposed already. The deep-rooted ACO always stands out in the eyes of well-educated researchers as one of the best-designed metaheuristic ways for realizing the solutions to real-world problems. However, ACOR has some stochastic components that need to be further improved in terms of solution quality and convergence speed. Therefore, to effectively improve these aspects, this in-depth research introduced horizontal crossover search (HCS) and vertical crossover search (VCS) into the ACOR and improved the selection mechanism of the original ACOR to form an improved algorithm (CCACO) for the first time. In CCACO, the HCS is mainly intended to increase the convergence rate. Meanwhile, the VCS and the developed selection mechanism are mainly aimed at effectively improving the ability to avoid dwindling into local optimal (LO) and the convergence accuracy. To reach next-level strong results for image segmentation and better illustrate its effectiveness, we conducted a series of comparative experiments with 30 benchmark functions from IEEE CEC 2014. In the experiment, we compared the developed CCACO with well-known conventional algorithms and advanced ones. All experimental results also show that its convergence speed and solution quality are superior to other algorithms, and its ability to avoid dropping into local optimum (LO) is more reliable than that of its peers. Furthermore, to further illustrate its enhanced performance, we applied it to image segmentation based on multi-threshold image segmentation (MTIS) method with a non-local means 2D histogram and Kapur's entropy. In the experiment, it was compared with existing competitive algorithms at low and high threshold levels. The experimental results show that the proposed CCACO achieves excellent segmentation results at both low and high threshold levels. For any help and guidance regarding this research, readers, and industry activists can refer to the background info at http://aliasgharheidari.com.

READ FULL TEXT

page 4

page 6

page 7

page 19

page 25

research
11/21/2020

Chaotic random spare ant colony optimization for multi-threshold image segmentation of 2D Kapur entropy

Although the continuous version of ant colony optimizer (ACOR) has been ...
research
08/16/2021

Ant colony optimization with Cauchy and greedy Levy mutations for multilevel COVID 19 X-ray image segmentation

This paper focuses on the study of multilevel COVID-19 X-ray T image seg...
research
11/20/2020

Horizontal and vertical crossover of Harris hawk optimizer with Nelder-Mead simplex for parameter estimation of photovoltaic models

For post-publication guidance, supports, and materials for this research...
research
11/14/2020

Dimension decided Harris hawks optimization with Gaussian mutation: Balance analysis and diversity patterns

Harris hawks optimization (HHO) is a newly developed swarm-based algorit...
research
09/25/2020

Multi-population following behavior-driven fruit fly optimization A Markov chain convergence proof and comprehensive analysis

An online repository will support this research at http://aliasgharheida...
research
08/16/2021

Orthogonal learning covariance matrix for defect of grey wolf optimizer: Insights, balance, diversity, and feature selection

This research’s genesis is in two aspects: first, a guaranteed solution ...

Please sign up or login with your details

Forgot password? Click here to reset