Fuzzy entropy based on differential evolution for breast gland segmentation

IDEFE algorithm: IDE algorithm optimizes the fuzzy entropy for the gland segmentation

Breast cancer occurs in the epithelial tissue of the gland, so the accuracy of gland segmentation is crucial to the physician's diagnosis. An innovative technique for breast mammography image gland segmentation is put forth in this paper. In the first step, the algorithm designed the gland segmentation evaluation function. Then a new mutation strategy is established, and the adaptive controlled variables are used to balance the ability of improved differential evolution (IDE) in terms of investigation and convergence. To evaluate its performance, The proposed method is validated on a number of benchmark breast images, including four types of glands from the Quanzhou First Hospital, Fujian, China. Furthermore, the proposed algorithm is been systematically compared to five state-of-the-art algorithms. From the average MSSIM and boxplot, the evidence suggests that the mutation strategy may be effective in searching the topography of the segmented gland problem. The experiment results demonstrated that the proposed method has the best gland segmentation results compared to other algorithms.

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

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.

A Darwinian Differential Evolution Algorithm for Multilevel Image Thresholding

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.