A Study on Darwinian Crow Search Algorithm for Multilevel Thresholding

2021 ◽  
pp. 2250012
Author(s):  
Ehsan Ehsaeyan ◽  
Alireza Zolghadrasli
Keyword(s):  
Heuristic Search ◽  
Search Algorithm ◽  
Search Space ◽  
Energy Curve ◽  
Local Optimum ◽  
Multilevel Thresholding ◽  
Curve Method ◽  
Heuristic Search Methods ◽  
Multi Level ◽  
Computationally Expensive

Multilevel thresholding is a basic method in image segmentation. The conventional image multilevel thresholding algorithms are computationally expensive when the number of decomposed segments is high. In this paper, a novel and powerful technique is suggested for Crow Search Algorithm (CSA) devoted to segmentation applications. The main contribution of our work is to adapt Darwinian evolutionary theory with heuristic CSA. First, the population is divided into specified groups and each group tries to find better location in the search space. A policy of encouragement and punishment is set on searching agents to avoid being trapped in the local optimum and premature solutions. Moreover, to increase the convergence rate of the proposed method, a gray-scale map is applied to out-boundary agents. Ten test images are selected to measure the ability of our algorithm, compared with the famous procedure, energy curve method. Two popular entropies i.e. Otsu and Kapur are employed to evaluate the capability of the introduced algorithm. Eight different search algorithms are implemented and compared to the introduced method. The obtained results show that our method, compared with the original CSA, and other heuristic search methods, can extract multi-level thresholding more efficiently.

A Multilevel Image Thresholding Method Using the Darwinian Cuckoo Search Algorithm

2021 ◽  
pp. 2150052
Author(s):  
Ehsan Ehsaeyan ◽  
Alireza Zolghadrasli
Keyword(s):  
Image Segmentation ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Search Space ◽  
Cuckoo Search Algorithm ◽  
Computational Time ◽  
Energy Curve ◽  
Multilevel Thresholding ◽  
Curve Method ◽  
Thresholding Algorithm

Image segmentation is a prime operation to understand the content of images. Multilevel thresholding is applied in image segmentation because of its speed and accuracy. In this paper, a novel multilevel thresholding algorithm based on Cuckoo search (CS) is introduced. One of the major drawbacks of metaheuristic algorithms is the stagnation phenomenon which leads to a fall into local optimums and premature convergence. To overcome this shortcoming, the idea of Darwinian theory is incorporated with CS algorithm to increase the diversity and quality of the individuals without decreasing the convergence speed of CS algorithm. A policy of encouragement and punishment is considered to lead searching agents in the search space and reduce the computational time. The algorithm is implemented based on dividing the population into specified groups and each group tries to find a better location. Ten test images are selected to verify the ability of our algorithm using the famous energy curve method. Two popular entropies criteria, Otsu and Kapur, are employed to evaluate the capability of the introduced algorithm. Eight different search algorithms are also implemented and compared with our method. Experimental results manifest that DCS is a powerful tool for multilevel thresholding and the obtained results outperform the CS algorithm and other heuristic search methods.

scholarly journals A Multilevel Image Thresholding Method Based on Subspace Elimination Optimization

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Jun Qin ◽  
ChuTing Wang ◽  
GuiHe Qin
Keyword(s):  
Search Algorithm ◽  
Random Search ◽  
Solution Space ◽  
Optimization Method ◽  
Global Optimum ◽  
Local Optimum ◽  
Multilevel Thresholding ◽  
Segmented Image ◽  
Optimal Value ◽  
Indicator Functions

Multilevel thresholding is to find the thresholds to segment the image with grey levels. Usually, the thresholds are so determined that some indicator functions of the segmented image are optimized. To improve the computational efficiency, we presented an optimization method for multilevel thresholding. First, the solution space is divided into subspaces. Second, the subspaces are searched to obtain their current local optimal value. Third, the subspaces that are of worse current optimal value are eliminated. Then, the next round of elimination is exerted in the remainder. The elimination is repeated until only one subspace is left and its optimal value is taken as the global optimum. In principle, any random search algorithm can be used to find the local optimum in a subspace block because it is a strategy to enhance the searching efficiency through eliminating hopeless regions as early as possible, rather than to improve the searching algorithm itself. To verify its performance, taking PSO (Particle swarm optimization) as the basic searching algorithm of subspaces, the presented method is applied to Otsu’s and Kapur’s multilevel thresholding of four different kinds of digital images. The presented method is compared with PSO, and it behaves better in efficiency.

scholarly journals Graph Abstraction in Real-time Heuristic Search

2007 ◽  
Vol 30 ◽  
pp. 51-100 ◽  
Author(s):  
V. Bulitko ◽  
N. Sturtevant ◽  
J. Lu ◽  
T. Yau
Keyword(s):  
Real Time ◽  
Heuristic Search ◽  
Search Space ◽  
Problem Size ◽  
Heuristic Function ◽  
Planning Time ◽  
Learning Speed ◽  
Heuristic Search Methods ◽  
State Abstraction ◽  
The Impact

