A comparative study of nature inspired optimization algorithms on multilevel thresholding image segmentation

In this paper, five successful nature inspired algorithms; the artificial tree algorithm (AT), the particle swarm optimization (PSO), the genetic algorithm (GA), the cultural algorithm (CA), and the cuckoo search algorithm (CS) have been compared on multilevel image thresholding. The segmentation process is based on the Levine and Nazif intra class uniformity criterion which is seen as an optimization problem. The comparison performances are in terms of the value of the objectif function, the peak signal to noise ratio (PSNR) and the computation time. Empirical results over different benchmark images for different threshold numbers reveal the robustness, the reliability and the rapidity of the cultural algorithm (CA).

     

Modified thermal exchange optimization based multilevel thresholding for color image segmentation

Multimedia Tools and Applications - This paper proposes a multi-threshold image segmentation method based on modified thermal exchange optimization (TEO). Although it is efficient and gives...     

A novel local contrast fusion-based fuzzy model for color image multilevel thresholding using grasshopper optimization

The segmentation process is considered the significant step of an image processing system due to its extreme inspiration on the subsequent image analysis. Out of various approaches, thresholding is one of the most popular schemes for image segmentation. In segmentation, image pixels are arranged in various regions based on their intensity levels. In this paper, a straightforward and efficient fusion-based fuzzy model for multilevel color image segmentation using grasshopper optimization algorithm (GOA) has been proposed. Thresholding based segmentation lacks accuracy in segmenting the ambiguous images due to their complex characteristics, uncertainties and inherent fuzziness. However, the fuzzy entropy resolves these problems, but it is unable for segmenting at higher levels and also the complexity level for selecting suitable thresholds is high. The selection of metaheuristic GOA reduces this problem by selecting optimal threshold values. Therefore, to increase the quality of the segmented image, a simple and effective multilevel thresholding method is exploited by using the concept of fusion which is based on the local contrast. Experimental outputs demonstrate that fusion-based multilevel thresholding is better than most specific segmentation methods and can be validated by comparing the different numerical parameters. Experiments on standard daily-life color and satellite images are conducted to prove the effectiveness of the proposed scheme.     

A novel context sensitive multilevel thresholding for image segmentation

Most of the traditional histogram-based thresholding techniques are effective for bi-level thresholding and unable to consider spatial contextual information of the image for selecting optimal threshold. In this article a novel thresholding technique is presented by proposing an energy function to generate the energy curve of an image by taking into an account the spatial contextual information of the image. The behavior of this energy curve is very much similar to the histogram of the image. To incorporate spatial contextual information of the image for threshold selection process, this energy curve is used as an input of our technique instead of histogram. Moreover, to mitigate multilevel thresholding problem the properties of genetic algorithm are exploited. The proposed algorithm is evaluated on the number of different types of images using a validity measure. The results of the proposed technique are compared with those obtained by using histogram of the image and also with an existing genetic algorithm based context sensitive technique. The comparisons confirmed the effectiveness of the proposed technique.     

A comparison of nature inspired algorithms for multi-threshold image segmentation

In the field of image analysis, segmentation is one of the most important preprocessing steps. One way to achieve segmentation is by mean of threshold selection, where each pixel that belongs to a determined class is labeled according to the selected threshold, giving as a result pixel groups that share visual characteristics in the image. Several methods have been proposed in order to solve threshold selection problems; in this work, it is used the method based on the mixture of Gaussian functions to approximate the 1D histogram of a gray level image and whose parameters are calculated using three nature inspired algorithms (Particle Swarm Optimization, Artificial Bee Colony Optimization and Differential Evolution). Each Gaussian function approximates the histogram, representing a pixel class and therefore a threshold point. Experimental results are shown, comparing in quantitative and qualitative fashion as well as the main advantages and drawbacks of each algorithm, applied to multi-threshold problem.     

Masi entropy based multilevel thresholding for image segmentation

Multimedia Tools and Applications - A new multilevel thresholding based image segmentation technique is developed which utilizes Masi entropy as an objective function. Thresholding is an important...     

Image segmentation using multilevel thresholding based on modified bird mating optimization

Multimedia Tools and Applications - Multilevel thresholding using Otsu or Kapur methods is widely used in the context of image segmentation. These methods select optimal thresholds in gray level...     

A hybrid bio-inspired learning algorithm for image segmentation using multilevel thresholding

