scholarly journals Masi Entropy for Satellite Color Image Segmentation Using Tournament-Based Lévy Multiverse Optimization Algorithm

2019 ◽  
Vol 11 (8) ◽  
pp. 942 ◽  
Author(s):  
Jia ◽  
Peng ◽  
Song ◽  
Oliva ◽  
Lang ◽  
...  
Keyword(s):  
Image Segmentation ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Color Image ◽  
Fitness Function ◽  
Similarity Index ◽  
Optimal Solution ◽  
Population Diversity ◽  
Color Image Segmentation ◽  
Masi Entropy

A novel multilevel threshold segmentation method for color satellite images based on Masi entropy is proposed in this paper. Lévy multiverse optimization algorithm (LMVO) has a strong advantage over the traditional multiverse optimization algorithm (MVO) in finding the optimal solution for the segmentation in the three channels of an RGB image. As the work advancement introduces a Lévy multiverse optimization algorithm which uses tournament selection instead of roulette wheel selection, and updates some formulas in the algorithm with mutation factor. Then, the proposal is called TLMVO, and another advantage is that the population diversity of the algorithm in the latest iterations is maintained. The Masi entropy is used as an application and combined with the improved TLMVO algorithm for satellite color image segmentation. Masi entropy combines the additivity of Renyi entropy and the non-extensibility of Tsallis entropy. By increasing the number of thesholds, the quality of segmenttion becomes better, then the dimensionality of the problem also increases. Fitness function value, average CPU running time, Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index (SSIM) and Feature Similarity Index (FSIM) were used to evaluate the segmentation results. Further statistical evaluation was given by Wilcoxon's rank sum test and Friedman test. The experimental results show that the TLMVO algorithm has wide adaptability to high-dimensional optimization problems, and has obvious advantages in objective function value, image quality detection, convergence performance and robustness.

Color Image Segmentation Based on Self-Organizing Maps

2011 ◽  
Vol 214 ◽  
pp. 693-698
Author(s):  
Rui Geng
Keyword(s):  
Image Segmentation ◽  
Optimization Problems ◽  
Color Image ◽  
Optimal Solution ◽  
Implementation Process ◽  
Segmentation Algorithm ◽  
Color Image Segmentation ◽  
Combinatorial Optimization Problems ◽  
Bee Colony ◽  
Image Segmentation Algorithm

The colony intellectual behavior performed by many organisms in nature can solve various kinds of problems on scientific and technological research. Bees are a socialized insect colony, which perform different types of activities according to their different divisions of labor, and achieve information sharing and exchanges among the bee colony to find the optimal solution for problems. According to this characteristic, researchers have proposed the algorithm of bee colony for solving combinatorial optimization problems. In this paper, it will describe the implementation process of such an image segmentation algorithm, and the result shows that this method is a potential image segmentation algorithm.

scholarly journals Kapur’s Entropy for Color Image Segmentation Based on a Hybrid Whale Optimization Algorithm

Entropy ◽  
2019 ◽  
Vol 21 (3) ◽  
pp. 318 ◽  
Author(s):  
Chunbo Lang ◽  
Heming Jia
Keyword(s):  
Image Segmentation ◽  
Optimization Algorithm ◽  
Heuristic Algorithms ◽  
Color Image ◽  
Similarity Index ◽  
Whale Optimization Algorithm ◽  
Color Image Segmentation ◽  
De Algorithm ◽  
Whale Optimization ◽  
Kapur’S Entropy

In this paper, a new hybrid whale optimization algorithm (WOA) called WOA-DE is proposed to better balance the exploitation and exploration phases of optimization. Differential evolution (DE) is adopted as a local search strategy with the purpose of enhancing exploitation capability. The WOA-DE algorithm is then utilized to solve the problem of multilevel color image segmentation that can be considered as a challenging optimization task. Kapur’s entropy is used to obtain an efficient image segmentation method. In order to evaluate the performance of proposed algorithm, different images are selected for experiments, including natural images, satellite images and magnetic resonance (MR) images. The experimental results are compared with state-of-the-art meta-heuristic algorithms as well as conventional approaches. Several performance measures have been used such as average fitness values, standard deviation (STD), peak signal to noise ratio (PSNR), structural similarity index (SSIM), feature similarity index (FSIM), Wilcoxon’s rank sum test, and Friedman test. The experimental results indicate that the WOA-DE algorithm is superior to the other meta-heuristic algorithms. In addition, to show the effectiveness of the proposed technique, the Otsu method is used for comparison.