Real-time heuristic search methods are used by situated agents in applications that require the amount of planning per move to be independent of the problem size. Such agents plan only a few actions at a time in a local search space and avoid getting trapped in local minima by improving their heuristic function over time. We extend a wide class of real-time search algorithms with automatically-built state abstraction and prove completeness and convergence of the resulting family of algorithms. We then analyze the impact of abstraction in an extensive empirical study in real-time pathfinding. Abstraction is found to improve efficiency by providing better trading offs between planning time, learning speed and other negatively correlated performance measures.

scholarly journals SOLVING INTEGER PROGRAMMING PROBLEMS BY USING POPULATION-BASED BEETLE ANTENNAE SEARCH ALGORITHM

2021 ◽  
Vol 9 (3-4) ◽  
pp. 89-99
Author(s):  
Ivona Brajević ◽  
Miodrag Brzaković ◽  
Goran Jocić
Keyword(s):  
Integer Programming ◽  
Optimization Problems ◽  
Mechanical Design ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Search Space ◽  
Population Based ◽  
Local Optimum ◽  
Integer Programming Problems ◽  
Metaheuristic Techniques

Beetle antennae search (BAS) algorithm is a newly proposed single-solution based metaheuristic technique inspired by the beetle preying process. Although BAS algorithm has shown good search abilities, it can be easily trapped into local optimum when it is used to solve hard optimization problems. With the intention to overcome this drawback, this paper presents a population-based beetle antennae search (PBAS) algorithm for solving integer programming problems.  This method employs the population's capability to search diverse regions of the search space to provide better guarantee for finding the optimal solution. The PBAS method was tested on nine integer programming problems and one mechanical design problem. The proposed algorithm was compared to other state-of-the-art metaheuristic techniques. The comparisons show that the proposed PBAS algorithm produces better results for majority of tested problems.  

scholarly journals Smart Root Search (SRS): A Novel Nature-Inspired Search Algorithm

Symmetry ◽  
2020 ◽  
Vol 12 (12) ◽  
pp. 2025
Author(s):  
Narjes Khatoon Naseri ◽  
Elankovan A. Sundararajan ◽  
Masri Ayob ◽  
Amin Jula
Keyword(s):  
Particle Swarm Optimization ◽  
Heuristic Search ◽  
Search Algorithm ◽  
Search Space ◽  
Test Functions ◽  
Swarm Optimization ◽  
Search Spaces ◽  
Heuristic Search Algorithm ◽  
Hair Roots ◽  
Competitive Algorithms

In this paper, a novel heuristic search algorithm called Smart Root Search (SRS) is proposed. SRS employs intelligent foraging behavior of immature, mature and hair roots of plants to explore and exploit the problem search space simultaneously. SRS divides the search space into several subspaces. It thereupon utilizes the branching and drought operations to focus on richer areas of promising subspaces while extraneous ones are not thoroughly ignored. To achieve this, the smart reactions of the SRS model are designed to act based on analyzing the heterogeneous conditions of various sections of different search spaces. In order to evaluate the performance of the SRS, it was tested on a set of known unimodal and multimodal test functions. The results were then compared with those obtained using genetic algorithms, particle swarm optimization, differential evolution and imperialist competitive algorithms and then analyzed statistically. The results demonstrated that the SRS outperformed comparative algorithms for 92% and 82% of the investigated unimodal and multimodal test functions, respectively. Therefore, the SRS is a promising nature-inspired optimization algorithm.

scholarly journals A Fuzzy Adaptive Firefly Algorithm for Multilevel Color Image Thresholding Based on Fuzzy Entropy

2021 ◽  
Vol 15 (4) ◽  
pp. 1-20
Author(s):  
Yi Wang ◽  
Kangshun Li
Keyword(s):  
Heuristic Search ◽  
Firefly Algorithm ◽  
Color Image ◽  
Search Algorithm ◽  
Color Images ◽  
Multilevel Thresholding ◽  
Threshold Values ◽  
Heuristic Search Algorithm ◽  
Kapur’S Entropy ◽  
Fuzzy Adaptive

Multilevel thresholding image segmentation has always been a hot issue of research in last several years since it has a plenty of applications. Traditional exhaustive search method consumes a lot of time for searching the optimal multilevel thresholding, color images contain more information, solving multilevel thresholding will become worse. However, the meta-heuristic search algorithm has unique advantages in solving multilevel threshold values. In this paper, a fuzzy adaptive firefly algorithm (FaFA) is proposed to solve the optimal multilevel thresholding for color images, and the fuzzy Kapur's entropy is considered as its objective function. In the FaFA, a fuzzy logical controller is designed to adjust the control parameters. A total of six satellite remote sensing color images are conducted in the experiments. The performance of the FaFA is compared with FA, BWO, SSA, NaFA and ODFA. Some measure metrics are performed in the experiments. The experimental results show that the FaFA obviously outperforms other five algorithms.

