A Multilevel Image Thresholding Approach Based on Crow Search Algorithm and Otsu Method

2020 ◽  
Vol 19 (02) ◽  
pp. 2050015 ◽  
Author(s):  
Forough Shahabi ◽  
Fereshteh Poorahangaryan ◽  
S. A. Edalatpanah ◽  
Homayoun Beheshti
Keyword(s):  
Image Segmentation ◽  
Firefly Algorithm ◽  
Search Algorithm ◽  
Computational Time ◽  
Metaheuristic Algorithm ◽  
Multilevel Thresholding ◽  
Swarm Optimization ◽  
Variance Minimization ◽  
Image Thresholding ◽  
Otsu Method

Image segmentation is one of the fundamental problems in the image processing, which identifies the objects and other structures in the image. One of the widely used methods for image segmentation is image thresholding that can separate pixels based on the specified thresholds. Otsu method calculates the thresholds to divide two or multiple classes based on between-class variance maximization and within-class variance minimization. However, increasing the number of thresholds, surging the computational time of the segmentation. To combat this drawback, the combination of Otsu and the evolutionary algorithm is usually beneficial. Crow Search Algorithm (CSA) is a novel, and efficient swarm-based metaheuristic algorithm that inspired from the way crows storing and retrieving food. In this paper, we proposed a hybrid method based on employing CSA and Otsu for multilevel thresholding. The obtained results compared with the combination of the Otsu method with three other evolutionary algorithms consisting of improved Particle Swarm Optimization (PSO), Firefly Algorithm (FA), and also the fuzzy version of FA. Our evaluation on the five benchmark images shows competitive/improved results both in time and uniformity.

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.

An Image Segmentation Method Based on Two-Dimensional Entropy and Chaotic Lightning Attachment Procedure Optimization Algorithm

2020 ◽  
Vol 34 (11) ◽  
pp. 2054030 ◽  
Author(s):  
Wei Liu ◽  
Shuai Yang ◽  
Zhiwei Ye ◽  
Qian Huang ◽  
Yongkun Huang
Keyword(s):  
Image Segmentation ◽  
Maximum Entropy ◽  
Optimization Algorithm ◽  
Search Algorithm ◽  
Computational Time ◽  
Two Dimensional ◽  
Threshold Segmentation ◽  
Grasshopper Optimization Algorithm ◽  
Grasshopper Optimization ◽  
Competitive Algorithms

Threshold segmentation has been widely used in recent years due to its simplicity and efficiency. The method of segmenting images by the two-dimensional maximum entropy is a species of the useful technique of threshold segmentation. However, the efficiency and stability of this technique are still not ideal and the traditional search algorithm cannot meet the needs of engineering problems. To mitigate the above problem, swarm intelligent optimization algorithms have been employed in this field for searching the optimal threshold vector. An effective technique of lightning attachment procedure optimization (LAPO) algorithm based on a two-dimensional maximum entropy criterion is offered in this paper, and besides, a chaotic strategy is embedded into LAPO to develop a new algorithm named CLAPO. In order to confirm the benefits of the method proposed in this paper, the other seven kinds of competitive algorithms, such as Ant–lion Optimizer (ALO) and Grasshopper Optimization Algorithm (GOA), are compared. Experiments are conducted on four different kinds of images and the simulation results are presented in several indexes (such as computational time, maximum fitness, average fitness, variance of fitness and other indexes) at different threshold levels for each test image. By scrutinizing the results of the experiment, the superiority of the introduced method is demonstrated, which can meet the needs of image segmentation excellently.

Performance Study of Harmony Search Algorithm for Multilevel Thresholding

2016 ◽  
Vol 25 (4) ◽  
pp. 473-513 ◽  
Author(s):  
Salima Ouadfel ◽  
Abdelmalik Taleb-Ahmed
Keyword(s):  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Computational Time ◽  
Multilevel Thresholding ◽  
Performance Study ◽  
Bacterial Foraging Optimization ◽  
Bee Colony ◽  
Fitness Value ◽  
Multiple Thresholds

AbstractThresholding is the easiest method for image segmentation. Bi-level thresholding is used to create binary images, while multilevel thresholding determines multiple thresholds, which divide the pixels into multiple regions. Most of the bi-level thresholding methods are easily extendable to multilevel thresholding. However, the computational time will increase with the increase in the number of thresholds. To solve this problem, many researchers have used different bio-inspired metaheuristics to handle the multilevel thresholding problem. In this paper, optimal thresholds for multilevel thresholding in an image are selected by maximizing three criteria: Between-class variance, Kapur and Tsallis entropy using harmony search (HS) algorithm. The HS algorithm is an evolutionary algorithm inspired from the individual improvisation process of the musicians in order to get a better harmony in jazz music. The proposed algorithm has been tested on a standard set of images from the Berkeley Segmentation Dataset. The results are then compared with that of genetic algorithm (GA), particle swarm optimization (PSO), bacterial foraging optimization (BFO), and artificial bee colony algorithm (ABC). Results have been analyzed both qualitatively and quantitatively using the fitness value and the two popular performance measures: SSIM and FSIM indices. Experimental results have validated the efficiency of the HS algorithm and its robustness against GA, PSO, and BFO algorithms. Comparison with the well-known metaheuristic ABC algorithm indicates the equal performance for all images when the number of thresholds M is equal to two, three, four, and five. Furthermore, ABC has shown to be the most stable when the dimension of the problem is too high.

Moth-Flame Optimization Algorithm Based Multilevel Thresholding for Image Segmentation

