A Survey on Evolutionary Computation for Computer Vision and Image Analysis: Past, Present, and Future Trends

Computer vision (CV) is a big and important field in artificial intelligence covering a wide range of applications. Image analysis is a major task in CV aiming to extract, analyse and understand the visual content of images. However, imagerelated tasks are very challenging due to many factors, e.g., high variations across images, high dimensionality, domain expertise requirement, and image distortions. Evolutionary computation (EC) approaches have been widely used for image analysis with significant achievement. However, there is no comprehensive survey of existing EC approaches to image analysis. To fill this gap, this paper provides a comprehensive survey covering all essential EC approaches to important image analysis tasks including edge detection, image segmentation, image feature analysis, image classification, object detection, and others. This survey aims to provide a better understanding of evolutionary computer vision (ECV) by discussing the contributions of different approaches and exploring how and why EC is used for CV and image analysis. The applications, challenges, issues, and trends associated to this research field are also discussed and summarised to provide further guidelines and opportunities for future research

A Study on RGB Image Multi-Thresholding using Kapur/Tsallis Entropy and Moth-Flame Algorithm

In the literature, a considerable number of image processing and evaluation procedures are proposed and implemented in various domains due to their practical importance. Thresholding is one of the pre-processing techniques, widely implemented to enhance the information in a class of gray/RGB class pictures. The thresholding helps to enhance the image by grouping the similar pixels based on the chosen thresholds. In this research, an entropy assisted threshold is implemented for the benchmark RGB images. The aim of this work is to examine the thresholding performance of well-known entropy functions, such as Kapur’s and Tsallis for a chosen image threshold. This work employs a Moth-Flame-Optimization (MFO) algorithm to support the automatic identification of the finest threshold (Th) on the benchmark RGB image for a chosen threshold value (Th=2,3,4,5). After getting the threshold image, a comparison is performed against its original picture and the necessary Picture-Quality-Values (PQV) is computed to confirm the merit of the proposed work. The experimental investigation is demonstrated using benchmark images with various dimensions and the outcome of this study confirms that the MFO helps to get a satisfactory result compared to the other heuristic algorithms considered in this study

A Multilevel Image Thresholding Based on Hybrid Jaya Algorithm and Simulated Annealing

Thresholding is a method for region-based image segmentation, which is important in image processing applications such as object recognition Multilevel. Thresholding is used to find multiple threshold values. Image segmentation plays a significant role in image analysis and pattern recognition. While threshold techniques traditionally are quite well for bi-level thresholding algorithms, multilevel thresholding for color images may have too much processing complexity. Swarm intelligence methods are frequently employed to minimize the complexity of constrained optimization problems applicable to multilevel thresholding and segmentation of color (RGB) images; In this paper, the hybrid Jaya algorithm with the SA algorithm was proposed to solve the problem of computational complexity in multilevel thresholding. This work uses Otsu method, Kapur entropy and Tsallis method as techniques to find optimal values of thresholds at different levels of color images as the target Tasks Experiments were performed on 5 standardized color images and 3 grayscale images as far as optimal threshold values are concerned, Statistical methods were used to measure the performance of the threshold methods and to select the better threshold, namely, PSNR (Peak Signal to Noise Ratio), MSE (Mean Square Error), SSIM (Structural Similarity Index), FSIM (Feature Similarity Index) and values of objective at many levels. The experimental results indicate that the presenter's Jaya and Simulated Annealing (JSA) method is better than other methods for segmenting color (RGB) images with multiple threshold levels. On the other hand, the Tsallis entropy of the cascade was found to be more robust and accurate in segmenting color images at multiple levels

Image multi-level-thresholding with Mayfly optimization

Image thresholding is a well approved pre-processing methodology and enhancing the image information based on a chosen threshold is always preferred. This research implements the mayfly optimization algorithm (MOA) based image multi-level-thresholding on a class of benchmark images of dimension 512x512x1. The MOA is a novel methodology with the algorithm phases, such as; i) Initialization, ii) Exploration with male-mayfly (MM), iii) Exploration with female-mayfly (FM), iv) Offspring generation and, v) Termination. This algorithm implements a strict two-step search procedure, in which every Mayfly is forced to attain the global best solution. The proposed research considers the threshold value from 2 to 5 and the superiority of the result is confirmed by computing the essential Image quality measures (IQM). The performance of MOA is also compared and validated against the other procedures, such as particle-swarm-optimization (PSO), bacterial foraging optimization(BFO), firefly-algorithm(FA), bat algorithm (BA), cuckoo search(CS) and moth-flame optimization (MFO) and the attained p-value of Wilcoxon rank test confirmed the superiority of the MOA compared with other algorithms considered in this wor

ROBUST AND PARALLEL SEGMENTATION MODEL (RPSM) FOR EARLY DETECTION OF SKIN CANCER DISEASE USING HETEROGENEOUS DISTRIBUTIONS

