Valentín Osuna-Enciso

Automatic multiple circle detection based on artificial immune systems

Hough transform (HT) has been the most common method for circle detection, exhibiting robustness but adversely demanding a considerable computational load and large storage. Alternative approaches for multiple circle detection include heuristic methods built over iterative optimization procedures which confine the search to only one circle per optimization cycle yielding longer execution times. On the other hand, artificial immune systems (AIS) mimic the behavior of the natural immune system for solving complex optimization problems. The clonal selection algorithm (CSA) is arguably the most widely employed AIS approach. It is an effective search method which optimizes its response according to the relationship between patterns to be identified, i.e. antigens (Ags) and their feasible solutions also known as antibodies (Abs). Although CSA converges to one global optimum, its incorporated CSA-Memory holds valuable information regarding other local minima which have emerged during the optimization process. Accordingly, the detection is considered as a multi-modal optimization problem which supports the detection of multiple circular shapes through only one optimization procedure. The algorithm uses a combination of three non-collinear edge points as parameters to determine circles candidates. A matching function determines if such circle candidates are actually present in the image. Guided by the values of such function, the set of encoded candidate circles are evolved through the CSA so the best candidate (global optimum) can fit into an actual circle within the edge map of the image. Once the optimization process has finished, the CSA-Memory is revisited in order to find other local optima representing potential circle candidates. The overall approach is a fast multiple-circle detector despite considering complicated conditions in the image.

Improving segmentation velocity using an evolutionary method

We use an evolutionary mechanism to improve the image segmentation process.We optimize the Tsallis entropy with an evolutionary method for image segmentation.The approach is able to find accurately the best thresholds for complex images.Comparisons and non-parametric test support the experimental results.An alternative method for image segmentation is proposed. Image segmentation plays an important role in image processing and computer vision. It is often used to classify an image into separate regions, which ideally correspond to different real-world objects. Several segmentation methods have been proposed in the literature, being thresholding techniques the most popular. In such techniques, it is selected a set of proper threshold values that optimize a determined functional criterion, so that each pixel is assigned to a determined class according to its corresponding threshold points. One interesting functional criterion is the Tsallis entropy, which gives excellent results in bi-level thresholding. However, when it is applied to multilevel thresholding, its evaluation becomes computationally expensive, since each threshold point adds restrictions, multimodality and complexity to its functional formulation. Therefore, in the process of finding the appropriate threshold values, it is desired to limit the number of evaluations of the objective function (Tsallis entropy). Under such circumstances, most of the optimization algorithms do not seem to be suited to face such problems as they usually require many evaluations before delivering an acceptable result. On the other hand, the Electromagnetism-Like algorithm is an evolutionary optimization approach which emulates the attraction-repulsion mechanism among charges for evolving the individuals of a population. This technique exhibits interesting search capabilities whereas maintains a low number of function evaluations. In this paper, a new algorithm for multilevel segmentation based on the Electromagnetism-Like algorithm is proposed. In the approach, the optimization algorithm based on the electromagnetism theory is used to find the optimal threshold values by maximizing the Tsallis entropy. Experimental results over several images demonstrate that the proposed approach is able to improve the convergence velocity, compared with similar methods such as Cuckoo search, and Particle Swarm Optimization.

A bio-inspired evolutionary algorithm: allostatic optimisation

Over the last decade, several bio-inspired algorithms have emerged for solving complex optimisation problems. Since the performance of these algorithms present a suboptimal behaviour, a tremendous amount of research has been devoted to find new and better optimisation methods. On the other hand, allostasis is a medical term recently coined which explains how the configuration of the internal state IS in different organs allows reaching stability when an unbalance condition is presented. In this paper, a novel biologically-inspired algorithm called allostatic optimisation AO is proposed for solving optimisation problems. In AO, individuals emulate the IS of different organs. In the approach, each individual is improved by using numerical operators based on the biological principles of the allostasis mechanism. The proposed method has been compared to other well-known optimisation algorithms. The results show good performance of the proposed method when searching for a global optimum of several benchmark functions.

