Yushun Xiao

Yushun Xiao

Auto-generated profile, based on publicly available information

Yushun Xiao

College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 December 2021 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
JSJiaquan Shen
Jiaquan Shen
NLNingzhong Liu
Ningzhong Liu
CXChenglu Xu
Chenglu Xu
HSHan Sun
Han Sun
YXYushun Xiao
Yushun Xiao
YZYongxin Zhang
Yongxin Zhang
Even though the deep neural networks have strong feature representation capability and high recognition accuracy in finger vein recognition, the deep models are computationally intensive and poor in timeliness. To address these issues, this article proposes a lightweight algorithm for finger vein image recognition and matching. The proposed algorithm uses a lightweight convolutional model in the backbone network and employs a triplet loss function to train the model, which not only improves the matching accuracy, but also satisfies the real-time matching requirements. In addition, the Mini-region of interest (RoI) and finger vein pattern feature extraction also effectively solve the problems of large amounts of calculation and background noise. Moreover, the present model recognizes new categories based on the feature vector space constructed by the finger vein recognition system, so that new categories can be recognized without retraining the model. The results show that the finger vein recognition and matching algorithm proposed in this article achieves 99.3% and 99.6% in recognition accuracy and 14.2 and 16.5 ms in matching time for the dataset Shandong University Machine Learning and Applications Laboratory-Homologous Multimodal Biometric Traits (SDUMLA-HMT) and Peking University Finger Vein Dataset (PKU-FVD), respectively. These metrics show that our approach is time-saving and more effective than previous algorithms. Compared with the state-of-the-art finger vein recognition algorithm, the proposed algorithm improves 1.45% in recognition accuracy while saving 45.7% in recognition time.

28 April 2020 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
XCXinye Cai
Xinye Cai
YXYushun Xiao
Yushun Xiao
MLMiqing Li
Miqing Li
HHHan Hu
Han Hu
HIHisao Ishibuchi
Hisao Ishibuchi
XLXiaoping Li
Xiaoping Li
Assessing the performance of Pareto front (PF) approximations is a key issue in the field of evolutionary multi/many-objective optimization. Inverted Generational Distance (IGD) has been widely accepted as a performance indicator for evaluating the comprehensive quality for a PF approximation. However, IGD usually becomes infeasible when facing a realworld optimization problem as it needs to know the true PF a priori. In addition, the time complexity of IGD grows quadratically with the size of the solution/reference set. To address the aforementioned issues, a grid-based IGD (Grid-IGD) is proposed to estimate both convergence and diversity of PF approximations for multi/many-objective optimization. In Grid-IGD, a set of reference points is generated by estimating PFs of the problem in question, based on the representative nondominated solutions of all the approximations in a grid environment. To reduce the time complexity, Grid-IGD only considers the closest solution within the grid neighborhood in the approximation for every reference point. Grid-IGD also possesses other desirable properties such as Pareto compliance, immunity to dominated/duplicate solutions and no need of normalization. In the experimental studies, Grid-IGD is verified on both the artificial and real PF approximations obtained by five many-objective optimizers. Effects of the grid specification on the behavior of Grid-IGD are also discussed in detail theoretically and experimentally.

17 August 2021 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
XCXinye Cai
Xinye Cai
YXYushun Xiao
Yushun Xiao
ZLZhenhua Li
Zhenhua Li
QSQi Sun
Qi Sun
HXHanchuan Xu
Hanchuan Xu
HIHisao Ishibuchi
Hisao Ishibuchi
How to evaluate Pareto front approximations generated by multi/many-objective optimizers is a critical issue in the field of multiobjective optimization. Currently, there exist two types of comprehensive quality indicators (i.e., volume-based and distance-based indicators). Distance-based indicators, such as inverted generational distance (IGD), are usually computed by summing up the distance of each reference point to its nearest solution. Their high computational efficiency leads to their prevalence in many-objective optimization. However, in the existing distance-based indicators, the distributions of the solution sets are usually neglected, leading to their lack of ability to well distinguish between different solution sets. This phenomenon may become even more severe in high-dimensional space. To address such an issue, a kernel-based indicator (KBI) is proposed as a comprehensive indicator. Different from other distance-based indicators, a kernel-based maximum mean discrepancy is adopted in KBI for directly measuring the difference that can characterize the convergence, spread, and uniformity of two sets, i.e., the solution set and reference set, by embedding them in reproducing kernel Hilbert space (RKHS). As a result, KBI not only reflects the distance between the solution set and the reference set but also can reflect the distribution of the solution set itself. In addition, to maintain the desirable weak Pareto compliance property of KBI, a nondominated set reconstruction approach is also proposed to shift the original solution set. The detailed theoretical and experimental analysis of KBI is provided in this article. The properties of KBI have also been analyzed by the optimal $\mu $ -distribution.

24 June 2025 in IEEE Transactions on Affective Computing
Verified
Journal Article
Closed access
YXYushun Xiao
Yushun Xiao
WZWenming Zheng
Wenming Zheng
GZGuoying Zhao
Guoying Zhao
Recently, topological graphs based on structural or functional connectivity of brain network have been utilized to construct graph neural networks (GNN) for Electroencephalogram (EEG) emotion recognition. In this paper, we propose a novel dynamical causal graph neural network (DCGNN) based on the effective causal connectivity of brain function network for EEG emotion recognition, in which Greedy Equivalence Search (GES) is used to find the optimal causal graph topology associated with the adjacent matrix of DCGNN. To this end, we firstly construct a skeleton graph using canonical correlation analysis (CCA) and then use GES to optimize the directional graph topology of DCGNN. Then, learnable weight parameters associated with the adjacent matrix are learnt during the model training of DCGNN. Additionally, a sparse graphic constraint is employed to enhance the efficacy of emotion recognition, while a Conditional Domain Adversarial Network (CDAN) is used to integrate features with emotion labels for improving subjectindependent validation. Extensive experiments and ablation studies are conducted on five public datasets, i.e., SEED, SEED-IV, SEED-V, MPED, and FACED, demonstrating that the proposed model surpasses recent causal based (Granger causality) and domain adaptation based GNN models across all experimental settings.

13 October 2026 in Expert Systems with Applications
Verified
Journal Article
Closed access
YXYushun Xiao
Yushun Xiao
CLCheng Lu
Cheng Lu
TZTao Zhao
Tao Zhao
XJXingxun Jiang
Xingxun Jiang
HLhailun lian
hailun lian
Yuan ZongYuan Zong
Yuan Zong