Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yukun Du

dblp:225/1062 · DBLP profile ↗
← Back
10ranked-venue papers
2as first author
10since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 1 first-author · 5 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Transfer learning and domain adaptation · 23% Optimization for machine learning · 23% 3D vision · 23%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning › black-box optimization
meta-black-box optimization
1.012026
Meta-Black-Box Optimization with Bi-Space Landscape Analysis and Dual-Control Mechanism for SAEA · AAAI 2026
Machine learning › Transfer learning and domain adaptation
meta-learning
1.012026
Meta-Black-Box Optimization with Bi-Space Landscape Analysis and Dual-Control Mechanism for SAEA · AAAI 2026
Computer vision › 3D vision › point cloud segmentation
point cloud semantic segmentation
1.012026
P-SLCR: Unsupervised Point Cloud Semantic Segmentation via Prototypes Structure Learning and Consistent Reasoning · AAAI 2026
Computer vision › Segmentation and scene understanding › annotation-efficient segmentation
unsupervised semantic segmentation
1.012026
P-SLCR: Unsupervised Point Cloud Semantic Segmentation via Prototypes Structure Learning and Consistent Reasoning · AAAI 2026
Mathematical optimization
black-box optimization
1.012026
Meta-Black-Box Optimization with Bi-Space Landscape Analysis and Dual-Control Mechanism for SAEA · AAAI 2026
Mathematical optimization › evolutionary computation
surrogate-assisted evolutionary algorithm
1.012026
Meta-Black-Box Optimization with Bi-Space Landscape Analysis and Dual-Control Mechanism for SAEA · AAAI 2026
Machine learning › Representation and self-supervised learning › prototype learning
prototype-based representation learning
0.312026
P-SLCR: Unsupervised Point Cloud Semantic Segmentation via Prototypes Structure Learning and Consistent Reasoning · AAAI 2026
Mathematical optimization
multi-objective optimization
0.312026
Meta-Black-Box Optimization with Bi-Space Landscape Analysis and Dual-Control Mechanism for SAEA · AAAI 2026

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 2.0exploratory landscape analysis · 2.0attention mechanism · 2.0TabPFN · 2.0prototype learning · 1.0contrastive structure learning · 1.0consistent reasoning · 1.0
YearPublicationVenuePosition
2026 Meta-Black-Box Optimization with Bi-Space Landscape Analysis and Dual-Control Mechanism for SAEA
abstract
Surrogate-Assisted Evolutionary Algorithms (SAEAs) are widely used for expensive Black-Box Optimization. However, their reliance on rigid, manually designed components such as infill criteria and evolutionary strategies during the search process limits their flexibility across tasks. To address these limitations, we propose Dual-Control Bi-Space Surrogate-Assisted Evolutionary Algorithm (DB-SAEA), a Meta-Black-Box Optimization (MetaBBO) framework tailored for multi-objective problems. DB-SAEA learns a meta-policy that jointly regulates candidate generation and infill criterion selection, enabling dual control. The bi-space Exploratory Landscape Analysis (ELA) module in DB-SAEA adopts an attention-based architecture to capture optimization states from both true and surrogate evaluation spaces, while ensuring scalability across problem dimensions, population sizes, and objectives. Additionally, we integrate TabPFN as the surrogate model for accurate and efficient prediction with uncertainty estimation. The framework is trained via reinforcement learning, leveraging parallel sampling and centralized training to enhance efficiency and transferability across tasks. Experimental results demonstrate that DB-SAEA not only outperforms state-of-the-art baselines across diverse benchmarks, but also exhibits strong zero-shot transfer to unseen tasks with higher-dimensional settings. This work introduces the first MetaBBO framework with dual-level control over SAEAs and a bi-space ELA that captures surrogate model information.
Yukun Du, Xiaotong Xie, Lixin Zhan, Yudong Du, Chongshuang Hu, Jiang Jiang 0001
AAAI1
2026 P-SLCR: Unsupervised Point Cloud Semantic Segmentation via Prototypes Structure Learning and Consistent Reasoning
abstract
Current semantic segmentation approaches for point cloud scenes heavily rely on manual labeling, while research on unsupervised semantic segmentation methods specifically for raw point clouds is still in its early stages. Unsupervised point cloud learning poses significant challenges due to the absence of annotation information and the lack of pre-training. The development of effective strategies is crucial in this context. In this paper, we propose a novel prototype library-driven unsupervised point cloud semantic segmentation strategy that utilizes Structure Learning and Consistent Reasoning (P-SLCR). First, we propose a Consistent Structure Learning to establish structural feature learning between consistent points and the library of consistent prototypes by selecting high-quality features. Second, we propose a Semantic Relation Consistent Reasoning that constructs a prototype inter-relation matrix between consistent and ambiguous prototype libraries separately. This process ensures the preservation of semantic consistency by imposing constraints on consistent and ambiguous prototype libraries through the prototype inter-relation matrix. Finally, our method was extensively evaluated on the S3DIS, SemanticKITTI, and Scannet datasets, achieving the best performance compared to unsupervised methods. Specifically, the mIoU of 47.1% is achieved for Area-5 of the S3DIS dataset, surpassing the classical fully supervised method PointNet by 2.5%.
Lixin Zhan, Jie Jiang 0017, Tianjian Zhou, Yukun Du, Xuehu Duan
AAAI4
2026 SpineQFormer: ROI-driven feature fusion and multi-angular regression transformer for spinal image quality assessment
Jianpeng Chen, Yukun Du, Changlin Lv, Yongming Xi, Huan Yang 0001
Signal Process. Image Commun.5
2026 BGC-Net: Bilateral Graph Convolutional Network for Weakly Supervised Semantic Segmentation of Large-Scale Point Clouds
abstract
Weakly-supervised point cloud semantic segmentation (WS-PCS) has attracted increasing attention due to the challenge of sparse annotations. A central problem is how to effectively extract informative features from the annotated points, enabling reliable supervision. Although many existing works extend 2D graph convolution to 3D point cloud data, 2D convolution inherently assumes feature localization, which is an assumption that does not hold in point clouds, and lacks consistent semantic offsets. To address this, we propose a novel Bilateral Graph Convolutional (BGC) method, which refines graph edges into two categories: regular edges and offset edges, providing improved guidance for WS-PCS. Firstly, we create the Local Bilateral Relations (LBR) module to learn the relational features of edges in local point cloud graphs, encompassing both regular and offset edges. To the best of our knowledge, we are the first to utilize offset edges to capture irregular semantic offsets in point cloud data. Secondly, we propose the Adaptive Pooling (AP) module, which adaptively pools edge information learned from LBR, enhancing the feature characterization ability by incorporating salient and pervasive features. Finally, we design BGC as BGC-Net and evaluate its performance against recent networks on four datasets, achieving state-of-the-art results.
Lixin Zhan, Yukun Du, Jie Jiang 0017, Yingmei Wei, Tianjian Zhou, Ziyuan Yang 0001
IEEE Trans. Circuits Syst. Video Technol.2
2025 A novel robust data synthesis method based on feature subspace interpolation to optimize samples with unknown noise
Yukun Du, Yitao Cai, Haiyue Yu 0001, Zhilong Lou, Jiang Jiang 0001, Yongxiong Wang
Inf. Sci.1
2025 Advancements in medical image quality assessment for spinal CT and MRI images
Yushuo Ling, Yukun Du, Yongming Xi, Huan Yang 0001
J. Vis. Commun. Image Represent.5
2024 A high-efficiency local and global detector for diatom-based drowning diagnosis
Jiehang Deng, Jianfa Yang, Haomin Wei, Guosheng Gu, Qingqing Xiang, Yukun Du, Lunke Fei
Eng. Appl. Artif. Intell.6
2024 Using Adaptive Chaotic Grey Wolf Optimization for the daily streamflow prediction
Yukun Du, Yipeng Xu, Bowen Xie, Zehao Lu, Ruiheng Li, Hamanh Bal
Expert Syst. Appl.2
2022 IMLBoost for intelligent diagnosis with imbalanced medical records
abstract
Class imbalance of medical records is a critical challenge for disease classification in intelligent diagnosis. Existing machine learning algorithms usually assign equal weights to all classes, which may reduce classification accuracy of imbalanced records. In this paper, a new Imbalance Lessened Boosting (IMLBoost) algorithm is proposed to better classify imbalanced medical records, highlighting the contribution of samples in minor classes as well as hard and boundary samples. A tailored Cost-Fitting Loss (CFL) function is proposed to assign befitting costs to these critical samples. The first and second derivations of the CFL are then derived and embedded into the classical XGBoost framework. In addition, some feature analysis skills are utilized to further improve performance of the IMLBoost, which also can speed up the model training. Experimental results on five UCI imbalanced medical datasets have demonstrated the effectiveness of the proposed algorithm. Compared with other existing classification methods, IMLBoost has improved the classification performance in terms of F1-score, G-mean and AUC.
Xiaofan Chi, Yukun Du, Huan Yang 0001, Yongming Xi
Intell. Data Anal.3
2022 Attention Gate Based Dual-Pathway Network for Vertebra Segmentation of X-Ray Spine Images
abstract
Automatic spine and vertebra segmentation from X-ray spine images is a critical and challenging problem in many computer-aid spinal image analysis and disease diagnosis applications. In this paper, a two-stage automatic segmentation framework for spine X-ray images is proposed, which can firstly locate the spine regions (including backbone, sacrum and ilium) in the coarse stage and then identify eighteen vertebrae (i.e., cervical vertebra 7, thoracic vertebra 1-12 and lumbar vertebra 1-5) with isolate and clear boundary in the fine stage. A novel Attention Gate based dual-pathway Network (AGNet) composed of context and edge pathways is designed to extract semantic and boundary information for segmentation of both spine and vertebra regions. Multi-scale supervision mechanism is applied to explore comprehensive features and an Edge aware Fusion Mechanism (EFM) is proposed to fuse features extracted from the two pathways. Some other image processing skills, such as centralized backbone clipping, patch cropping and convex hull detection are introduced to further refine the vertebra segmentation results. Experimental validations on spine X-ray images dataset and vertebrae dataset suggest that the proposed AGNet achieves superior performance compared with state-of-the-art segmentation methods, and the coarse-to-fine framework can be implemented in real spinal diagnosis systems.
Tongshuai Xu, Huan Yang 0001, Yongming Xi, Yukun Du, Jinxu Li
IEEE J. Biomed. Health Informatics5