Yuan Sui
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yuan Sui has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Yujie Zhang
School of Computer Science and Engineering, Northeastern University, Shenyang, China
5 shared publications - Ying Wei
College of Information Science and Engineering, Northeastern University, Shenyang, China
3 shared publications - Bin Wang
School of Computer Science and Engineering, Northeastern University, China; National Frontiers Science Center for Industrial Intelligence and Systems Optimization, China; Key Laboratory of Data Analytics and Optimization for Smart Industry (Northeastern University), Ministry of Education, China
2 shared publications - Gang Yang
College of Information Science and Engineering, Northeastern University, Shenyang 110167, China
2 shared publications - Xiaochun Yang
Software College, Northeastern University, China
2 shared publications - Baihua Zheng
Singapore Management University
1 shared publication
Latest Publications
- 16 September 2026
- Published by Elsevier in Neurocomputing
- Vol. 708
Matrix-based representation of mesh surface deformation for mesh-driven 3DGS
- 16 September 2026
- Published by Elsevier in Neurocomputing
- Vol. 708
Matrix-based representation of mesh surface deformation for mesh-driven 3DGS
- Open Access
- 9 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (12) , 2059
BAFNet: A Few-Shot Segmentation Algorithm Based on Two-Stage Backbone Network Adaptation Fine-Tuning via Meta-Learning
The objective of few-shot segmentation is to segment novel categories given only a few annotated support images. Current FSS methods typically rely on pretrained backbone networks while often overlooking the inherent discrepancy between pretraining tasks and downstream segmentation tasks. This oversight renders the models susceptible to noise interference and hinders rapid generalization to novel categories. To address these limitations, we propose BAFNet, a novel few-shot segmentation algorithm based on two-stage backbone adaptive fine-tuning. Our approach incorporates a Feature Activation Adapter module into the backbone network, which operates through similarity feature enhancement and low-dimensional adaptive learning. Building upon this foundation, we develop an adapter-based fine-tuning strategy for the training phase that enhances the backbone network’s capacity for extracting category-relevant features while optimizing similarity representation of the extracted features. Additionally, we introduce a support set-driven, in-episode, online fine-tuning strategy for the testing phase, which leverages data augmentation to generate pseudo-query sets for supervised fine-tuning optimization. Through comprehensive quantitative and qualitative experiments conducted on PASCAL-5i, COCO-20i, and the industrial MT Defect Dataset, our results demonstrate that the proposed BAFNet model achieves state-of-the-art few-shot segmentation performance while utilizing the minimal number of trainable parameters. Our method obtains superior performance for both the mean intersection over union and foreground-background intersection over union evaluation metrics, exhibiting remarkable applicability for both general images in complex scenes and industrial defect segmentation under few-shot conditions.
- 9 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (12) , 2059
Open AccessBAFNet: A Few-Shot Segmentation Algorithm Based on Two-Stage Backbone Network Adaptation Fine-Tuning via Meta-Learning
The objective of few-shot segmentation is to segment novel categories given only a few annotated support images. Current FSS methods typically rely on pretrained backbone networks while often overlooking the inherent discrepancy between pretraining tasks and downstream segmentation tasks. This oversight renders the models susceptible to noise interference and hinders rapid generalization to novel categories. To address these limitations, we propose BAFNet, a novel few-shot segmentation algorithm based on two-stage backbone adaptive fine-tuning. Our approach incorporates a Feature Activation Adapter module into the backbone network, which operates through similarity feature enhancement and low-dimensional adaptive learning. Building upon this foundation, we develop an adapter-based fine-tuning strategy for the training phase that enhances the backbone network’s capacity for extracting category-relevant features while optimizing similarity representation of the extracted features. Additionally, we introduce a support set-driven, in-episode, online fine-tuning strategy for the testing phase, which leverages data augmentation to generate pseudo-query sets for supervised fine-tuning optimization. Through comprehensive quantitative and qualitative experiments conducted on PASCAL-5i, COCO-20i, and the industrial MT Defect Dataset, our results demonstrate that the proposed BAFNet model achieves state-of-the-art few-shot segmentation performance while utilizing the minimal number of trainable parameters. Our method obtains superior performance for both the mean intersection over union and foreground-background intersection over union evaluation metrics, exhibiting remarkable applicability for both general images in complex scenes and industrial defect segmentation under few-shot conditions.
- Open Access
- 21 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (6) , 1067
JDC-DA: An Unsupervised Target Domain Algorithm for Alzheimer’s Disease Diagnosis with Structural MRI Using Joint Domain and Category Dual Adaptation
Domain shift in multi-source MRI imaging data significantly degrades the performance of Alzheimer’s disease diagnostic models. This study aims to develop an effective unsupervised domain adaptation method to enhance diagnostic accuracy across different clinical datasets. We propose a Joint Domain and Category Dual Adaptation framework (JDC-DA) that integrates metric learning and adversarial learning. The method employs multi-scale feature aggregation to capture diverse lesion characteristics, generates dynamic prototype features through category clustering, and implements a novel metric learning approach that simultaneously aligns both domain-level and category-level feature distributions. Additionally, we introduce a classification certainty maximization strategy that establishes a dual adversarial mechanism between domain discriminator and classification discrepancy discriminator. The framework was evaluated on four public datasets (ADNI-1, ADNI-2, ADNI-3, AIBL) containing 1230 baseline sMRI scans for four classification tasks: AD vs. NC, MCI vs. NC, AD vs. MCI, and AD vs. MCI vs. NC. The proposed JDC-DA method achieved superior performance with accuracies of 92.16%, 83.56%, 81.96%, and 79.12% for the four classification tasks respectively, significantly outperforming existing state-of-the-art domain adaptation methods across all evaluation metrics. The JDC-DA framework effectively addresses domain shift challenges in Alzheimer’s disease diagnosis through its integrated approach to feature alignment and adversarial learning. The method demonstrates strong potential for clinical application in automated diagnosis systems, particularly for handling multi-center neuroimaging data with distribution discrepancies.
- 21 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (6) , 1067
Open AccessJDC-DA: An Unsupervised Target Domain Algorithm for Alzheimer’s Disease Diagnosis with Structural MRI Using Joint Domain and Category Dual Adaptation
Domain shift in multi-source MRI imaging data significantly degrades the performance of Alzheimer’s disease diagnostic models. This study aims to develop an effective unsupervised domain adaptation method to enhance diagnostic accuracy across different clinical datasets. We propose a Joint Domain and Category Dual Adaptation framework (JDC-DA) that integrates metric learning and adversarial learning. The method employs multi-scale feature aggregation to capture diverse lesion characteristics, generates dynamic prototype features through category clustering, and implements a novel metric learning approach that simultaneously aligns both domain-level and category-level feature distributions. Additionally, we introduce a classification certainty maximization strategy that establishes a dual adversarial mechanism between domain discriminator and classification discrepancy discriminator. The framework was evaluated on four public datasets (ADNI-1, ADNI-2, ADNI-3, AIBL) containing 1230 baseline sMRI scans for four classification tasks: AD vs. NC, MCI vs. NC, AD vs. MCI, and AD vs. MCI vs. NC. The proposed JDC-DA method achieved superior performance with accuracies of 92.16%, 83.56%, 81.96%, and 79.12% for the four classification tasks respectively, significantly outperforming existing state-of-the-art domain adaptation methods across all evaluation metrics. The JDC-DA framework effectively addresses domain shift challenges in Alzheimer’s disease diagnosis through its integrated approach to feature alignment and adversarial learning. The method demonstrates strong potential for clinical application in automated diagnosis systems, particularly for handling multi-center neuroimaging data with distribution discrepancies.
- 15 July 2025
- Published by Elsevier in Journal of Neuroscience Methods
- Vol. 423, 110522
CSCE: Cross Supervising and Confidence Enhancement pseudo-labels for semi-supervised subcortical brain structure segmentation
- 15 July 2025
- Published by Elsevier in Journal of Neuroscience Methods
- Vol. 423, 110522
CSCE: Cross Supervising and Confidence Enhancement pseudo-labels for semi-supervised subcortical brain structure segmentation
- Open Access
- 17 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (3) , 1-27
Wait and See: A Delayed Transactions Partitioning Approach in Deterministic Database Systems for Better Performance
Deterministic databases are revolutionizing batch transaction processing in shared-nothing architectures, with efficiency largely hinging on minimizing cross-partition operations. However, achieving a universal data partition that eliminates cross-partition operations is often impractical. Thus, developing effective transaction partitioning strategies becomes crucial. Existing methods tend to partition and optimize transactions individually, neglecting the overarching commonalities between transactions within a batch. This oversight results in suboptimal partitioning of transactions that share similar read-write sets, ultimately missing opportunities for global batch execution optimization. In this paper, we present DelayPart, a deterministic database transaction engine that employs a ''wait and see'' strategy to address contextual conflicts between transactions within each batch. DelayPart models transaction batch partitioning as a k -cut problem based on transaction similarity and employs a LSH forest-based approach to approximate solutions efficiently in linear time, factoring in the global overhead of remote operations for each batch. By postponing the allocation and execution of individual transactions, DelayPart systematically analyzes inter-transaction relationships, enhancing overall performance without compromising execution efficiency. We evaluated DelayPart's performance against various benchmarks on a large-scale cluster, demonstrating that it significantly outperforms state-of-the-art transaction partitioning methods.
- 17 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (3) , 1-27
Open AccessWait and See: A Delayed Transactions Partitioning Approach in Deterministic Database Systems for Better Performance
Deterministic databases are revolutionizing batch transaction processing in shared-nothing architectures, with efficiency largely hinging on minimizing cross-partition operations. However, achieving a universal data partition that eliminates cross-partition operations is often impractical. Thus, developing effective transaction partitioning strategies becomes crucial. Existing methods tend to partition and optimize transactions individually, neglecting the overarching commonalities between transactions within a batch. This oversight results in suboptimal partitioning of transactions that share similar read-write sets, ultimately missing opportunities for global batch execution optimization. In this paper, we present DelayPart, a deterministic database transaction engine that employs a ''wait and see'' strategy to address contextual conflicts between transactions within each batch. DelayPart models transaction batch partitioning as a k -cut problem based on transaction similarity and employs a LSH forest-based approach to approximate solutions efficiently in linear time, factoring in the global overhead of remote operations for each batch. By postponing the allocation and execution of individual transactions, DelayPart systematically analyzes inter-transaction relationships, enhancing overall performance without compromising execution efficiency. We evaluated DelayPart's performance against various benchmarks on a large-scale cluster, demonstrating that it significantly outperforms state-of-the-art transaction partitioning methods.
- 29 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (5) , 3575-3584
ScorpioBase: An Efficient Batched Blockchain System for Traceability Applications in Supply Chain
Blockchain is increasingly applied to traceability applications in supply chains for its tamper-proof nature, but it must also ensure the core requirements, which are efficient data storage and verifiable queries. Existing solutions create an authenticated data structure (ADS) for each tuple and use a Merkle variant on a blockchain to maintain evidence. However, consensus algorithms slow down block generation, and limited block capacity results in excessive blockchain space usage by ADS, failing to meet efficient data storage needs. In this article, we present ScorpioBase, a batched blockchain system with two components: the storage engine (SE) and the signature manager (SM). SE packages multiple tuples into a “batch” data structure and generates a “batch” signature. SM stores the “batch” signature on the blockchain for evidence. Batching effectively reduces the blockchain storage burden, allowing the system to store more tuples with the same number of consensus events, thus increasing throughput. We design a fine-grained “batch” signature to enable ScorpioBase to support verifiable queries. “Batch” signatures can efficiently verify the integrity of both the “batch” and each tuple within it. In conclusion, ScorpioBase supports asynchronous queries for varying security and efficiency needs and ensures robustness against malicious attacks in verifiable queries. Compared to existing solutions, it significantly improves data storage capacity and the efficiency of verifiable queries.
- 29 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (5) , 3575-3584
ScorpioBase: An Efficient Batched Blockchain System for Traceability Applications in Supply Chain
Blockchain is increasingly applied to traceability applications in supply chains for its tamper-proof nature, but it must also ensure the core requirements, which are efficient data storage and verifiable queries. Existing solutions create an authenticated data structure (ADS) for each tuple and use a Merkle variant on a blockchain to maintain evidence. However, consensus algorithms slow down block generation, and limited block capacity results in excessive blockchain space usage by ADS, failing to meet efficient data storage needs. In this article, we present ScorpioBase, a batched blockchain system with two components: the storage engine (SE) and the signature manager (SM). SE packages multiple tuples into a “batch” data structure and generates a “batch” signature. SM stores the “batch” signature on the blockchain for evidence. Batching effectively reduces the blockchain storage burden, allowing the system to store more tuples with the same number of consensus events, thus increasing throughput. We design a fine-grained “batch” signature to enable ScorpioBase to support verifiable queries. “Batch” signatures can efficiently verify the integrity of both the “batch” and each tuple within it. In conclusion, ScorpioBase supports asynchronous queries for varying security and efficiency needs and ensures robustness against malicious attacks in verifiable queries. Compared to existing solutions, it significantly improves data storage capacity and the efficiency of verifiable queries.