MULTITHRESHOLD SEGMENTATION BASED ON ARTIFICIAL IMMUNE SYSTEMS

Bio-inspired computing has lately demonstrated its usefulness with remarkable contributions to shape detection, optimization, and classification in pattern recognition. Similarly, multithreshold selection has become a critical step for image analysis and computer vision sparking considerable efforts to design an optimal multi-threshold estimator. This paper presents an algorithm for multi-threshold segmentation which is based on the artificial immune systems(AIS) technique, also known as theclonal selection algorithm (CSA). It follows the clonal selection principle (CSP) from the human immune system which basically generates a response according to the relationship between antigens (Ag), that is, patterns to be recognized and antibodies (Ab), that is, possible solutions. In our approach, the 1D histogram of one image is approximated through a Gaussian mixture model whose parameters are calculated through CSA. Each Gaussian function represents a pixel class and therefore a thresholding point. Unlike the expectation-maximization (EM) algorithm, the CSA-based method shows a fast convergence and a low sensitivity to initial conditions. Remarkably, it also improves complex time-consuming computations commonly required by gradient-based methods. Experimental evidence demonstrates a successful automatic multi-threshold selection based on CSA, comparing its performance to the aforementioned well-known algorithms.

Image segmentation by minimum cross entropy using evolutionary methods

The segmentation of digital images is one of the most important steps in an image processing or computer vision system. It helps to classify the pixels in different regions according to their intensity level. Several segmentation techniques have been proposed, and some of them use complex operators. The techniques based on thresholding are the easiest to implement; the problem is to select correctly the best threshold that divides the pixels. An interesting method to choose the best thresholds is the minimum cross entropy (MCET), which provides excellent results for bi-level thresholding. Nevertheless, the extension of the segmentation problem into multiple thresholds increases significantly the computational effort required to find optimal threshold values. Each new threshold adds complexity to the formulation of the problem. Classic methods for image thresholding perform extensive searches, while new approaches take advantage of heuristics to reduce the search. Evolutionary algorithms use heuristics to optimize criteria over a finite number of iterations. The correct selection of an evolutionary algorithm to minimize the MCET directly impacts the performance of the method. Current approaches take a large number of iterations to converge and a high rate of MCET function evaluations. The electromagnetism-like optimization (EMO) algorithm is an evolutionary technique which emulates the attraction–repulsion mechanism among charges for evolving the individuals of a population. Such technique requires only a small number of evaluations to find the optimum. This paper proposes the use of EMO to search for optimal threshold values by minimizing the cross entropy function while reducing the amount of iterations and function evaluations. The approach is tested on a set of benchmark images to demonstrate that is able to improve the convergence and velocity; additionally, it is compared with similar state-of-the-art optimization approaches.

Neural forecasting and optimal sizing for hybrid renewable energy systems with grid-connected storage system

Energy systems with renewable sources are used around the world in order to satisfy both off-grid and on-grid load demands, and are commonly coupled to conventional sources. A good behavior of this kind of systems depends on the renewable sources availability that includes the solar irradiance and the wind speed, as well as the profile variations over the energy demand. Their main objective is to satisfy the load demand while minimizing the use of conventional sources, reducing pollutant emissions and storing the energy excess for deficit conditions. This paper presents modeling, neural forecasting and optimal sizing for hybrid energy systems, which are proposed to minimize both the overall annual cost and the use of conventional sources, which in turn represents reduction of pollutant emissions. In this paper, the use of renewable sources along with load demand variations are predicted by a High Order Neural Network trained with an Extended Kalman Filter, whereas the optimal sizing is calculated by using...

A Novel Multi-threshold Segmentation Approach Based on Artificial Immune System Optimization

