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.

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 Novel Enhanced Differential Evolution Algorithm for Outbound Logistics of the Poultry Industry in Thailand

2022 ◽  
Vol 8 (1) ◽  
pp. 15
Author(s):  
Karn Moonsri ◽  
Kanchana Sethanan ◽  
Kongkidakhon Worasan
Keyword(s):  
Differential Evolution ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Transportation Cost ◽  
Mixed Integer ◽  
Computational Time ◽  
Poultry Industry ◽  
Routing Problem ◽  
De Algorithm ◽  
Evolution Algorithm

Outbound logistics is a crucial field of logistics management. This study considers a planning distribution for the poultry industry in Thailand. The goal of the study is to minimize the transportation cost for the multi-depot vehicle-routing problem (MDVRP). A novel enhanced differential evolution algorithm (RI-DE) is developed based on a new re-initialization mutation formula and a local search function. A mixed-integer programming formulation is presented in order to measure the performance of a heuristic with GA, PSO, and DE for small-sized instances. For large-sized instances, RI-DE is compared to the traditional DE algorithm for solving the MDVRP using published benchmark instances. The results demonstrate that RI-DE obtained a near-optimal solution of 99.03% and outperformed the traditional DE algorithm with a 2.53% relative improvement, not only in terms of solution performance, but also in terms of computational time.

scholarly journals Dragonfly Algorithm with Opposition-Based Learning for Multilevel Thresholding Color Image Segmentation

Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 716 ◽  
Author(s):  
Xiaoli Bao ◽  
Heming Jia ◽  
Chunbo Lang
Keyword(s):  
Image Segmentation ◽  
Heuristic Algorithms ◽  
Color Image ◽  
Similarity Index ◽  
Search Space ◽  
Color Image Segmentation ◽  
Computational Time ◽  
Multilevel Thresholding ◽  
Dragonfly Algorithm ◽  
Opposition Based Learning

Multilevel thresholding is a very active research field in image segmentation, and has been successfully used in various applications. However, the computational time will increase exponentially as the number of thresholds increases, and for color images which contain more information this is even worse. To overcome the drawback while maintaining segmentation accuracy, a modified version of dragonfly algorithm (DA) with opposition-based learning (OBLDA) for color image segmentation is proposed in this paper. The opposition-based learning (OBL) strategy simultaneously considers the current solution and the opposite solution, which are symmetrical in the search space. With the introduction of OBL, the proposed algorithm has a faster convergence speed and more balanced exploration–exploitation compared with the original DA. In order to clearly demonstrate the outstanding performance of the OBLDA, the proposed method is compared with seven state-of-the-art meta-heuristic algorithms, through experiments on 10 test images. The optimal threshold values are calculated by the maximization of between-class variance and Kapur’s entropy. Meanwhile, some indicators, including peak signal to noise ratio (PSNR), feature similarity index (FSIM), structure similarity index (SSIM), the average fitness values, standard deviation (STD), and computation time are used as evaluation criteria in the experiments. The promising results reveal that proposed method has the advantages of high accuracy and remarkable stability. Wilcoxon’s rank sum test and Friedman test are also performed to verify the superiority of OBLDA in a statistical way. Furthermore, various satellite images are also included for robustness testing. In conclusion, the OBLDA algorithm is a feasible and effective method for multilevel thresholding color image segmentation.

scholarly journals Research on the inverse kinematics of manipulator using an improved self-adaptive mutation differential evolution algorithm

2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110144
Author(s):  
Qianqian Zhang ◽  
Daqing Wang ◽  
Lifu Gao
Keyword(s):  
Differential Evolution ◽  
Objective Function ◽  
Inverse Kinematics ◽  
Differential Evolution Algorithm ◽  
Weight Coefficient ◽  
Adaptive Mutation ◽  
Feasible Region ◽  
Serial Manipulators ◽  
De Algorithm ◽  
Self Adaptive

To assess the inverse kinematics (IK) of multiple degree-of-freedom (DOF) serial manipulators, this article proposes a method for solving the IK of manipulators using an improved self-adaptive mutation differential evolution (DE) algorithm. First, based on the self-adaptive DE algorithm, a new adaptive mutation operator and adaptive scaling factor are proposed to change the control parameters and differential strategy of the DE algorithm. Then, an error-related weight coefficient of the objective function is proposed to balance the weight of the position error and orientation error in the objective function. Finally, the proposed method is verified by the benchmark function, the 6-DOF and 7-DOF serial manipulator model. Experimental results show that the improvement of the algorithm and improved objective function can significantly improve the accuracy of the IK. For the specified points and random points in the feasible region, the proportion of accuracy meeting the specified requirements is increased by 22.5% and 28.7%, respectively.

USING AN IMPROVED BEE MEMORY DIFFERENTIAL EVOLUTION ALGORITHM FOR PARAMETER ESTIMATION TO SIMULATE BIOCHEMICAL PATHWAYS

2014 ◽  
Vol 22 (01) ◽  
pp. 101-121 ◽  
Author(s):  
CHUII KHIM CHONG ◽  
MOHD SABERI MOHAMAD ◽  
SAFAAI DERIS ◽  
MOHD SHAHIR SHAMSIR ◽  
LIAN EN CHAI ◽  
...  
Keyword(s):  
Differential Evolution ◽  
Differential Evolution Algorithm ◽  
Estimation Algorithm ◽  
Convergence Time ◽  
Unknown Parameters ◽  
Estimation Algorithms ◽  
Bee Colony ◽  
De Algorithm ◽  
Cell Cycle Pathway ◽  
Parameter Values

