Yuxin Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuxin Zhao has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Xiaobo Li
School of Computer Science and Technology, Zhejiang Normal University, Jinhua, China
11 shared publications - Junwei Dong
College of Mathematics and Computer Science, Zhejiang Normal University, Jinhua, China
5 shared publications - Shaolang Li
College of Mathematics and Computer Science, Zhejiang Normal University, Jinhua, China
5 shared publications - Hui Chen
College of Mathematics and Computer Science, Zhejiang Normal University, Jinhua, China
4 shared publications - Zhendi Ma
School of Computer Science and Technology, Zhejiang Normal University, Jinhua, China
4 shared publications - Hui Wang
Zhejiang Normal University
2 shared publications
Latest Publications
- 16 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 75 (00189456) , 1-14
DSCNet: Dimensional Characteristic and Semantic Hierarchy Collaborative Network With Multiscale Spatial-Channel Enhancement for Accurate Polyp Segmentation
Automatic polyp segmentation is a key task in colonoscopic image analysis. It provides the basis for polyp size estimation, boundary localization, and morphological analysis to support clinical decision-making. However, variations in polyp shape and size and low image contrast often lead to unstable boundary delineation and spatial localization, resulting in structural measurement bias. To address this issue, we propose DSCNet, a polyp segmentation network designed to improve structural measurement stability by jointly modeling hierarchical semantic features and dimensional characteristics. For low- and mid-level features, a Channel Synergistic Local Enhancement (CSLE) module is introduced, which combines local convolutional modeling with channel-wise visual cues to enhance boundary discrimination and multi-scale morphological consistency. For high-level features, a Multi-scale Spatial Perception Regulation (MSPR) module is designed to strengthen the perception of low-contrast regions through directional and multi-scale spatial modeling, thereby improving the reliability of polyp size estimation and spatial localization. In addition, a Hierarchical Attention-guided Fusion (HAF) module is employed to alleviate semantic discrepancies across feature levels and further refine boundary structures. Experimental results on five public polyp datasets demonstrate that DSCNet consistently outperforms existing methods. In particular, on the challenging ETIS dataset dominated by small polyps, DSCNet achieves approximately a 1.8% relative improvement in Dice and an 8.0% relative reduction in HD95 compared with the best baseline, indicating superior spatial localization stability and boundary accuracy.
- 16 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 75 (00189456) , 1-14
DSCNet: Dimensional Characteristic and Semantic Hierarchy Collaborative Network With Multiscale Spatial-Channel Enhancement for Accurate Polyp Segmentation
Automatic polyp segmentation is a key task in colonoscopic image analysis. It provides the basis for polyp size estimation, boundary localization, and morphological analysis to support clinical decision-making. However, variations in polyp shape and size and low image contrast often lead to unstable boundary delineation and spatial localization, resulting in structural measurement bias. To address this issue, we propose DSCNet, a polyp segmentation network designed to improve structural measurement stability by jointly modeling hierarchical semantic features and dimensional characteristics. For low- and mid-level features, a Channel Synergistic Local Enhancement (CSLE) module is introduced, which combines local convolutional modeling with channel-wise visual cues to enhance boundary discrimination and multi-scale morphological consistency. For high-level features, a Multi-scale Spatial Perception Regulation (MSPR) module is designed to strengthen the perception of low-contrast regions through directional and multi-scale spatial modeling, thereby improving the reliability of polyp size estimation and spatial localization. In addition, a Hierarchical Attention-guided Fusion (HAF) module is employed to alleviate semantic discrepancies across feature levels and further refine boundary structures. Experimental results on five public polyp datasets demonstrate that DSCNet consistently outperforms existing methods. In particular, on the challenging ETIS dataset dominated by small polyps, DSCNet achieves approximately a 1.8% relative improvement in Dice and an 8.0% relative reduction in HD95 compared with the best baseline, indicating superior spatial localization stability and boundary accuracy.
- 2 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 303
VasCA-Net: A vascular channel attention network for retinal vessel segmentation
- 2 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 303
VasCA-Net: A vascular channel attention network for retinal vessel segmentation
- 29 August 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 184
TPCMEA: A tri-population evolutionary algorithm with adaptive stage-switching for complex CMOPs
- 29 August 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 184
TPCMEA: A tri-population evolutionary algorithm with adaptive stage-switching for complex CMOPs
- Open Access
- 10 August 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (8) , 523
A Hybrid Ensemble Equilibrium Optimizer Gene Selection Algorithm for Microarray Data
As modern medical technology advances, the utilization of gene expression data has proliferated across diverse domains, particularly in cancer diagnosis and prognosis monitoring. However, gene expression data is often characterized by high dimensionality and a prevalence of redundant and noisy information, prompting the need for effective strategies to mitigate issues like the curse of dimensionality and overfitting. This study introduces a novel hybrid ensemble equilibrium optimizer gene selection algorithm in response. In the first stage, a hybrid approach, combining multiple filters and gene correlation-based methods, is used to select an optimal subset of genes, which is achieved by evaluating the redundancy and complementary relationships among genes to obtain a subset with maximal information content. In the second stage, an equilibrium optimizer algorithm incorporating Gaussian Barebone and a novel gene pruning strategy is employed to further search for the optimal gene subset within the candidate gene space selected in the first stage. To demonstrate the superiority of the proposed method, it was compared with nine feature selection techniques on 15 datasets. The results indicate that the ensemble filtering method in the first stage exhibits strong stability and effectively reduces the search space of the gene selection algorithms. The improved equilibrium optimizer algorithm enhances the prediction accuracy while significantly reducing the number of selected features. These findings highlight the effectiveness of the proposed method as a valuable approach for gene selection.
- 10 August 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (8) , 523
Open AccessA Hybrid Ensemble Equilibrium Optimizer Gene Selection Algorithm for Microarray Data
As modern medical technology advances, the utilization of gene expression data has proliferated across diverse domains, particularly in cancer diagnosis and prognosis monitoring. However, gene expression data is often characterized by high dimensionality and a prevalence of redundant and noisy information, prompting the need for effective strategies to mitigate issues like the curse of dimensionality and overfitting. This study introduces a novel hybrid ensemble equilibrium optimizer gene selection algorithm in response. In the first stage, a hybrid approach, combining multiple filters and gene correlation-based methods, is used to select an optimal subset of genes, which is achieved by evaluating the redundancy and complementary relationships among genes to obtain a subset with maximal information content. In the second stage, an equilibrium optimizer algorithm incorporating Gaussian Barebone and a novel gene pruning strategy is employed to further search for the optimal gene subset within the candidate gene space selected in the first stage. To demonstrate the superiority of the proposed method, it was compared with nine feature selection techniques on 15 datasets. The results indicate that the ensemble filtering method in the first stage exhibits strong stability and effectively reduces the search space of the gene selection algorithms. The improved equilibrium optimizer algorithm enhances the prediction accuracy while significantly reducing the number of selected features. These findings highlight the effectiveness of the proposed method as a valuable approach for gene selection.
- 30 October 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 239
An improved binary dandelion algorithm using sine cosine operator and restart strategy for feature selection
- 30 October 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 239
An improved binary dandelion algorithm using sine cosine operator and restart strategy for feature selection
- 24 December 2022
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 119
A hybrid adaptive Differential Evolution based on Gaussian tail mutation
- 24 December 2022
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 119
A hybrid adaptive Differential Evolution based on Gaussian tail mutation
- 17 June 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 125
A binary dandelion algorithm using seeding and chaos population strategies for feature selection
- 17 June 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 125
A binary dandelion algorithm using seeding and chaos population strategies for feature selection
- Open Access
- 16 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 66811-66830
Improved Slime Mould Algorithm Hybridizing Chaotic Maps and Differential Evolution Strategy for Global Optimization
Slime Mould Algorithm (SMA) is a new meta-heuristics algorithm that is inspired by the behaviors of slime mould from nature. Due to its effective performance, SMA has shown its competitive performance among other meta-heuristics algorithms and has been used in many mathematical optimization and real-world problems. However, SMA tends to sink into local optimality and lacks the diversity of the population. Therefore, to cope with the drawbacks of the classical SMA, this paper proposes an improved SMA algorithm named CHDESMA. First of all, the chaotic maps methods have the characteristics of ergodicity and randomness, and we used chaotic maps methods to replace the original random initialization to improve the diversity of the algorithm, which is more suitable for exploring the potential areas in the early stage. Then, based on the superior searching ability of the differential evolution algorithm (DE), the crossover and selection operations of DE are applied to CHDESMA, and the position is updated by the combination of the original SMA operator and the mutation strategy of DE, which effectively avoids the algorithm falling into local optimum. CHDESMA was evaluated using CEC2014 and CEC2017 test suits and four real-world engineering problems. CHDESMA was compared with advanced algorithms and DE variants. The experimental results and statistical analysis indicate that CHDESMA has competitive performance compared with the state-of-the-art algorithms.
- 16 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 66811-66830
Open AccessImproved Slime Mould Algorithm Hybridizing Chaotic Maps and Differential Evolution Strategy for Global Optimization
Slime Mould Algorithm (SMA) is a new meta-heuristics algorithm that is inspired by the behaviors of slime mould from nature. Due to its effective performance, SMA has shown its competitive performance among other meta-heuristics algorithms and has been used in many mathematical optimization and real-world problems. However, SMA tends to sink into local optimality and lacks the diversity of the population. Therefore, to cope with the drawbacks of the classical SMA, this paper proposes an improved SMA algorithm named CHDESMA. First of all, the chaotic maps methods have the characteristics of ergodicity and randomness, and we used chaotic maps methods to replace the original random initialization to improve the diversity of the algorithm, which is more suitable for exploring the potential areas in the early stage. Then, based on the superior searching ability of the differential evolution algorithm (DE), the crossover and selection operations of DE are applied to CHDESMA, and the position is updated by the combination of the original SMA operator and the mutation strategy of DE, which effectively avoids the algorithm falling into local optimum. CHDESMA was evaluated using CEC2014 and CEC2017 test suits and four real-world engineering problems. CHDESMA was compared with advanced algorithms and DE variants. The experimental results and statistical analysis indicate that CHDESMA has competitive performance compared with the state-of-the-art algorithms.