Multilevel Image Thresholding Based on Improved Expectation Maximization (EM) and Differential Evolution Algorithm

Author(s):  
Ehsan Ehsaeyan ◽  
Alireza Zolghadrasli

Multilevel image thresholding is an essential step in the image segmentation process. Expectation Maximization (EM) is a powerful technique to find thresholds but is sensitive to the initial points. Differential Evolution (DE) is a robust metaheuristic algorithm that can find thresholds rapidly. However, it may be trapped in the local optimums and premature convergence occurs. In this paper, we incorporate EM algorithm to DE and introduce a novel algorithm called EM+DE which overcomes these shortages and can segment images better than EM and DE algorithms. In the proposed method, EM estimates Gaussian Mixture Model (GMM) coefficients of the histogram and DE tries to provide good volunteer solutions to EM algorithm when EM converges in local areas. Finally, DE fits GMM parameters based on Root Mean Square Error (RMSE) to reach the fittest curve. Ten standard test images and six famous metaheuristic algorithms are considered and result on global fitness. PSNR, SSIM, FSIM criteria and the computational time are given. The experimental results prove that the proposed algorithm outperforms the EM and DE as well as EM+ other natural-inspired algorithms in terms of segmentation criteria.

2002 ◽  
Vol 11 (04) ◽  
pp. 531-552 ◽  
Author(s):  
H. A. ABBASS ◽  
R. SARKER

The use of evolutionary algorithms (EAs) to solve problems with multiple objectives (known as Vector Optimization Problems (VOPs)) has attracted much attention recently. Being population based approaches, EAs offer a means to find a group of pareto-optimal solutions in a single run. Differential Evolution (DE) is an EA that was developed to handle optimization problems over continuous domains. The objective of this paper is to introduce a novel Pareto Differential Evolution (PDE) algorithm to solve VOPs. The solutions provided by the proposed algorithm for five standard test problems, is competitive to nine known evolutionary multiobjective algorithms for solving VOPs.


2014 ◽  
Vol 598 ◽  
pp. 418-423 ◽  
Author(s):  
Xiao Hong Qiu ◽  
Bo Li ◽  
Zhi Yong Cui ◽  
Jing Li

To get better solution by improving the mutation strategy of Differential Evolution algorithm, a fractal mutation strategy is introduced. The fractal mutation factor of the proposed Fractal Mutation factor Differential Evolution (FMDE) algorithm is simulated by fractal Brownian motion with a different Hurst index. The new algorithm is test on 25 benchmark functions presented at 2005 IEEE Congress on Evolutionary Computation (CEC2005). The optimization results of at least 10 benchmark functions are significantly better than the results obtained by JADE and CoDE, and most of the rest of the test results are approximate. This shows that FMDE can significantly improve the accuracy and adaptability to solve optimization problems.


2011 ◽  
Vol 181-182 ◽  
pp. 594-598
Author(s):  
Dong Xiao Niu ◽  
Jian Jun Wang ◽  
Li Li

Middle-long load forecasting is an important issue for power system’s plan, investment and operation. In this paper, differential evolution algorithm is used to determine the weights of the Combined load forecasting models, which is combined with several single middle-long forecasting models. The experiment results point out that the proposed model’s performance is better than any single forecasting model. It also shows that differential evolution algorithm can choose the weights of combined forecasting model effectually.


Author(s):  
Karn Moonsri ◽  
Kanchana Sethanan ◽  
Kongkidakhon Worasan

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.


2012 ◽  
Vol 727-728 ◽  
pp. 1854-1859
Author(s):  
Marcelo N. Sousa ◽  
Fran S. Lobato ◽  
Ricardo A. Malagoni

Modern engineering problems are often composed by a large number of variables that must be chosen simultaneously for better design performance. The optimization of phenomenological model is an impossible task in terms of computational time. To improve this disadvantage, the Response Surface Methodology (RSM), defined as a collection of mathematical and statistical methods that are used to develop, to improve, or to optimize a product or process, is configured as important alternative to model real process. In the literature, different approaches based on optimization methods have been proposed to design system engineering. In this context, the Differential Evolution algorithm (DE) is a stochastic optimization method that is based on vector operations to improve a candidate solution with regard to a given measure of quality. For illustration purposes, in the present contribution the DE is applied to optimize multiple correlated responses in a turning process. As a case study, the turning process of the AISI 52100 hardened steel is examined considering three input factors: cutting speed, feed rate and depth of cut. The outputs considered were: the mixed ceramic tool life, processing cost per piece, cutting time, the total turning cycle time, surface roughness and the material removing rate. The optimization of cutting speed, feed rate and depth of cut indicate the better configuration of process to minimize the cost.


2018 ◽  
Vol 27 (06) ◽  
pp. 1850028
Author(s):  
Zhen Zhu ◽  
Long Chen ◽  
Changgao Xia ◽  
Chaochun Yuan

This paper presents a novel differential evolution algorithm to solve dynamic optimization problems. In the proposed algorithm, the entire population is composed of several subpopulations, which are evolved independently and excluded each other by a predefined Euclidian-distance. In each subpopulation, the “DE/best/1” mutation operator is employed to generate a mutant individual in this paper. In order to fully exploit the newly generated individual, the selection operator was extended, in which the newly generated trial vector competed with the worst individual if this trial vector was worse than the target vector in terms of the fitness. Meanwhile, this trial vector was stored as the historical information, if it was better than the worst individual. When the environmental change was detected, some of the stored solutions were retrieved and expected to guide the reinitialized solutions to track the new location of the global optimum as soon as possible. The proposed algorithm was compared with several state-of-the-art dynamic evolutionary algorithms over the representative benchmark instances. The experimental results show that the proposed algorithm outperforms the competitors.


Sign in / Sign up

Export Citation Format

Share Document