scholarly journals A Hybrid Preaching Optimization Algorithm Based on Kapur Entropy for Multilevel Thresholding Color Image Segmentation

Entropy ◽  
2021 ◽  
Vol 23 (12) ◽  
pp. 1599
Author(s):  
Bowen Wu ◽  
Liangkuan Zhu ◽  
Jun Cao ◽  
Jingyu Wang
Keyword(s):  
Image Segmentation ◽  
Time Delay ◽  
Optimization Algorithm ◽  
Color Image ◽  
Signal To Noise Ratio ◽  
Similarity Index ◽  
Structural Similarity ◽  
Color Image Segmentation ◽  
Multilevel Thresholding ◽  
Evolutionary State

Multilevel thresholding segmentation of color images plays an important role in many fields. The pivotal procedure of this technique is determining the specific threshold of the images. In this paper, a hybrid preaching optimization algorithm (HPOA) for color image segmentation is proposed. Firstly, the evolutionary state strategy is adopted to evaluate the evolutionary factors in each iteration. With the introduction of the evolutionary state, the proposed algorithm has more balanced exploration-exploitation compared with the original POA. Secondly, in order to prevent premature convergence, a randomly occurring time-delay is introduced into HPOA in a distributed manner. The expression of the time-delay is inspired by particle swarm optimization and reflects the history of previous personal optimum and global optimum. To better verify the effectiveness of the proposed method, eight well-known benchmark functions are employed to evaluate HPOA. In the interim, seven state-of-the-art algorithms are utilized to compare with HPOA in the terms of accuracy, convergence, and statistical analysis. On this basis, an excellent multilevel thresholding image segmentation method is proposed in this paper. Finally, to further illustrate the potential, experiments are respectively conducted on three different groups of Berkeley images. The quality of a segmented image is evaluated by an array of metrics including feature similarity index (FSIM), peak signal-to-noise ratio (PSNR), structural similarity index (SSIM), and Kapur entropy values. The experimental results reveal that the proposed method significantly outperforms other algorithms and has remarkable and promising performance for multilevel thresholding color image segmentation.

scholarly journals Hybrid Grasshopper Optimization Algorithm and Differential Evolution for Multilevel Satellite Image Segmentation

2019 ◽  
Vol 11 (9) ◽  
pp. 1134 ◽  
Author(s):  
Heming Jia ◽  
Chunbo Lang ◽  
Diego Oliva ◽  
Wenlong Song ◽  
Xiaoxu Peng
Keyword(s):  
Image Segmentation ◽  
Differential Evolution ◽  
Optimization Algorithm ◽  
Fitness Function ◽  
Satellite Image ◽  
Similarity Index ◽  
Image Thresholding ◽  
Grasshopper Optimization Algorithm ◽  
Significant Difference ◽  
Grasshopper Optimization

An efficient satellite image segmentation method based on a hybrid grasshopper optimization algorithm (GOA) and minimum cross entropy (MCE) is proposed in this paper. The proposal is known as GOA–jDE, and it merges GOA with self-adaptive differential evolution (jDE) to improve the search efficiency, preserving the population diversity especially in the later iterations. A series of experiments is conducted on various satellite images for evaluating the performance of the algorithm. Both low and high levels of the segmentation are taken into account, increasing the dimensionality of the problem. The proposed approach is compared with the standard color image thresholding methods, as well as the advanced satellite image thresholding techniques based on different criteria. Friedman test and Wilcoxon’s rank sum test are performed to assess the significant difference between the algorithms. The superiority of the proposed method is illustrated from different aspects, such as average fitness function value, peak signal to noise ratio (PSNR), structural similarity index (SSIM), feature similarity index (FSIM), standard deviation (STD), convergence performance, and computation time. Furthermore, natural images from the Berkeley segmentation dataset are also used to validate the strong robustness of the proposed method.

scholarly journals Multiverse Optimization Algorithm Based on Lévy Flight Improvement for Multithreshold Color Image Segmentation

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 32805-32844 ◽  
Author(s):  
Heming Jia ◽  
Xiaoxu Peng ◽  
Wenlong Song ◽  
Chunbo Lang ◽  
Zhikai Xing ◽  
...  
Keyword(s):  
Image Segmentation ◽  
Optimization Algorithm ◽  
Color Image ◽  
Color Image Segmentation ◽  
Lévy Flight ◽  
Levy Flight

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.

Sign in / Sign up

Export Citation Format

Share Document