http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
An evolving surrogate model-based differential evolution algorithm
Mallipeddi, R.,Lee, M. Elsevier Science, B.V 2015 Applied soft computing Vol.34 No.-
Differential evolution (DE) is a simple and effective approach for solving numerical optimization problems. However, the performance of DE is sensitive to the choice of mutation and crossover strategies and their associated control parameters. Therefore, to achieve optimal performance, a time-consuming parameter tuning process is required. In DE, the use of different mutation and crossover strategies with different parameter settings can be appropriate during different stages of the evolution. Therefore, to achieve optimal performance using DE, various adaptation, self-adaptation, and ensemble techniques have been proposed. Recently, a classification-assisted DE algorithm was proposed to overcome trial and error parameter tuning and efficiently solve computationally expensive problems. In this paper, we present an evolving surrogate model-based differential evolution (ESMDE) method, wherein a surrogate model constructed based on the population members of the current generation is used to assist the DE algorithm in order to generate competitive offspring using the appropriate parameter setting during different stages of the evolution. As the population evolves over generations, the surrogate model also evolves over the iterations and better represents the basin of search by the DE algorithm. The proposed method employs a simple Kriging model to construct the surrogate. The performance of ESMDE is evaluated on a set of 17 bound-constrained problems. The performance of the proposed algorithm is compared to state-of-the-art self-adaptive DE algorithms: the classification-assisted DE algorithm, regression-assisted DE algorithm, and ranking-assisted DE algorithm.
A Genetic Algorithm-Based Moving Object Detection for Real-time Traffic Surveillance
Giyoung Lee,Mallipeddi, Rammohan,Gil-Jin Jang,Minho Lee IEEE 2015 IEEE signal processing letters Vol.22 No.10
<P>Recent developments in vision systems such as distributed smart cameras have encouraged researchers to develop advanced computer vision applications suitable to embedded platforms. In the embedded surveillance system, where memory and computing resources are limited, simple and efficient computer vision algorithms are required. In this letter, we present a moving object detection method for real-time traffic surveillance applications. The proposed method is a combination of a genetic dynamic saliency map (GDSM), which is an improved version of dynamic saliency map (DSM) and background subtraction. The experimental results show the effectiveness of the proposed method in detecting moving objects.</P>
Jalali, A.,Mallipeddi, R.,Lee, M. Pergamon ; Elsevier Science Ltd 2017 expert systems with applications Vol.87 No.-
In this paper, we propose a sensitive convolutional neural network which incorporates sensitivity term in the cost function of Convolutional Neural Network (CNN) to emphasize on the slight variations and high frequency components in highly blurred input image samples. The proposed cost function in CNN has a sensitivity part in which the conventional error is divided by the derivative of the activation function, and subsequently the total error is minimized by the gradient descent method during the learning process. Due to the proposed sensitivity term, the data samples at the decision boundaries appear more on the middle band or the high gradient part of the activation function. This highlights the slight changes in the highly blurred input images enabling better feature extraction resulting in better generalization and improved classification performance in the highly blurred images. To study the effect of the proposed sensitivity term, experiments were performed for the face recognition task on small dataset of facial images at different long standoffs in both night-time and day-time modalities.
Differential evolution with multi-population based ensemble of mutation strategies
Wu, G.,Mallipeddi, R.,Suganthan, P.N.,Wang, R.,Chen, H. North-Holland [etc ; Elsevier Science Ltd 2016 Information sciences Vol.329 No.-
<P>Differential evolution (DE) is among the most efficient evolutionary algorithms (EAs) for global optimization and now widely applied to solve diverse real-world applications. As the most appropriate configuration of DE to efficiently solve different optimization problems can be significantly different, an appropriate combination of multiple strategies into one DE variant attracts increasing attention recently. In this study, we propose a multi-population based approach to realize an ensemble of multiple strategies, thereby resulting in a new DE variant named multi-population ensemble DE (MPEDE) which simultaneously consists of three mutation strategies, i.e., 'current-to-pbest/1' and 'current-to-rand/1' and 'rand/1'. There are three equally sized smaller indicator subpopulations and one much larger reward subpopulation. Each constituent mutation strategy has one indicator subpopulation. After every certain number of generations, the current best performing mutation strategy will be determined according to the ratios between fitness improvements and consumed function evaluations. Then the reward subpopulation will be allocated to the determined best performing mutation strategy dynamically. As a result, better mutation strategies obtain more computational resources in an adaptive manner during the evolution. The control parameters of each mutation strategy are adapted independently as well. Extensive experiments on the suit of CEC 2005 benchmark functions and comprehensive comparisons with several other efficient DE variants show the competitive performance of the proposed MPEDE (Matlab codes of MPEDE are available from http://guohuawunudt.gotoip2.com/publications.html). (C) 2015 Elsevier Inc. All rights reserved.</P>
Differential Evolution with Population and Strategy Parameter Adaptation
Gonuguntla, V.,Mallipeddi, R.,Veluvolu, Kalyana C. Hindawi Limited 2015 Mathematical problems in engineering Vol.2015 No.-
<P>Differential evolution (DE) is simple and effective in solving numerous real-world global optimization problems. However, its effectiveness critically depends on the appropriate setting of population size and strategy parameters. Therefore, to obtain optimal performance the time-consuming preliminary tuning of parameters is needed. Recently, different strategy parameter adaptation techniques, which can automatically update the parameters to appropriate values to suit the characteristics of optimization problems, have been proposed. However, most of the works do not control the adaptation of the population size. In addition, they try to adapt each strategy parameters individually but do not take into account the interaction between the parameters that are being adapted. In this paper, we introduce a DE algorithm where both strategy parameters are self-adapted taking into account the parameter dependencies by means of a multivariate probabilistic technique based on Gaussian Adaptation working on the parameter space. In addition, the proposed DE algorithm starts by sampling a huge number of sample solutions in the search space and in each generation a constant number of individuals from huge sample set are adaptively selected to form the population that evolves. The proposed algorithm is evaluated on 14 benchmark problems of CEC 2005 with different dimensionality.</P>
<tex> $I_{\rm SDE}$</tex>+—An Indicator for Multi and Many-Objective Optimization
Pamulapati, Trinadh,Mallipeddi, Rammohan,Suganthan, Ponnuthurai Nagaratnam Institute of Electrical and Electronics Engineers 2019 IEEE transactions on evolutionary computation Vol.23 No.2
<P>In this letter, an efficient indicator for multi and many-objective optimization is proposed. The proposed indicator ( <TEX>$I_{{SDE}}$</TEX><SUP>+</SUP>) is a combination of sum of objectives and shift-based density estimation and benefits from their ability to promote convergence and diversity, respectively. An evolutionary multiobjective optimization framework based on the proposed indicator is shown to perform comparably or better than the state-of-the-art on a variety of scalable benchmark problems.</P>