scholarly journals An Improved Crow Search Algorithm for Data Clustering

2020 ◽  
Vol 8 (1) ◽  
pp. 86-101 ◽  
Author(s):  
Vivi Nur Wijayaningrum ◽  
Novi Nur Putriwijaya
Keyword(s):  
Data Clustering ◽  
Search Algorithm ◽  
Search Space ◽  
Large Datasets ◽  
The Other ◽  
Computational Time ◽  
Local Optimum ◽  
Exploration And Exploitation ◽  
High Dimensions ◽  
Swarm Optimization

Metaheuristic algorithms are often trapped in local optimum solutions when searching for solutions. This problem often occurs in optimization cases involving high dimensions such as data clustering. Imbalance of the exploration and exploitation process is the cause of this condition because search agents are not able to reach the best solution in the search space. In this study, the problem is overcome by modifying the solution update mechanism so that a search agent not only follows another randomly chosen search agent, but also has the opportunity to follow the best search agent. In addition, the balance of exploration and exploitation is also enhanced by the mechanism of updating the awareness probability of each search agent in accordance with their respective abilities in searching for solutions. The improve mechanism makes the proposed algorithm obtain pretty good solutions with smaller computational time compared to Genetic Algorithm and Particle Swarm Optimization. In large datasets, it is proven that the proposed algorithm is able to provide the best solution among the other algorithms.

A Darwinian Differential Evolution Algorithm for Multilevel Image Thresholding

2021 ◽  
pp. 2150012
Author(s):  
Ehsan ehsaeyan ◽  
Alireza Zolghadrasli
Keyword(s):  
Image Segmentation ◽  
Differential Evolution ◽  
Differential Evolution Algorithm ◽  
Search Space ◽  
Metaheuristic Algorithms ◽  
Computational Time ◽  
Energy Curve ◽  
Multilevel Thresholding ◽  
De Algorithm ◽  
Thresholding Algorithm

Image segmentation is a prime operation to understand the content of images. Multilevel thresholding is applied in image segmentation because of its speed and accuracy. In this paper, a novel multilevel thresholding algorithm based on differential evolution (DE) search is introduced. One of the major drawbacks of metaheuristic algorithms is the stagnation phenomenon which leads to falling into local optimums and premature convergence. To overcome this shortcoming, the idea of Darwinian theory is incorporated with DE algorithm to increase the diversity and quality of the individuals without decreasing the convergence speed of DE algorithm. A policy of encouragement and punishment is considered to lead searching agents in the search space and reduce the computational time. The algorithm is implemented based on dividing the population into specified groups and each group tries to find a better location. Ten test images are selected to verify the ability of our algorithm using the famous energy curve method. Kapur entropy and Type 2 fuzzy entropy are employed to evaluate the capability of the introduced algorithm. Nine different metaheuristic algorithms with Darwinian modes are also implemented and compared with our method. Experimental results manifest that the proposed method is a powerful tool for multilevel thresholding and the obtained results outperform the DE algorithm and other methods.

scholarly journals Avoiding and Escaping Depressions in Real-Time Heuristic Search

2012 ◽  
Vol 43 ◽  
pp. 523-570 ◽  
Author(s):  
C. Hernandez ◽  
J. A. Baier
Keyword(s):  
Real Time ◽  
Heuristic Search ◽  
Search Algorithm ◽  
Search Space ◽  
Search Algorithms ◽  
Search Spaces ◽  
Heuristic Search Algorithms ◽  
Order Of Magnitude ◽  
Improved Performance ◽  
Hard Real Time

Heuristics used for solving hard real-time search problems have regions with depressions. Such regions are bounded areas of the search space in which the heuristic function is inaccurate compared to the actual cost to reach a solution. Early real-time search algorithms, like LRTA*, easily become trapped in those regions since the heuristic values of their states may need to be updated multiple times, which results in costly solutions. State-of-the-art real-time search algorithms, like LSS-LRTA* or LRTA*(k), improve LRTA*'s mechanism to update the heuristic, resulting in improved performance. Those algorithms, however, do not guide search towards avoiding depressed regions. This paper presents depression avoidance, a simple real-time search principle to guide search towards avoiding states that have been marked as part of a heuristic depression. We propose two ways in which depression avoidance can be implemented: mark-and-avoid and move-to-border. We implement these strategies on top of LSS-LRTA* and RTAA*, producing 4 new real-time heuristic search algorithms: aLSS-LRTA*, daLSS-LRTA*, aRTAA*, and daRTAA*. When the objective is to find a single solution by running the real-time search algorithm once, we show that daLSS-LRTA* and daRTAA* outperform their predecessors sometimes by one order of magnitude. Of the four new algorithms, daRTAA* produces the best solutions given a fixed deadline on the average time allowed per planning episode. We prove all our algorithms have good theoretical properties: in finite search spaces, they find a solution if one exists, and converge to an optimal after a number of trials.

Sign in / Sign up

Export Citation Format

Share Document