In this paper, the analysis of recent advances in genetic algorithms is discussed. The genetic algorithms of great interest in research community are selected for analysis. This review will help the new and demanding researchers to provide the wider vision of genetic algorithms. The well-known algorithms and their implementation are presented with their pros and cons. The genetic operators and their usages are discussed with the aim of facilitating new researchers. The different research domains involved in genetic algorithms are covered. The future research directions in the area of genetic operators, fitness function and hybrid algorithms are discussed. This structured review will be helpful for research and graduate teaching.

/pdf/a-review-on-genetic-algorithm-past-present-and-future-2o5y8ru178.pdf

A review on genetic algorithm: past, present, and future

This paper completely introduces an exhaustive and a comprehensive review of the so-called salp swarm algorithm (SSA) and discussions its main characteristics. SSA is one of the efficient recent meta-heuristic optimization algorithms, where it has been successfully utilized in a wide range of optimization problems in different fields, such as machine learning, engineering design, wireless networking, image processing, and power energy. This review shows the available literature on SSA, including its variants, like binary, modifications and multi-objective. Followed by its applications, assessment and evaluation, and finally the conclusions, which focus on the current works on SSA, suggest possible future research directions.

Salp swarm algorithm: a comprehensive survey

Feature selection is a critical and prominent task in machine learning. To reduce the dimension of the feature set while maintaining the accuracy of the performance is the main aim of the feature selection problem. Various methods have been developed to classify the datasets. However, metaheuristic algorithms have achieved great attention in solving numerous optimization problem. Therefore, this paper presents an extensive literature review on solving feature selection problem using metaheuristic algorithms which are developed in the ten years (2009-2019). Further, metaheuristic algorithms have been classified into four categories based on their behaviour. Moreover, a categorical list of more than a hundred metaheuristic algorithms is presented. To solve the feature selection problem, only binary variants of metaheuristic algorithms have been reviewed and corresponding to their categories, a detailed description of them explained. The metaheuristic algorithms in solving feature selection problem are given with their binary classification, name of the classifier used, datasets and the evaluation metrics. After reviewing the papers, challenges and issues are also identified in obtaining the best feature subset using different metaheuristic algorithms. Finally, some research gaps are also highlighted for the researchers who want to pursue their research in developing or modifying metaheuristic algorithms for classification. For an application, a case study is presented in which datasets are adopted from the UCI repository and numerous metaheuristic algorithms are employed to obtain the optimal feature subset.

/pdf/metaheuristic-algorithms-on-feature-selection-a-survey-of-ilv6sofidu.pdf

Metaheuristic Algorithms on Feature Selection: A Survey of One Decade of Research (2009-2019)

Segmentation is a crucial step in image processing applications. This process separates pixels of the image into multiple classes that permits the analysis of the objects contained in the scene. Multilevel thresholding is a method that easily performs this task, the problem is to find the best set of thresholds that properly segment each image. Techniques as Otsu’s between class variance or Kapur’s entropy helps to find the best thresholds but they are computationally expensive for more than two thresholds. To overcome such problem this paper introduces the use of the novel meta-heuristic algorithm called Black Widow Optimization (BWO) to find the best threshold configuration using Otsu or Kapur as objective function. To evaluate the performance and effectiveness of the BWO-based method, it has been considered the use of a variety of benchmark images, and compared against six well-known meta-heuristic algorithms including; the Gray Wolf Optimization (GWO), Moth Flame Optimization (MFO), Whale Optimization Algorithm (WOA), Sine–Cosine Algorithm (SCA), Slap Swarm Algorithm (SSA), and Equilibrium Optimization (EO). The experimental results have revealed that the proposed BWO-based method outperform the competitor algorithms in terms of the fitness values as well as the others performance measures such as PSNR, SSIM and FSIM. The statistical analysis manifests that the BWO-based method achieves efficient and reliable results in comparison with the other methods. Therefore, BWO-based method was found to be most promising for multi-level image segmentation problem over other segmentation approaches that are currently used in the literature.

A novel Black Widow Optimization algorithm for multilevel thresholding image segmentation

Data clustering is one of important research topics of data mining. In this paper, we propose a new clustering algorithm based on ant colony optimization, called Ant Colony Optimization for Clustering (ACOC). At the core of the algorithm we use both the accumulated pheromone and the heuristic information, the distances between data objects and cluster centers of ants, to guide artificial ants to group data objects into proper clusters. This allows the algorithm to perform the clustering process more effectively and efficiently. Due to the nature of stochastic and population-based search, the ACOC can overcome the drawbacks of traditional clustering methods that easily converge to local optima. Experimental results show that the ACOC can find relatively good solutions.

An ACO-Based Clustering Algorithm