Multimedia Tools and Applications - In the field of image analysis, segmentation is one of the most important preprocessing steps. One way to achieve segmentation is the use of threshold selection,...     

A two-dimensional multilevel thresholding method for image segmentation

In this work, we develop a two-dimensional multilevel thresholding technique based on Rényi and Tsallis entropies. The formulation of the proposed method gives rise to an NP-hard combinatorial optimization problem. In order to solve efficiently this problem, two leading evolutionary algorithms, namely the quantum genetic algorithm (QGA) and the differential evolution (DE) have been employed and compared. The effectiveness of both the proposed method and the optimizers was demonstrated on a sample of real-world and synthetic images showing different types of gray-level distributions. Moreover, the contribution of the two-dimensional histogram to the segmentation quality has been highlighted on some images corrupted by noise and containing shadow or reflection effects. Experimental results demonstrated, first, that DE is less time consuming than QGA which is slightly more efficient on complex problems. Second, the Rényi and Tsallis entropies leads to similar image segmentation quality. Finally, we have shown that the proposed method is more appropriate than bilevel thresholding for multimodal and noisy images segmentation.     

Modified water wave optimization algorithm for underwater multilevel thresholding image segmentation

Multimedia Tools and Applications - Multilevel thresholding is a simple and important method for image segmentation in various applications that has drawn widespread attention in recent years....     

Partitioned-cooperative quantum-behaved particle swarm optimization based on multilevel thresholding applied to medical image segmentation

In this paper, in order to search the global optimum solution with a very fast convergence speed across the whole search space, we propose a partitioned and cooperative quantum-behaved particle swarm optimization (SCQPSO) algorithm. The auxiliary swarms and partitioned search space are introduced to increase the population diversity. The cooperative theory is introduced into QPSO algorithm to change the updating mode of the particles in order to guarantee that this algorithm well balances the effectiveness and simplification. Firstly, we explain how this method leads to enhanced population diversity and improved algorithm over previous strategies, and emphasize this algorithm with comparative experiments using five benchmark test functions and five shift complex functions. After that we demonstrate a reasonable application of the proposed algorithm, by showing how it can be used to optimize the parameters for OTSU image segmentation for processing medical images. The results show that the proposed SCQPSO algorithm outperforms than the other improved QPSO in terms of the quality of the solution, and performs better for solving the image segmentation than the QPSO algorithm, the sunCQPSO algorithm, the CCQPSO algorithm.     

Oppositional symbiotic organisms search optimization for multilevel thresholding of color image

Selection of optimal threshold is the most crucial issue in threshold-based segmentation. In case of color image, this task is become challenging, because conventional color image segmentation has computational complexity and also it suffers from lack of accuracy. Various techniques such as threshold based, region growing, edge detection, graph cut, pixel classification, neural network, active contour, gray level co-occurrence matrix are proposed so far for image segmentation in the literature. Out of them, threshold-based segmentation is popular for its simplicity. To address the problem of color image segmentation, we propose an enhanced version of metaheuristic optimization algorithm called Opposition based Symbiotic Organisms Search (OSOS) to solve multilevel image thresholding technique for color image segmentation by introducing opposition based learning concepts to accelerate the convergence rate and enhance the performance of standard symbiotic organisms search (SOS). The performance of the proposed OSOS based algorithm is investigated thoroughly and compared with some existing techniques like Cuckoo Search (CS), BAT algorithm (BAT), artificial bee colony (ABC) and particle swarm optimization (PSO). The comparison is made by applying the algorithm to a set of color images taken from a well-known benchmark dataset (Berkeley Segmentation Dataset (BSDS)) and some of the color images collected for the COCO dataset. It is observed from the results that the performance of the OSOS based algorithm is promising with respect to standards SOS and others in terms of the values of objective functions as well as the values of some well-defined quality metrics such as peak signal-to-noise ratio (PSNR), structure similarity index (SSIM) and feature similarity index (FSIM). The results of the proposed algorithm may encourage the scientists and engineers to apply it into pattern recognition problems.     

Modified bacterial foraging algorithm based multilevel thresholding for image segmentation

