SIGEVOlution newsletter volume 9/3 Features GI special Issue paper

The current issue of SIGEVOlution (9/3) describes one of the articles to appear in the forthcoming special issue on Genetic Improvement, to wit:”Online Genetic Improvement on the java virtual machine with ECSELR” by Kwaku Yeboah-Antwi and Benoit Baudry…

The current issue of SIGEVOlution (9/3) describes one of the articles to appear in the forthcoming special issue on Genetic Improvement, to wit:
“Online Genetic Improvement on the java virtual machine with ECSELR” by Kwaku Yeboah-Antwi and Benoit Baudry, which has just appeared on our web pages as an online first article doi:10.1007/s10710-016-9278-4

Bill

SIGEVOlution newsletter volume 9/3 Features GI special Issue paper

The current issue of SIGEVOlution (9/3) describes one of the articles to appearin the forthcomming special issue on Genetic Improvement, towit:”Online Genetic Improvement on the java virtual machine with ECSELR” byKwaku Yeboah-Antwi, Benoit Baudry, whi…

The current issue of SIGEVOlution (9/3) describes one of the articles to appear
in the forthcomming special issue on Genetic Improvement, towit:
“Online Genetic Improvement on the java virtual machine with ECSELR” by
Kwaku Yeboah-Antwi, Benoit Baudry, which has just appeared on our web

pages as an online first article doi:10.1007/s10710-016-9278-4

Bill

Metaheuristics for Specialization of a Segmentation Algorithm for Ultrasound Images

An unseeded segmentation system applied to ultrasound (US) imaging is presented, based on a compact segmentation algorithm. Its basic behavior is adapted by a region selection algorithm controlled by a region classification function, which scores the r…

An unseeded segmentation system applied to ultrasound (US) imaging is presented, based on a compact segmentation algorithm. Its basic behavior is adapted by a region selection algorithm controlled by a region classification function, which scores the relevance of regions generated from the previous segmentation step. This approach results in a completely unseeded system. Its behavior, represented by a fuzzy rule system, is specialized for the present clinical applications by means of two different bioinspired approaches that minimize the segmentation error against a human expert asked to fulfill the same task. The first one is based on a real-valued genetic algorithm, whereas the second is based on an ant colony stigmergic algorithm. The two methodologies are tested and benchmarked on four data sets: 1) breast US images for carcinoma screening; 2) obs/gyn US for ovarian follicles assessment; and 3) two applications in anesthesiology US during brachial anesthesia. Results show that the proposed bioinspired approaches are well suited for these complex tasks and can be used as a straightforward methodology to adapt an image segmentation algorithm to fulfill recognition tasks. The system could be adapted to any application in US imaging that requires identification of anatomical districts, morphological structures, and any other region of interest related to the clinical practice.

Stability Analysis of the Particle Swarm Optimization Without Stagnation Assumption

In this letter, we study the first- and second-order stabilities of a stochastic recurrence relation that represents a class of particle swarm optimization (PSO) algorithms. We assume that the personal and global best vectors in that relation are rando…

In this letter, we study the first- and second-order stabilities of a stochastic recurrence relation that represents a class of particle swarm optimization (PSO) algorithms. We assume that the personal and global best vectors in that relation are random variables (with arbitrary means and variances) that are updated during the run so that our calculations do not require the stagnation assumption. We prove that the convergence of expectation and variance of the positions generated by that relation is independent of the mean and variance of the distribution of the personal and global best vectors. We also provide convergence boundaries for that relation and compare them with those of standard PSO algorithms (as a specific case of the stochastic recurrence relation) provided in earlier studies.

A Hybrid Evolutionary Immune Algorithm for Multiobjective Optimization Problems

In recent years, multiobjective immune algorithms (MOIAs) have shown promising performance in solving multiobjective optimization problems (MOPs). However, basic MOIAs only use a single hypermutation operation to evolve individuals, which may induce so…

In recent years, multiobjective immune algorithms (MOIAs) have shown promising performance in solving multiobjective optimization problems (MOPs). However, basic MOIAs only use a single hypermutation operation to evolve individuals, which may induce some difficulties in tackling complicated MOPs. In this paper, we propose a novel hybrid evolutionary framework for MOIAs, in which the cloned individuals are divided into several subpopulations and then evolved using different evolutionary strategies. An example of this hybrid framework is implemented, in which simulated binary crossover and differential evolution with polynomial mutation are adopted. A fine-grained selection mechanism and a novel elitism sharing strategy are also adopted for performance enhancement. Various comparative experiments are conducted on 28 test MOPs and our empirical results validate the effectiveness and competitiveness of our proposed algorithm in solving MOPs of different types.