In the field of image processing, there are several problems where the efficient search has to be performed in complex search domain to find an optimal solution Image enhancement which improves the quality of an image for visual analysis and/or machine understanding is one of these problems There is no unique image enhancement technique and it’s measurement criterion which satisfies all the necessity and quantitatively judge the quality of a given image respectively Thus sometimes proper image enhancement problem becomes hard and takes large computational time In order to overcome that problem, researchers formulated the image enhancement as optimization problems and solved using Nature-Inspired Optimization Algorithms (NIOAs) which starts a new era in image enhancement field This study presents an up-to-date review over the application of NIOAs in image enhancement domain The key issues which are involved in the formulation of NIOAs based image enhancement models are also discussed here

A Survey on Nature-Inspired Optimization Algorithms and Their Application in Image Enhancement Domain

In the field of image processing, there are several problems where an efficient search of the solutions has to be performed within a complex search domain to find an optimal solution. Multi-thresholding which is a very important image segmentation technique is one of them. The multi-thresholding problem is simply an exponential combinatorial optimization process which traditionally is formulated based on complex objective function criterion which can be solved using only nondeterministic methods. Under such circumstances, there is also no unique measurement which quantitatively judges the quality of a given segmented image. Therefore, researchers are solving those issues by using Nature-Inspired Optimization Algorithms (NIOAs) as alternative methodologies for the multi-thresholding problem. This study presents an up-to-date review on all most important NIOAs employed in multi-thresholding based image segmentation domain. The key issues which are involved during the formulation of NIOAs based image multi-thresholding models are also discussed here.

Nature-Inspired Optimization Algorithms and Their Application in Multi-Thresholding Image Segmentation

In the consumer electronics field, the main challenge in image processing is to preserve the original brightness. Histogram Equalization (HE) is one of the simplest and widely used methods for contrast enhancement. However, HE does not suit into the consumer electronics field as this procedure flattens the histogram by distributing the entire gray levels uniformly. Therefore, several HE variants have been proposed based on proper histogram segmentation, histogram weighting, and range optimization techniques to overcome this flattening effect. However, sometimes these modifications become complex and computationally expensive. Recently, researchers have formulated the HE variants for image enhancement as optimization problems and solved, using Nature-Inspired Optimization Algorithms (NIOA), which starts a new era in the image enhancement field. This study presents an up-to-date review over the application of NIOAs for HE variants in image enhancement domain. The main issues which are involved in the application of NIOAs with HE are also discussed here.

Histogram Equalization Variants as Optimization Problems: A Review

Image segmentation process is one of the most interesting and challenging problems in digital image processing tasks The segmentation process involves finding similar regions within an image Many segmentation problems are achieved by the incorporation of clustering techniques One of the most common technique for clustering process is the Fuzzy C-means (FCM) algorithm However, even when FCM is one of the most popular techniques applied in image segmentation, it presents some issues such as large computational time complexity, noise sensitivity, and initial cluster centers dependency In order to solve these problems, this paper presents a Histogram Based Fuzzy Clustering (HBFC) technique using an improved version of Firefly Algorithm (FA) In the proposed approach, the FA involves three search strategies: rough set-based population, random attraction and local search mechanism Also, the clustering process is conducted based on gray level histograms instead of single pixels of an image Under such circumstances, the occurrence of misclassification of pixels is reduced A rigorous comparative study is conducted among the proposed approach and several state-of-art Nature-Inspired Optimization Algorithms (NIOAs) and traditional clustering techniques The numerical results indicate that the proposed approach outperform the well-known NIOA based clustering methods in terms of precision, robustness and quality of the segmented outputs

Randomly Attracted Rough Firefly Algorithm for histogram based fuzzy image clustering

Cancer is one of the most critical disease. In particular, Leukemia is the most common type of cancer which produces an excessive quantity of leucocytes, replacing normal blood cells. Early detection of leucocytes cells can save human life. Recently, researchers have contributed to the development of computer assisted pathology techniques to automatically detect cancer at early stage. Commonly, assisted pathology systems are based on artificial vision techniques to identify cancer cells in the human body. Blood image segmentation techniques for Leukemia have been proposed based on automatic thresholding schemes involving traditional clustering methods. However, traditional clustering methods are sensitive to initial cluster positions, where the incorrect centering values results into false positive cancer diagnosis. On the other hand, Nature-Inspired Optimization Algorithms (NIOA) are stochastic search methods for finding the optimal solution for complex multimodal functions where traditional optimization approaches are not suitable to operate. Since blood image segmentation is considered as a complex computational task, NIOA methods yield an interesting alternative to proper blood cell segmentation. In this paper, the Stochastic Fractal Search (SFS) algorithm is implemented in order to provide non-false positive segmented outcomes for Leukemia identification. In the experimental study, the proposed approach is compared against traditional clustering methods as well as some NIOAs techniques. The numerical results indicate that SFS, provide superior results in terms of accuracy, time complexity, and quality parameters.

Arunita Das

Papers

A Survey on Nature-Inspired Optimization Algorithms and Their Application in Image Enhancement Domain

Nature-Inspired Optimization Algorithms and Their Application in Multi-Thresholding Image Segmentation

Histogram Equalization Variants as Optimization Problems: A Review

Randomly Attracted Rough Firefly Algorithm for histogram based fuzzy image clustering

Acute lymphoblastic leukemia image segmentation driven by stochastic fractal search