Dongdong Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Dongdong Yang has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Maoguo Gong
Xidian University, Xi'an, China
4 shared publications Licheng Jiao
Key Lab of Intelligent Perception and Image Understanding of Ministry of Education of China, Xidian University, Xi’an, China
3 shared publicationsLi-Cheng Jiao
2 shared publications- Feng Zou
Huaibei Normal University
1 shared publication Hang Yu
Xidian University(Xidian University,Xidian Univ.),Xi An,China
1 shared publicationHui Yang
The Fourth Engineering Design and Research Institute of Engineer Corps, China PLA General Political Department, Beijing 100850, China
1 shared publication
Latest Publications
- Open Access
- 9 February 2015
- Published by MDPI AG in Algorithms
- Vol. 8 (1) , 32-45
An Efficient SAR Image Segmentation Framework Using Transformed Nonlocal Mean and Multi-Objective Clustering in Kernel Space
Synthetic aperture radar (SAR) image segmentation usually involves two crucial issues: suitable speckle noise removing technique and effective image segmentation methodology. Here, an efficient SAR image segmentation method considering both of the two aspects is presented. As for the first issue, the famous nonlocal mean (NLM) filter is introduced in this study to suppress the multiplicative speckle noise in SAR image. Furthermore, to achieve a higher denoising accuracy, the local neighboring pixels in the searching window are projected into a lower dimensional subspace by principal component analysis (PCA). Thus, the nonlocal mean filter is implemented in the subspace. Afterwards, a multi-objective clustering algorithm is proposed using the principals of artificial immune system (AIS) and kernel-induced distance measures. The multi-objective clustering has been shown to discover the data distribution with different characteristics and the kernel methods can improve its robustness to noise and outliers. Experiments demonstrate that the proposed method is able to partition the SAR image robustly and accurately than the conventional approaches.
- 9 February 2015
- Published by MDPI AG in Algorithms
- Vol. 8 (1) , 32-45
Open AccessAn Efficient SAR Image Segmentation Framework Using Transformed Nonlocal Mean and Multi-Objective Clustering in Kernel Space
Synthetic aperture radar (SAR) image segmentation usually involves two crucial issues: suitable speckle noise removing technique and effective image segmentation methodology. Here, an efficient SAR image segmentation method considering both of the two aspects is presented. As for the first issue, the famous nonlocal mean (NLM) filter is introduced in this study to suppress the multiplicative speckle noise in SAR image. Furthermore, to achieve a higher denoising accuracy, the local neighboring pixels in the searching window are projected into a lower dimensional subspace by principal component analysis (PCA). Thus, the nonlocal mean filter is implemented in the subspace. Afterwards, a multi-objective clustering algorithm is proposed using the principals of artificial immune system (AIS) and kernel-induced distance measures. The multi-objective clustering has been shown to discover the data distribution with different characteristics and the kernel methods can improve its robustness to noise and outliers. Experiments demonstrate that the proposed method is able to partition the SAR image robustly and accurately than the conventional approaches.
- Open Access
- 1 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-21
Multiobjective Memetic Estimation of Distribution Algorithm Based on an Incremental Tournament Local Searcher
A novel hybrid multiobjective algorithm is presented in this paper, which combines a new multiobjective estimation of distribution algorithm, an efficient local searcher andε-dominance. Besides, two multiobjective problems with variable linkages strictly based on manifold distribution are proposed. The Pareto set to the continuous multiobjective optimization problems, in the decision space, is a piecewise low-dimensional continuous manifold. The regularity by the manifold features just build probability distribution model by globally statistical information from the population, yet, the efficiency of promising individuals is not well exploited, which is not beneficial to search and optimization process. Hereby, an incremental tournament local searcher is designed to exploit local information efficiently and accelerate convergence to the true Pareto-optimal front. Besides, sinceε-dominance is a strategy that can make multiobjective algorithm gain well distributed solutions and has low computational complexity,ε-dominance and the incremental tournament local searcher are combined here. The novel memetic multiobjective estimation of distribution algorithm, MMEDA, was proposed accordingly. The algorithm is validated by experiment on twenty-two test problems with and without variable linkages of diverse complexities. Compared with three state-of-the-art multiobjective optimization algorithms, our algorithm achieves comparable results in terms of convergence and diversity metrics.
- 1 January 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-21
Open AccessMultiobjective Memetic Estimation of Distribution Algorithm Based on an Incremental Tournament Local Searcher
A novel hybrid multiobjective algorithm is presented in this paper, which combines a new multiobjective estimation of distribution algorithm, an efficient local searcher andε-dominance. Besides, two multiobjective problems with variable linkages strictly based on manifold distribution are proposed. The Pareto set to the continuous multiobjective optimization problems, in the decision space, is a piecewise low-dimensional continuous manifold. The regularity by the manifold features just build probability distribution model by globally statistical information from the population, yet, the efficiency of promising individuals is not well exploited, which is not beneficial to search and optimization process. Hereby, an incremental tournament local searcher is designed to exploit local information efficiently and accelerate convergence to the true Pareto-optimal front. Besides, sinceε-dominance is a strategy that can make multiobjective algorithm gain well distributed solutions and has low computational complexity,ε-dominance and the incremental tournament local searcher are combined here. The novel memetic multiobjective estimation of distribution algorithm, MMEDA, was proposed accordingly. The algorithm is validated by experiment on twenty-two test problems with and without variable linkages of diverse complexities. Compared with three state-of-the-art multiobjective optimization algorithms, our algorithm achieves comparable results in terms of convergence and diversity metrics.
- 4 September 2012
- Published by Wiley in Computational Intelligence
- Vol. 30 (1) , 115-144
INVESTIGATION OF COMBINATIONAL CLUSTERING INDICES IN ARTIFICIAL IMMUNE MULTI‐OBJECTIVE CLUSTERING
Clustering validity indices play a core role in the unsupervised pattern classification. To date, some indices have been proposed and their individual performances were compared on different artificial clustering test instances and real image segmentation tasks. However, little focus has been placed on the issue that how about their combinational performances are, although multi‐objective optimization has attracted much interest from current researchers in unsupervised classification. Here, we firstly evaluate the performance of five state‐of‐the‐art clustering indices with different characteristics in a single‐objective optimization algorithm designed in artificial immune system (AIS). Then, a multi‐objective optimization algorithm in AIS with fair ability of adaptability and diversity maintaining is introduced in this study. After that, the clustering performances of combinational clustering indices are investigated in the multi‐objective optimization framework. To test the effectiveness of the combinational clustering validity indices, 27 benchmark functions with different geometric structures and three complicated remote sensing images are employed in this study. Based on the computer simulations, some meaningful empirical guidelines are obtained for selecting the suitable combinational clustering indices for formulating an effective and robust multi‐objective clustering algorithm in different clustering tasks.
- 4 September 2012
- Published by Wiley in Computational Intelligence
- Vol. 30 (1) , 115-144
INVESTIGATION OF COMBINATIONAL CLUSTERING INDICES IN ARTIFICIAL IMMUNE MULTI‐OBJECTIVE CLUSTERING
Clustering validity indices play a core role in the unsupervised pattern classification. To date, some indices have been proposed and their individual performances were compared on different artificial clustering test instances and real image segmentation tasks. However, little focus has been placed on the issue that how about their combinational performances are, although multi‐objective optimization has attracted much interest from current researchers in unsupervised classification. Here, we firstly evaluate the performance of five state‐of‐the‐art clustering indices with different characteristics in a single‐objective optimization algorithm designed in artificial immune system (AIS). Then, a multi‐objective optimization algorithm in AIS with fair ability of adaptability and diversity maintaining is introduced in this study. After that, the clustering performances of combinational clustering indices are investigated in the multi‐objective optimization framework. To test the effectiveness of the combinational clustering validity indices, 27 benchmark functions with different geometric structures and three complicated remote sensing images are employed in this study. Based on the computer simulations, some meaningful empirical guidelines are obtained for selecting the suitable combinational clustering indices for formulating an effective and robust multi‐objective clustering algorithm in different clustering tasks.
- 20 October 2011
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 22 (10) , 2291-2304
Improved e Dominance by Isomap
- 20 October 2011
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 22 (10) , 2291-2304
Improved e Dominance by Isomap
- 4 November 2010
- Published by Wiley in Computational Intelligence
- Vol. 26 (4) , 359-385
ADAPTIVE RANKS CLONE ANDk‐NEAREST NEIGHBOR LIST–BASED IMMUNE MULTI‐OBJECTIVE OPTIMIZATION
Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS‐based algorithms typically exploit the immune system's characteristics of learning and adaptability to solve some complicated problems. Although, several AIS‐based algorithms have proposed to solve multi‐objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one‐off deletion could not obtain excellent diversity in the final population; therefore, ak‐nearest neighbor list (wherekis the number of objectives) is established and maintained to eliminate the solutions in the archive population. Thek‐nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product ofk‐nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well‐known and frequently used multi‐objective problems and two many‐objective problems with 4, 6, and 8 objectives. Compared with five other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time.
- 4 November 2010
- Published by Wiley in Computational Intelligence
- Vol. 26 (4) , 359-385
ADAPTIVE RANKS CLONE ANDk‐NEAREST NEIGHBOR LIST–BASED IMMUNE MULTI‐OBJECTIVE OPTIMIZATION
Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS‐based algorithms typically exploit the immune system's characteristics of learning and adaptability to solve some complicated problems. Although, several AIS‐based algorithms have proposed to solve multi‐objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one‐off deletion could not obtain excellent diversity in the final population; therefore, ak‐nearest neighbor list (wherekis the number of objectives) is established and maintained to eliminate the solutions in the archive population. Thek‐nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product ofk‐nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well‐known and frequently used multi‐objective problems and two many‐objective problems with 4, 6, and 8 objectives. Compared with five other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time.
- 15 January 2010
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 21 (1) , 14-33
Clone Selection Algorithm to Solve Preference Multi-Objective Optimization
The difficulty of current multi-objective optimization community lies in the large number of objectives. Lacking enough selection pressure toward the Pareto front,classical algorithms are greatly restrained. In this paper,preference rank immune memory clone selection algorithm (PISA) is proposed to solve the problem of multi-objective optimization with a large number of objectives. The nondominated antibodies are proportionally cloned by their preference ranks,which are defined by their preference information. It is beneficial to increase selection pressure and speed up convergence to the true Pareto-optimal front. Solutions used to approximate the Pareto front can be reduced by preference information. Because only nondominated antibodies are selected to operate,the time complexity of the algorithm can be reduced. Besides,an immune memory population is kept to preserve the nondominated antibodies and ε dominance is employed to maintain the diversity of the immune memory population. Tested in several multi-objective problems with 2 objectives and DTLZ2 and DTLZ3 as high as 8 objectives,PISA is experimentally effective.
- 15 January 2010
- Published by China Science Publishing & Media Ltd. in Journal of Software
- Vol. 21 (1) , 14-33
Clone Selection Algorithm to Solve Preference Multi-Objective Optimization
The difficulty of current multi-objective optimization community lies in the large number of objectives. Lacking enough selection pressure toward the Pareto front,classical algorithms are greatly restrained. In this paper,preference rank immune memory clone selection algorithm (PISA) is proposed to solve the problem of multi-objective optimization with a large number of objectives. The nondominated antibodies are proportionally cloned by their preference ranks,which are defined by their preference information. It is beneficial to increase selection pressure and speed up convergence to the true Pareto-optimal front. Solutions used to approximate the Pareto front can be reduced by preference information. Because only nondominated antibodies are selected to operate,the time complexity of the algorithm can be reduced. Besides,an immune memory population is kept to preserve the nondominated antibodies and ε dominance is employed to maintain the diversity of the immune memory population. Tested in several multi-objective problems with 2 objectives and DTLZ2 and DTLZ3 as high as 8 objectives,PISA is experimentally effective.
- 20 April 2009
- Published by Wiley in Computational Intelligence
- Vol. 25 (2) , 84-108
ADAPTIVE MULTI‐OBJECTIVE OPTIMIZATION BASED ON NONDOMINATED SOLUTIONS
An adaptive hybrid model (AHM) based on nondominated solutions is presented in this study for multi‐objective optimization problems (MOPs). In this model, three search phases are devised according to the number of nondominated solutions in the current population: 1) emphasizing the dominated solutions when the population contains very few nondominated solutions; 2) maintaining the balance between nondominated and dominated solutions when nondominated ones become more; 3) when the population consists of adequate nondominated solutions, dominated ones could be ignored and the isolated nondominated ones are allocated more computational budget by their crowding distance values for heuristic search. To exploit local information efficiently, a local incremental search algorithm, LISA, is proposed and merged into the model. This model maintains the adaptive mechanism between the optimization process by the online discovered nondominated solutions. The proposed model is validated using five ZDT and five DTLZ problems. Compared with three other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, and PESA‐II, AHM achieves comparable results in terms of convergence and diversity metrics. Finally, the sensitivity of introduced parameters and scalability to the number of objectives are investigated.
- 20 April 2009
- Published by Wiley in Computational Intelligence
- Vol. 25 (2) , 84-108
ADAPTIVE MULTI‐OBJECTIVE OPTIMIZATION BASED ON NONDOMINATED SOLUTIONS
An adaptive hybrid model (AHM) based on nondominated solutions is presented in this study for multi‐objective optimization problems (MOPs). In this model, three search phases are devised according to the number of nondominated solutions in the current population: 1) emphasizing the dominated solutions when the population contains very few nondominated solutions; 2) maintaining the balance between nondominated and dominated solutions when nondominated ones become more; 3) when the population consists of adequate nondominated solutions, dominated ones could be ignored and the isolated nondominated ones are allocated more computational budget by their crowding distance values for heuristic search. To exploit local information efficiently, a local incremental search algorithm, LISA, is proposed and merged into the model. This model maintains the adaptive mechanism between the optimization process by the online discovered nondominated solutions. The proposed model is validated using five ZDT and five DTLZ problems. Compared with three other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, and PESA‐II, AHM achieves comparable results in terms of convergence and diversity metrics. Finally, the sensitivity of introduced parameters and scalability to the number of objectives are investigated.