When analyzing a metabolic pathway in a mathematical model, it is important that the essential parameters are estimated correctly. However, this process often faces few problems like when the number of unknown parameters increase, trapping of data in the local minima, repeated exposure to bad results during the search process and occurrence of noisy data. Thus, this paper intends to present an improved bee memory differential evolution (IBMDE) algorithm to solve the mentioned problems. This is a hybrid algorithm that combines the differential evolution (DE) algorithm, the Kalman filter, artificial bee colony (ABC) algorithm, and a memory feature. The aspartate and threonine biosynthesis pathway, and cell cycle pathway are the metabolic pathways used in this paper. For three production simulation pathways, the IBMDE managed to robustly produce the estimated optimal kinetic parameter values with significantly reduced errors. Besides, it also demonstrated faster convergence time compared to the Nelder–Mead (NM), simulated annealing (SA), the genetic algorithm (GA) and DE, respectively. Most importantly, the kinetic parameters that were generated by the IBMDE have improved the production rates of desired metabolites better than other estimation algorithms. Meanwhile, the results proved that the IBMDE is a reliable estimation algorithm.

scholarly journals Differential Evolution with Population and Strategy Parameter Adaptation

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
V. Gonuguntla ◽  
R. Mallipeddi ◽  
Kalyana C. Veluvolu
Keyword(s):  
Differential Evolution ◽  
Population Size ◽  
Optimization Problems ◽  
Search Space ◽  
Benchmark Problems ◽  
Parameter Adaptation ◽  
De Algorithm ◽  
Probabilistic Technique ◽  
Number Of Individuals ◽  
Strategy Parameters

Differential evolution (DE) is simple and effective in solving numerous real-world global optimization problems. However, its effectiveness critically depends on the appropriate setting of population size and strategy parameters. Therefore, to obtain optimal performance the time-consuming preliminary tuning of parameters is needed. Recently, different strategy parameter adaptation techniques, which can automatically update the parameters to appropriate values to suit the characteristics of optimization problems, have been proposed. However, most of the works do not control the adaptation of the population size. In addition, they try to adapt each strategy parameters individually but do not take into account the interaction between the parameters that are being adapted. In this paper, we introduce a DE algorithm where both strategy parameters are self-adapted taking into account the parameter dependencies by means of a multivariate probabilistic technique based on Gaussian Adaptation working on the parameter space. In addition, the proposed DE algorithm starts by sampling a huge number of sample solutions in the search space and in each generation a constant number of individuals from huge sample set are adaptively selected to form the population that evolves. The proposed algorithm is evaluated on 14 benchmark problems of CEC 2005 with different dimensionality.

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.

scholarly journals Optimization Of Raw Material Inventory Costs In The Food Supply Chain Using Differential Evolution Algorithm

2018 ◽  
Vol 73 ◽  
pp. 13016
Author(s):  
Mara Huriga Priymasiwi ◽  
Mustafid
Keyword(s):  
Supply Chain ◽  
Differential Evolution ◽  
Food Industry ◽  
Differential Evolution Algorithm ◽  
Optimization Method ◽  
Raw Material ◽  
Inventory Cost ◽  
De Algorithm ◽  
Material Requirement ◽  
Total Inventory

The management of raw material inventory is used to overcome the problems occuring especially in the food industry to achieve effectiveness, timeliness, and high service levels which are contrary to the problem of effectiveness and cost efficiency. The inventory control system is built to achieve the optimization of raw material inventory cost in the supply chain in food industry. This research represents Differential Evolution (DE) algorithm as optimization method by minimizing total inventory based on amount of raw material requirement, purchasing cost, saefty stock and reorder time. With the population size, the parameters of mutation control, crossover parameters and the number of iterations respectively 80, 0.8, 0.5, 200. With the amount of safety stock at the company 7213.95 obtained a total inventory cost decrease of 39.95%. Result indicate that the use of DE algorithm help providein efficient amount, time and cost.

Differential Evolution Algorithm with Triangular Adaptive Control Parameter for SHEPWM Switching Pattern Optimization

2017 ◽  
Vol 8 (3) ◽  
pp. 1381
Author(s):  
Ismail Yusuf ◽  
Ayong Hiendro ◽  
F. Trias Pontia Wigyarianto ◽  
Kho Hie Khwee
Keyword(s):  
Adaptive Control ◽  
Differential Evolution ◽  
Control Parameter ◽  
Pulse Width Modulation ◽  
Differential Evolution Algorithm ◽  
De Algorithm ◽  
Harmonic Elimination ◽  
Switching Patterns ◽  
Convergence Process ◽  
Speed Up

Differential evolution (DE) algorithm has been applied as a powerful tool to find optimum switching angles for selective harmonic elimination pulse width modulation (SHEPWM) inverters. However, the DE’s performace is very dependent on its control parameters. Conventional DE generally uses either trial and error mechanism or tuning technique to determine appropriate values of the control paramaters. The disadvantage of this process is that it is very time comsuming. In this paper, an adaptive control parameter is proposed in order to speed up the DE algorithm in optimizing SHEPWM switching angles precisely. The proposed adaptive control parameter is proven to enhance the convergence process of the DE algorithm without requiring initial guesses. The results for both negative and positive modulation index (<em>M</em>) also indicate that the proposed adaptive DE is superior to the conventional DE in generating SHEPWM switching patterns

Sign in / Sign up

Export Citation Format

Share Document