Segmentation of images by color features: a survey

En este articulo se hace la revisión del estado del arte sobre la segmentación de imagenes de colorImage segmentation is an important stage for object recognition. Many methods have been proposed in the last few years for grayscale and color images. In this paper, we present a deep review of the state of the art on color image segmentation methods; through this paper, we explain the techniques based on edge detection, thresholding, histogram-thresholding, region, feature clustering and neural networks. Because color spaces play a key role in the methods reviewed, we also explain in detail the most commonly color spaces to represent and process colors. In addition, we present some important applications that use the methods of image segmentation reviewed. Finally, a set of metrics frequently used to evaluate quantitatively the segmented images is shown

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

HSMA_WOA: A hybrid novel Slime mould algorithm with whale optimization algorithm for tackling the image segmentation problem of chest X-ray images

Recently, a novel virus called COVID-19 has pervasive worldwide, starting from China and moving to all the world to eliminate a lot of persons. Many attempts have been experimented to identify the infection with COVID-19. The X-ray images were one of the attempts to detect the influence of COVID-19 on the infected persons from involving those experiments. According to the X-ray analysis, bilateral pulmonary parenchymal ground-glass and consolidative pulmonary opacities can be caused by COVID-19 — sometimes with a rounded morphology and a peripheral lung distribution. But unfortunately, the specification or if the person infected with COVID-19 or not is so hard under the X-ray images. X-ray images could be classified using the machine learning techniques to specify if the person infected severely, mild, or not infected. To improve the classification accuracy of the machine learning, the region of interest within the image that contains the features of COVID-19 must be extracted. This problem is called the image segmentation problem (ISP). Many techniques have been proposed to overcome ISP. The most commonly used technique due to its simplicity, speed, and accuracy are threshold-based segmentation. This paper proposes a new hybrid approach based on the thresholding technique to overcome ISP for COVID-19 chest X-ray images by integrating a novel meta-heuristic algorithm known as a slime mold algorithm (SMA) with the whale optimization algorithm to maximize the Kapur's entropy. The performance of integrated SMA has been evaluated on 12 chest X-ray images with threshold levels up to 30 and compared with five algorithms: Lshade algorithm, whale optimization algorithm (WOA), FireFly algorithm (FFA), Harris-hawks algorithm (HHA), salp swarm algorithms (SSA), and the standard SMA. The experimental results demonstrate that the proposed algorithm outperforms SMA under Kapur's entropy for all the metrics used and the standard SMA could perform better than the other algorithms in the comparison under all the metrics

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

Application of metaheuristic optimization algorithms for image registration in mobile robot visual control

Visual Servoing (VS) of a mobile robot requires advanced digital image processing, and one of the techniques especially fitting for this complex task is Image Registration (IR). In general, IR involves the geometrical alignment of images, and it can be viewed as an optimization problem. Therefore, we propose Metaheuristic Optimization Algorithms (MOA) for IR in VS of a mobile robot. The comprehensive comparison study of three state-of-the-art MOA, namely the Slime Mould Algorithm (SMA), Harris Hawks Optimizer (HHO), and Whale Optimization Algorithm (WOA) is presented. The previously mentioned MOA used for IR are evaluated on 12 pairs of stereo images obtained by a mobile robot stereo vision system in a laboratory model of a manufacturing environment. The MATLAB software package is used for the implementation of the considered optimization algorithms. Acquired experimental results show that SMA outperforms HHO and WOA, while all three algorithms perform satisfactory alignment of images captured from various mobile robot poses

Visual Saliency Based on Multiscale Deep Features

Visual saliency is a fundamental problem in both cognitive and computational sciences, including computer vision. In this CVPR 2015 paper, we discover that a high-quality visual saliency model can be trained with multiscale features extracted using a popular deep learning architecture, convolutional neural networks (CNNs), which have had many successes in visual recognition tasks. For learning such saliency models, we introduce a neural network architecture, which has fully connected layers on top of CNNs responsible for extracting features at three different scales. We then propose a refinement method to enhance the spatial coherence of our saliency results. Finally, aggregating multiple saliency maps computed for different levels of image segmentation can further boost the performance, yielding saliency maps better than those generated from a single segmentation. To promote further research and evaluation of visual saliency models, we also construct a new large database of 4447 challenging images and their pixelwise saliency annotation. Experimental results demonstrate that our proposed method is capable of achieving state-of-the-art performance on all public benchmarks, improving the F-Measure by 5.0% and 13.2% respectively on the MSRA-B dataset and our new dataset (HKU-IS), and lowering the mean absolute error by 5.7% and 35.1% respectively on these two datasets.Comment: To appear in CVPR 201