2018 ◽  
pp. 771-797
Author(s):  
Abdul Kayom Md Khairuzzaman ◽  
Saurabh Chaudhury
Keyword(s):  
Image Segmentation ◽  
Computational Complexity ◽  
Signal To Noise Ratio ◽  
Fitness Function ◽  
Multilevel Thresholding ◽  
Bacterial Foraging Optimization ◽  
Swarm Optimization ◽  
Kapur’S Entropy ◽  
Moth Flame Optimization Algorithm ◽  
Popular Image

Multilevel thresholding is a popular image segmentation technique. However, computational complexity of multilevel thresholding increases very rapidly with increasing number of thresholds. Metaheuristic algorithms are applied to reduce computational complexity of multilevel thresholding. A new method of multilevel thresholding based on Moth-Flame Optimization (MFO) algorithm is proposed in this paper. The goodness of the thresholds is evaluated using Kapur's entropy or Otsu's between class variance function. The proposed method is tested on a set of benchmark test images and the performance is compared with PSO (Particle Swarm Optimization) and BFO (Bacterial Foraging Optimization) based methods. The results are analyzed objectively using the fitness function and the Peak Signal to Noise Ratio (PSNR) values. It is found that MFO based multilevel thresholding method performs better than the PSO and BFO based methods.

Brain MR Image Multilevel Thresholding by Using Particle Swarm Optimization, Otsu Method and Anisotropic Diffusion

2019 ◽  
Vol 10 (3) ◽  
pp. 91-106
Author(s):  
Abdul Kayom Md Khairuzzaman ◽  
Saurabh Chaudhury
Keyword(s):  
Particle Swarm Optimization ◽  
Image Segmentation ◽  
Anisotropic Diffusion ◽  
Particle Swarm ◽  
Structural Similarity ◽  
Multilevel Thresholding ◽  
Bacterial Foraging Optimization ◽  
Mr Image ◽  
Swarm Optimization ◽  
Mr Image Segmentation

Multilevel thresholding is widely used in brain magnetic resonance (MR) image segmentation. In this article, a multilevel thresholding-based brain MR image segmentation technique is proposed. The image is first filtered using anisotropic diffusion. Then multilevel thresholding based on particle swarm optimization (PSO) is performed on the filtered image to get the final segmented image. Otsu function is used to select the thresholds. The proposed technique is compared with standard PSO and bacterial foraging optimization (BFO) based multilevel thresholding techniques. The objective image quality metrics such as Peak Signal to Noise Ratio (PSNR) and Mean Structural SIMilarity (MSSIM) index are used to evaluate the quality of the segmented images. The experimental results suggest that the proposed technique gives significantly better-quality image segmentation compared to the other techniques when applied to T2-weitghted brain MR images.

Multilevel Thresholding for Image Segmentation Based on Cellular Metaheuristics

2018 ◽  
Vol 9 (4) ◽  
pp. 1-32 ◽  
Author(s):  
Mohamed Abdou Bouteldja ◽  
Mohamed Baadeche ◽  
Mohamed Batouche
Keyword(s):  
Genetic Algorithm ◽  
Image Segmentation ◽  
Multilevel Thresholding ◽  
Objective Functions ◽  
Swarm Optimization ◽  
Cellular Genetic Algorithm ◽  
Kapur’S Entropy ◽  
Computationally Expensive ◽  
Segmentation Problem ◽  
Nature Inspired Metaheuristics

This article describes how multilevel thresholding image segmentation is a process used to partition an image into well separated regions. It has various applications such as object recognition, edge detection, and particle counting, etc. However, it is computationally expensive and time consuming. To alleviate these limitations, nature inspired metaheuristics are widely used to reduce the computational complexity of such problem. In this article, three cellular metaheuristics namely cellular genetic algorithm (CGA), cellular particle swarm optimization (CPSO) and cellular differential evolution (CDE) are adapted to solve the multilevel thresholding image segmentation problem. Experiments are conducted on different test images to assess the performance of the cellular algorithms in terms of efficiency, quality and stability based on the between-class variance and Kapur's entropy as objective functions. The experimental results have shown that the proposed cellular algorithms compete with and even outperform existing methods for multilevel thresholding image segmentation.

A modified firefly algorithm to maximize heat dissipation of a rectangular porous fin in heat exchangers exposed to both convective and radiative environment

2019 ◽  
Vol 233 (6) ◽  
pp. 1203-1216 ◽  
Author(s):  
Tuhin Deshamukhya ◽  
Ratnadeep Nath ◽  
Saheera Azmi Hazarika ◽  
Dipankar Bhanja ◽  
Sujit Nath
Keyword(s):  
Heat Transfer ◽  
Particle Swarm Optimization ◽  
Firefly Algorithm ◽  
Particle Swarm ◽  
Transformation Method ◽  
Differential Transformation Method ◽  
Computational Time ◽  
Swarm Optimization ◽  
Differential Transformation ◽  
Porous Fins

The current study deals with the optimization of significant parameters of aluminium and copper rectangular porous fins using firefly algorithm with reflective boundary condition. The study has been done considering convective heat transfer, in the first case, as well as combined convective and radiative modes of heat transfer, in the second case. To solve the non-linear governing equation, a semi analytical technique, differential transformation method is adopted. The results obtained by differential transformation method are validated by the numerical solution obtained by the finite difference method. The performance of firefly algorithm is evaluated by comparing with the results obtained by particle swarm optimization where it is seen that for the current set of equations, firefly algorithm took lesser number of iterations and computational time to converge than particle swarm optimization for all the cases. The analysis has been done for three different fin volumes and the effect of important variables which directly influence the heat transfer rate through porous fins has been discussed.

Sign in / Sign up

Export Citation Format

Share Document