Multilevel thresholding is one of the most popular image segmentation techniques. In order to determine the thresholds, most methods use the histogram of the image. This paper proposes multilevel thresholding for histogram-based image segmentation using modified bacterial foraging (MBF) algorithm. To improve the global searching ability and convergence speed of the bacterial foraging algorithm, the best bacteria among all the chemotactic steps are passed to the subsequent generations. The optimal thresholds are found by maximizing Kapur's (entropy criterion) and Otsu's (between-class variance) thresholding functions using MBF algorithm. The superiority of the proposed algorithm is demonstrated by considering fourteen benchmark images and compared with other existing approaches namely bacterial foraging (BF) algorithm, particle swarm optimization algorithm (PSO) and genetic algorithm (GA). The findings affirmed the robustness, fast convergence and proficiency of the proposed MBF over other existing techniques. Experimental results show that the Otsu based optimization method converges quickly as compared with Kapur's method.     

Human mental search-based multilevel thresholding for image segmentation

Multilevel thresholding is one of the principal methods of image segmentation. These methods enjoy image histogram for segmentation. The quality of segmentation depends on the value of the selected thresholds. Since an exhaustive search is made for finding the optimum value of the objective function, the conventional methods of multilevel thresholding are time-consuming computationally, especially when the number of thresholds increases. Use of evolutionary algorithms has attracted a lot of attention under such circumstances. Human mental search algorithm is a population-based evolutionary algorithm inspired by the manner of human mental search in online auctions. This algorithm has three interesting operators: (1) clustering for finding the promising areas, (2) mental search for exploring the surrounding of every solution using Levy distribution, and (3) moving the solutions toward the promising area. In the present study, multilevel thresholding is proposed for image segmentation using human mental search algorithm. Kapur (entropy) and Otsu (between-class variance) criteria were used for this purpose. The advantages of the proposed method are described using twelve images and in comparison with other existing approaches, including genetic algorithm, particle swarm optimization, differential evolution, firefly algorithm, bat algorithm, gravitational search algorithm, and teaching-learning-based optimization. The obtained results indicated that the proposed method is highly efficient in multilevel image thresholding in terms of objective function value, peak signal to noise, structural similarity index, feature similarity index, and the curse of dimensionality. In addition, two nonparametric statistical tests verified the efficiency of the proposed algorithm, statistically.     

An optimal color image multilevel thresholding technique using grey-level co-occurrence matrix

Image thresholding is a process that separates particular object within an image from their background. An optimal thresholding technique can be taken as a single objective optimization task, where computation and obtaining a solution can become inefficient, especially at higher threshold levels. In this paper, a new and efficient color image multilevel thresholding approach is presented to perform image segmentation by exploiting the correlation among gray levels. The proposed method incorporates gray-level co-occurrence matrix (GLCM) and cuckoo search (CS) in order to effectively enhance the optimal multilevel thresholding of colored natural and satellite images exhibiting complex background and non-uniformities in illumination and features. The experimental results are presented in terms of mean square error (MSE), peak signal to noise ratio (PSNR), feature similarity index (FSIM), structural similarity index (SSIM), computational time (CPU time in seconds), and optimal threshold values for each primary color component at different thresholding levels for each of the test images. In addition, experiments are also conducted on the Berkeley Segmentation Dataset (BSDS300), and four performance indices of image segmentation- Probability Rand Index (PRI), Variation of Information (VoI), Global Consistency Error (GCE), and Boundary Displacement Error (BDE) are tested. To evaluate the performance of proposed algorithm, other optimization algorithm such as artificial bee colony (ABC), bacterial foraging optimization (BFO), and firefly algorithm (FA) are compared using GLCM as an objective function. Moreover, to show the effectiveness of proposed method, the results are compared to existing context sensitive multilevel segmentation techniques based on Tsalli's entropy. Experimental results showed the superiority of proposed technique in terms of better segmentation results with increased number of thresholds.     

Meta-heuristic moth swarm algorithm for multilevel thresholding image segmentation

Multimedia Tools and Applications - Multilevel thresholding is a very important image processing technique in the field of image segmentation. However, the computational complexity of determining...     

Emergent nature inspired algorithms for multi-objective optimization

Many real-world decision-making situations possess both a discrete and combinatorial structure and involve the simultaneous consideration of conflicting objectives. Problems of this kind are in general of large size and contains several objectives to be “optimized”. Although Multiple Objective Optimization is a well-established field of research, one branch, namely nature inspired metaheuristics is currently experienced a tremendous growth. Over the last few years, developments of new methodologies, methods, and techniques to deal with multi-objective large size problems in particular those with a combinatorial structure and the strong improvement on computing technologies (during and after the 80s) made possible to solve very hard problems with the help of inspired nature based metaheuristics.