Threshold selection is a critical step in computer vision. Immune systems, has inspired optimization algorithms known as Artificial Immune Optimization (AIO). AIO have been successfully applied to solve optimization problems. The Clonal Selection algorithm (CSA) is the most applied AIO method. It generates a response after an antigenic pattern is identified by an antibody. This works presents an image multi-threshold approach based on AIS optimization. The approach considers the segmentation task as an optimization process. The 1-D histogram of the image is approximated by adding several Gaussian functions whose parameters are calculated by the CSA. The mix of Gaussian functions approximates the histogram; each Gaussian function represents a pixel class (threshold point). The proposed approach is computationally efficient and does not require prior assumptions about the image. The algorithm demonstrated ability to perform automatic threshold selection.

Parameter identification of two dimensional digital filters using electro-magnetism optimization

The design of Two-Dimensional Infinite Input Response Filters (2D IIR) is an important task in the field of signal processing. These filters are widely used in several areas of engineering as an important tool to eliminate undesired frequencies in high-noised signals. However, 2D IIR filters have parameters that need to be calibrated in order to obtain the best output, and finding these optimal values is not an easy task. On the other hand, Electro-magnetism Optimization (EMO) is a population-based technique which possess interesting convergence properties, it works following the electro-magnetism principles for solving complex optimization problems. This paper introduces an algorithm for the automatic parameter identification of 2D IIR filters using EMO, a process that is regarded as a multidimensional optimization problem. Experimental results are included to validate the efficiency of the proposed technique regarding accuracy, speed, and robustness.

A multiobjective approach to homography estimation

In several machine vision problems, a relevant issue is the estimation of homographies between two different perspectives that hold an extensive set of abnormal data. A method to find such estimation is the random sampling consensus (RANSAC); in this, the goal is to maximize the number of matching points given a permissible error (Pe), according to a candidate model. However, those objectives are in conflict: a low Pe value increases the accuracy of the model but degrades its generalization ability that refers to the number of matching points that tolerate noisy data, whereas a high Pe value improves the noise tolerance of the model but adversely drives the process to false detections. This work considers the estimation process as a multiobjective optimization problem that seeks to maximize the number of matching points whereas Pe is simultaneously minimized. In order to solve the multiobjective formulation, two different evolutionary algorithms have been explored: the Nondominated Sorting Genetic Algorithm II (NSGA-II) and the Nondominated Sorting Differential Evolution (NSDE). Results considering acknowledged quality measures among original and transformed images over a well-known image benchmark show superior performance of the proposal than Random Sample Consensus algorithm.

Circle detection on images based on the Clonal Selection Algorithm (CSA)

Abstract Bio-inspired computing has demonstrated to be useful in several application areas. Over the last decade, new bio-inspired algorithms have emerged with applications for detection, optimisation and classification for use in computer vision tasks. On the other hand, automatic circle detection in digital images is considered an important and complex task for the computer vision community. Consequently, a tremendous amount of research has been devoted to find an optimal circle detector. This article presents an algorithm for the automatic detection of circular shapes from complicated and noisy images with no consideration of the conventional Hough transform principles. The proposed algorithm is based on newly developed Artificial Immune Optimisation (AIO) technique, known as the Clonal Selection Algorithm (CSA). The CSA is an effective method for searching and optimising following the Clonal Selection Principle (CSP) in the human immune system which generates a response according to the relationship between antigens (Ags), i.e. patterns to be recognised and antibodies (Abs), i.e. possible solutions. The algorithm uses the encoding of three points as candidate circles (x,y,r) over the edge image. An objective function evaluates if such candidate circles (Ab) are actually present in the edge image (Ag). Guided by the values of this objective function, the set of encoded candidate circles are evolved using the CSA so that they can fit to the actual circles on the edge map of the image. Experimental results over several synthetic as well as natural images with varying range of complexity validate the efficiency of the proposed technique with regard to accuracy, speed and robustness.