Search

In order to achieve robust performance of preserving significant image details while removing noise for image segmentation, this paper presents a multi-objective evolutionary fuzzy clustering (MOEFC) algorithm to convert fuzzy clustering problems for image segmentation into multi-objective problems. The multi-objective problems are optimized by multi-objective evolutionary algorithm with decomposition. The decomposition strategy is adopted to project the multi-objective problem into a number of sub-problems. Each sub-problem represents a fuzzy clustering problem incorporating local information for image segmentation. Opposition-based learning is utilized to improve search capability of the proposed algorithm. Two problem-specific techniques, an adaptive weighted fuzzy factor and a mixed population initialization, are introduced to improve the performance of the algorithm. Experiment results on synthetic and real images illustrate that the proposed algorithm can achieve a trade-off between preserving image details and removing noise for image segmentation. [ABSTRACT FROM AUTHOR]

Abstract: Recently the single image super-resolution reconstruction (SISR) via sparse coding has attracted increasing interests. Considering that there are obviously repetitive image structures in medical images, in this study we propose a regularized SISR method via sparse coding and structural similarity. The pixel based recovery is incorporated as a regularization term to exploit the non-local structural similarities of medical images, which is very helpful in further improving the quality of recovered medical images. An alternative variables optimization algorithm is proposed and some medical images including CT, MRI and ultrasound images are used to investigate the performance of our proposed method. The results show the superiority of our method to its counterparts. [Copyright &y& Elsevier]

Abstract: By inspiration of the granular evolutionary algorithm, a Granular Agent Evolutionary Classification (GAEC) algorithm for the classification task in data mining is proposed. The method uses the granular agent to denote the set of some examples that have similar attributions and the knowledge base guides the evolution of granular agent. Also some granular evolutionary operators are designed for classification problem. Assimilation operator, exchange operator, and differentiation operator reflect the competitive, cooperative and self-learning ability of agent, respectively. Finally, some classification rules are extracted from granular agents by some strategy to forecast the sort of new data. Empirical study contains UCI data sets, KDDCUP99 data sets and remote image recognition. The test results show that the algorithm has a good classification prediction, and only need a small price for the training time. In most UCI data sets, the performance of GAEC is better than G-NET, OCEC and C4.5, which have good performance. At the same time, some Gaussian White Noise attributes are added to these UCI data sets and the results show GACE has some anti-noise abilities. To test the scalability of GAEC, two functions along two dimensions, the number of training examples and the number of attributes are used. Also, GAEC are applied to some real world fields, intrusion detection system and remote sensing image recognition. The experiments for KDDCUP99 verify GAEC has capability to deal with massive data in real world and good predicting capability for unknown type data. At last, the accuracy rate of GAEC is also good for the remote sensing image recognition. [Copyright &y& Elsevier]

Automated algorithm design is attracting considerable recent research attention in solving complex combinatorial optimisation problems, due to that most metaheuristics may be particularly effective at certain problems or certain instances of the same problem but perform poorly at others. Within a general algorithm design framework, this study investigates reinforcement learning on the automated design of metaheuristic algorithms. Two groups of features, namely search-dependent and instance-dependent features, are firstly identified to represent the search space of algorithm design to support effective reinforcement learning on the new task of algorithm design. With these key features, a state-of-the-art reinforcement learning technique, namely proximal policy optimisation, is employed to automatically combine the basic algorithmic components within the general framework to develop effective metaheuristics. Patterns of the best designed algorithm, in particular the utilisation and transition of algorithmic components, are investigated. Experimental results on the capacitated vehicle routing problem with time windows benchmark dataset demonstrate the effectiveness of the identified features in assisting automated algorithm design with the proposed reinforcement learning model. • Two groups of features are identified to describe search space of algorithm design. • PPO is employed to extract useful knowledge hidden in the search data. • The influence of state representation (with different features) is investigated. • The utilisation and transition of algorithmic components are analysed. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, a multiscale overcomplete dictionary learning approach is proposed for image denoising by exploiting the multiscale property and sparse representation of images. The images are firstly sparsely represented by a translation invariant dictionary and then the coefficients are denoised using some learned multiscale dictionaries. Dictionaries learning can be reduced to a non-convex l 0-norm minimization problem with multiple variables, so an evolution-enhanced algorithm is proposed to alternately optimize the variables. Some experiments are taken on comparing the performance of our proposed method with its counterparts on some benchmark natural images, and the superiorities of our proposed method to its counterparts can be observed in both the visual result and some numerical guidelines. [Copyright &y& Elsevier]