Melanoma is the most common dangerous type of skin cancer; however, it is preventable if it is diagnosed early. Diagnosis of Melanoma would be improved if an accurate skin image segmentation model is available. Many computer vision methods have been investigated, yet the problem of finding a consistent and robust model that extracts the best threshold value, persists. This paper suggests a novel image segmentation approach using a multilevel cross entropy thresholding algorithm based on heterogeneous distributions. The proposed strategy searches the problem space by segmenting the image into several levels, and applying for each level one of the three benchmark distributions, including Gaussian, Lognormal or Gamma, which are combined to estimate the best thresholds that optimally extract the segmented regions. The classical technique of Minimum Cross Entropy Thresholding (MCET) is considered as the objective function for the applied method. Furthermore, a parallel processing algorithm is suggested to minimize the computational time of the proposed segmentation model in order to boost its performance. The efficiency of the proposed RPSM model is evaluated based on two datasets for skin cancer images: The International Skin Imaging Collaboration (ISIC) and Planet Hunters 2 (PH2). In conclusion, the proposed RPSM model shows a significant reduced processing time and reveals better accuracy and stable results, compared to other segmentation models. Design/methodology – The proposed model estimates two optimum threshold values that lead to extract optimally three segmented regions by combining the three benchmark statistical distributions: Gamma, Gaussian and lognormal. Outcomes – Based on the experimental results, the suggested segmentation methodology using MCET, could be nominated as a robust, precise and extremely reliable model with high efficiency. Novelty/utility –A novel multilevel segmentation model is developed using MCET technique and based on a combination of three statistical distributions: Gamma, Gaussian, and Lognormal. Moreover, this model is boosted by a parallelized method to reduce the processing time of the segmentation. Therefore, the suggested model should be considered as a precious mechanism in skin cancer disease detection

Enhancement of Historical Printed Document Images by Combining Total Variation Regularization and Non-Local Means Filtering

This paper proposes a novel method for document enhancement which combines two recent powerful noise-reduction steps. The first step is based on the total variation framework. It flattens background grey-levels and produces an intermediate image where background noise is considerably reduced. This image is used as a mask to produce an image with a cleaner background while keeping character details. The second step is applied to the cleaner image and consists of a filter based on non-local means: character edges are smoothed by searching for similar patch images in pixel neighborhoods. The document images to be enhanced are real historical printed documents from several periods which include several defects in their background and on character edges. These defects result from scanning, paper aging and bleed- through. The proposed method enhances document images by combining the total variation and the non-local means techniques in order to improve OCR recognition. The method is shown to be more powerful than when these techniques are used alone and than other enhancement methods

Automatic Segmentation of Cells of Different Types in Fluorescence Microscopy Images

Recognition of different cell compartments, types of cells, and their interactions is a critical aspect of quantitative cell biology. This provides a valuable insight for understanding cellular and subcellular interactions and mechanisms of biological processes, such as cancer cell dissemination, organ development and wound healing. Quantitative analysis of cell images is also the mainstay of numerous clinical diagnostic and grading procedures, for example in cancer, immunological, infectious, heart and lung disease. Computer automation of cellular biological samples quantification requires segmenting different cellular and sub-cellular structures in microscopy images. However, automating this problem has proven to be non-trivial, and requires solving multi-class image segmentation tasks that are challenging owing to the high similarity of objects from different classes and irregularly shaped structures. This thesis focuses on the development and application of probabilistic graphical models to multi-class cell segmentation. Graphical models can improve the segmentation accuracy by their ability to exploit prior knowledge and model inter-class dependencies. Directed acyclic graphs, such as trees have been widely used to model top-down statistical dependencies as a prior for improved image segmentation. However, using trees, a few inter-class constraints can be captured. To overcome this limitation, polytree graphical models are proposed in this thesis that capture label proximity relations more naturally compared to tree-based approaches. Polytrees can effectively impose the prior knowledge on the inclusion of different classes by capturing both same-level and across-level dependencies. A novel recursive mechanism based on two-pass message passing is developed to efficiently calculate closed form posteriors of graph nodes on polytrees. Furthermore, since an accurate and sufficiently large ground truth is not always available for training segmentation algorithms, a weakly supervised framework is developed to employ polytrees for multi-class segmentation that reduces the need for training with the aid of modeling the prior knowledge during segmentation. Generating a hierarchical graph for the superpixels in the image, labels of nodes are inferred through a novel efficient message-passing algorithm and the model parameters are optimized with Expectation Maximization (EM). Results of evaluation on the segmentation of simulated data and multiple publicly available fluorescence microscopy datasets indicate the outperformance of the proposed method compared to state-of-the-art. The proposed method has also been assessed in predicting the possible segmentation error and has been shown to outperform trees. This can pave the way to calculate uncertainty measures on the resulting segmentation and guide subsequent segmentation refinement, which can be useful in the development of an interactive segmentation framework