Xiangjuan Wu
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
Xiangjuan Wu has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Yuping Wang
School of Computer Science and Technology Xidian University Xi'an 710071 China
4 shared publications Hanqing Deng
School of Information Engineering Ningxia University Yinchuan China
2 shared publications- Hao Liu
Ningxia University, Yinchuan, China
2 shared publications - Junhua Liu
School of Computer Science and Technology, Xidian University, Xi’an, China
2 shared publications - Bingjie Liu
College of Information and Management Science, Henan Agricultural University, Zhengzhou 450003, China
1 shared publication - Hui Fang
Ningxia University
1 shared publication
Latest Publications
- 21 January 2026
- Published by Springer Nature
- p. 107-120
Low-Rank Approximation CLIP to Improve Cross-Modal Consistency in Language-Guided Age Estimation
- 21 January 2026
- Published by Springer Nature
- p. 107-120
Low-Rank Approximation CLIP to Improve Cross-Modal Consistency in Language-Guided Age Estimation
- 7 November 2025
- Published by Wiley in Expert Systems
- Vol. 42 (12)
Large‐Scale Multi‐Objective Optimization Algorithms: A Decade Survey
Large‐scale multi‐objective optimization problems (LSMOPs) are characterised by concurrent optimization of multiple conflicting objectives and no fewer than 100 decision variables. They widely exist in the fields of practical engineering and scientific research. Over the past decade, many large‐scale multi‐objective evolutionary algorithms (LSMOEAs) have emerged to address LSMOPs. This paper systematically reviews and comprehensively analyzes the ideas, advantages, disadvantages, and latest developments of these LSMOEAs. Firstly, it introduces the relevant concepts of LSMOEAs. Then classify them into four categories: decision variable grouping‐based LSMOEAs, non‐grouping dimensionality reduction‐based LSMOEAs, effective offspring generation‐based LSMOEAs, and learning models‐based LSMOEAs. It analyzes representative algorithms in each category, elaborating on their core strategies, advantages, and disadvantages. Finally, it explores the applications of LSMOEAs in computer vision, like tackling pixel‐level correlation, high‐resolution feature redundancy, dynamic target tracking, and complex visual modelling. This paper provides readers with a comprehensive and systematic overview of LSMOEAs, serving as a valuable reference for both researchers entering this field and practitioners seeking to select appropriate algorithms for practical problems.
- 7 November 2025
- Published by Wiley in Expert Systems
- Vol. 42 (12)
Large‐Scale Multi‐Objective Optimization Algorithms: A Decade Survey
Large‐scale multi‐objective optimization problems (LSMOPs) are characterised by concurrent optimization of multiple conflicting objectives and no fewer than 100 decision variables. They widely exist in the fields of practical engineering and scientific research. Over the past decade, many large‐scale multi‐objective evolutionary algorithms (LSMOEAs) have emerged to address LSMOPs. This paper systematically reviews and comprehensively analyzes the ideas, advantages, disadvantages, and latest developments of these LSMOEAs. Firstly, it introduces the relevant concepts of LSMOEAs. Then classify them into four categories: decision variable grouping‐based LSMOEAs, non‐grouping dimensionality reduction‐based LSMOEAs, effective offspring generation‐based LSMOEAs, and learning models‐based LSMOEAs. It analyzes representative algorithms in each category, elaborating on their core strategies, advantages, and disadvantages. Finally, it explores the applications of LSMOEAs in computer vision, like tackling pixel‐level correlation, high‐resolution feature redundancy, dynamic target tracking, and complex visual modelling. This paper provides readers with a comprehensive and systematic overview of LSMOEAs, serving as a valuable reference for both researchers entering this field and practitioners seeking to select appropriate algorithms for practical problems.
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 11532-11541
Appearance Contrasts for Unconstrained Age Estimation
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 11532-11541
Open AccessAppearance Contrasts for Unconstrained Age Estimation
- Open Access
- 23 April 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (9) , 3538
Mean-Field Stackelberg Game-Based Security Defense and Resource Optimization in Edge Computing
Edge computing brings computation and storage resources to the edge of the mobile network to solve the problems of low latency and high real-time demand. However, edge computing is more vulnerable to malicious attacks due to its open and dynamic environments. In this article, we investigate security defense strategies in edge computing systems, focusing on scenarios with one attacker and multiple defenders to determine optimal defense strategies with minimal resource allocation. Firstly, we formulate the interactions between the defenders and the attackers as the mean-field Stackelberg game model, where the state and the objective functions of the defenders are coupled through the mean-field term, and are strongly influenced by the strategy of the attacker. Then, we analyze the local optimal strategies of the defenders given an arbitrary strategy of the attackers. We demonstrate the Nash equilibrium and the mean-field equilibrium for both the defenders and the attackers. Finally, simulation analysis will illustrate the dynamic evolution of the defense strategy of the defenders and the trajectory of the attackers based on the proposed Stackelberg game model.
- 23 April 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (9) , 3538
Open AccessMean-Field Stackelberg Game-Based Security Defense and Resource Optimization in Edge Computing
Edge computing brings computation and storage resources to the edge of the mobile network to solve the problems of low latency and high real-time demand. However, edge computing is more vulnerable to malicious attacks due to its open and dynamic environments. In this article, we investigate security defense strategies in edge computing systems, focusing on scenarios with one attacker and multiple defenders to determine optimal defense strategies with minimal resource allocation. Firstly, we formulate the interactions between the defenders and the attackers as the mean-field Stackelberg game model, where the state and the objective functions of the defenders are coupled through the mean-field term, and are strongly influenced by the strategy of the attacker. Then, we analyze the local optimal strategies of the defenders given an arbitrary strategy of the attackers. We demonstrate the Nash equilibrium and the mean-field equilibrium for both the defenders and the attackers. Finally, simulation analysis will illustrate the dynamic evolution of the defense strategy of the defenders and the trajectory of the attackers based on the proposed Stackelberg game model.
- 13 September 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 237
A learning and potential area-mining evolutionary algorithm for large-scale multi-objective optimization
- 13 September 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 237
A learning and potential area-mining evolutionary algorithm for large-scale multi-objective optimization
- 1 January 2023
- Published by Research Publishing Services
A Short Survey of Large-scale Multi-objective Optimization Algorithms
- 1 January 2023
- Published by Research Publishing Services
A Short Survey of Large-scale Multi-objective Optimization Algorithms
- 2 December 2021
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 35 (16)
A Reference Point Selection and Direction Guidance-Based Algorithm for Large-Scale Multi-Objective Optimization
Designing efficient algorithms for the large-scale multi-objective problems (LSMOPs) is a very challenging problem currently. To tackle LSMOPs, we first design a new reference points selection strategy to enhance the diversity of algorithms and avoid the algorithm falling into local minima. The strategy selects not only a part of nondominated solutions with the largest crowding distance, but also a part of relatively uniformly distributed solutions as the reference points. In this way, much better diversity and convergence can be obtained. Second, we propose a direction-guided offspring generation strategy, where a type of potential directions is designed to generate the promising solutions which can balance the convergence and diversity of the obtained solutions and improve the effectiveness of the algorithm significantly. Based on the two proposed strategies, we propose a new effective algorithm for LSMOPs. Numerical experiments are executed on two widely used large-scale multi-objective benchmark problem sets with 200, 500 and 1000 decision variables and a comparison with five state-of-the-art algorithms is made. The experimental results show that our proposed algorithm is effective and can obtain significantly better solutions than the compared algorithms.
- 2 December 2021
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 35 (16)
A Reference Point Selection and Direction Guidance-Based Algorithm for Large-Scale Multi-Objective Optimization
Designing efficient algorithms for the large-scale multi-objective problems (LSMOPs) is a very challenging problem currently. To tackle LSMOPs, we first design a new reference points selection strategy to enhance the diversity of algorithms and avoid the algorithm falling into local minima. The strategy selects not only a part of nondominated solutions with the largest crowding distance, but also a part of relatively uniformly distributed solutions as the reference points. In this way, much better diversity and convergence can be obtained. Second, we propose a direction-guided offspring generation strategy, where a type of potential directions is designed to generate the promising solutions which can balance the convergence and diversity of the obtained solutions and improve the effectiveness of the algorithm significantly. Based on the two proposed strategies, we propose a new effective algorithm for LSMOPs. Numerical experiments are executed on two widely used large-scale multi-objective benchmark problem sets with 200, 500 and 1000 decision variables and a comparison with five state-of-the-art algorithms is made. The experimental results show that our proposed algorithm is effective and can obtain significantly better solutions than the compared algorithms.
- Open Access
- 29 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 103354-103364
A New Hybrid Algorithm for Solving Large Scale Global Optimization Problems
For large scale global optimization (LSGO) problems, many algorithms have been proposed in recent years. However, there are still some issues to be further handled since the search space grows exponentially and the problem solving becomes more and more difficult as the problem scale becomes larger and larger. In this paper, we propose a new hybrid algorithm for solving large-scale global optimization problems. First, we adopt an existing group algorithm to divide the large-scale problem into several small-scale problems. Second, a modified self-adaptive discrete scan method is designed to roughly scan the whole search space and then focus the search on the promising regions. Third, a hybrid search strategy is proposed, which adaptively chooses the one-dimensional search scheme or the covariance matrix adaptation evolutionary strategy to solve the subproblems of separable, partially (additively) separable problems or non-separable problems, respectively. To demonstrate the performance of the proposed algorithm, we conduct the experiments on 15 difficult LSGO problems in CEC'2013 benchmark suite and compare the performance of the proposed algorithm with that of the several state-of-the-art algorithms. The results show that the proposed algorithm is more effective than the compared algorithms in terms of solution accuracy.
- 29 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 103354-103364
Open AccessA New Hybrid Algorithm for Solving Large Scale Global Optimization Problems
For large scale global optimization (LSGO) problems, many algorithms have been proposed in recent years. However, there are still some issues to be further handled since the search space grows exponentially and the problem solving becomes more and more difficult as the problem scale becomes larger and larger. In this paper, we propose a new hybrid algorithm for solving large-scale global optimization problems. First, we adopt an existing group algorithm to divide the large-scale problem into several small-scale problems. Second, a modified self-adaptive discrete scan method is designed to roughly scan the whole search space and then focus the search on the promising regions. Third, a hybrid search strategy is proposed, which adaptively chooses the one-dimensional search scheme or the covariance matrix adaptation evolutionary strategy to solve the subproblems of separable, partially (additively) separable problems or non-separable problems, respectively. To demonstrate the performance of the proposed algorithm, we conduct the experiments on 15 difficult LSGO problems in CEC'2013 benchmark suite and compare the performance of the proposed algorithm with that of the several state-of-the-art algorithms. The results show that the proposed algorithm is more effective than the compared algorithms in terms of solution accuracy.
- Open Access
- 4 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 81701-81716
A Parameterless Penalty Rule-Based Fitness Estimation for Decomposition-Based Many-Objective Optimization Evolutionary Algorithm
Many-objective optimization problems (MaOPs) present a huge challenge to the traditional Pareto-based multi-objective algorithms because the increase of the objectives results in the low-efficiency of the Pareto dominance in distinguishing the relationships between the solutions during the environmental selection. To enhance the selection pressure, in this paper, through redefining each objective function by a non-linear transformation, we first propose a new dominance method called NLAD-dominance, in which a dynamic parameter adjusting scheme is designed to dynamically adjust parameter α according to different numbers of objectives and different evolutionary states. As a result, NLAD-dominance can provide proper selection pressure for different kinds of MaOPs in different stages of evolution. Then, based on NLAD-dominance, we design a new fitness estimation strategy which takes both convergence and diversity into account, and adaptively balances them by a parameterless penalty rule. Thus, it can well evaluate the quality of each solution. At last, we conduct the experiments and compare the proposed algorithm with five state-of-the-art algorithms on 80 test instances of 16 benchmark problems with up to 20 objectives. The experimental results indicate that the proposed algorithm is highly competitive in terms of both convergence enhancement and diversity maintenance.
- 4 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 81701-81716
Open AccessA Parameterless Penalty Rule-Based Fitness Estimation for Decomposition-Based Many-Objective Optimization Evolutionary Algorithm
Many-objective optimization problems (MaOPs) present a huge challenge to the traditional Pareto-based multi-objective algorithms because the increase of the objectives results in the low-efficiency of the Pareto dominance in distinguishing the relationships between the solutions during the environmental selection. To enhance the selection pressure, in this paper, through redefining each objective function by a non-linear transformation, we first propose a new dominance method called NLAD-dominance, in which a dynamic parameter adjusting scheme is designed to dynamically adjust parameter α according to different numbers of objectives and different evolutionary states. As a result, NLAD-dominance can provide proper selection pressure for different kinds of MaOPs in different stages of evolution. Then, based on NLAD-dominance, we design a new fitness estimation strategy which takes both convergence and diversity into account, and adaptively balances them by a parameterless penalty rule. Thus, it can well evaluate the quality of each solution. At last, we conduct the experiments and compare the proposed algorithm with five state-of-the-art algorithms on 80 test instances of 16 benchmark problems with up to 20 objectives. The experimental results indicate that the proposed algorithm is highly competitive in terms of both convergence enhancement and diversity maintenance.