Shuai Shao

Shuai Shao

Auto-generated profile, based on publicly available information

Shuai Shao

Suzhou Institute for Advanced Research and the School of Artificial Intelligence and Data Science, University of Science and Technology of China, Suzhou, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
17 August 2023 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
YWYan Wang
Yan Wang
JCJian Cheng
Jian Cheng
YCYixin Chen
Yixin Chen
SSShuai Shao
Shuai Shao
LZLanyun Zhu
Lanyun Zhu
HZHaogang Zhu
Haogang Zhu
Medical image segmentation methods normally perform poorly when there is a domain shift between training and testing data. Unsupervised Domain Adaptation (UDA) addresses the domain shift problem by training the model using both labeled data from the source domain and unlabeled data from the target domain. Source-Free UDA (SFUDA) was recently proposed for UDA without requiring the source data during the adaptation, due to data privacy or data transmission issues, which normally adapts the pre-trained deep model in the testing stage. However, in real clinical scenarios of medical image segmentation, the trained model is normally frozen in the testing stage. In this paper, we propose Fourier Visual Prompting (FVP) for SFUDA of medical image segmentation. Inspired by prompting learning in natural language processing, FVP steers the frozen pre-trained model to perform well in the target domain by adding a visual prompt to the input target data. In FVP, the visual prompt is parameterized using only a small amount of low-frequency learnable parameters in the input frequency space, and is learned by minimizing the segmentation loss between the predicted segmentation of the prompted target image and reliable pseudo segmentation label of the target image under the frozen model. To our knowledge, FVP is the first work to apply visual prompts to SFUDA for medical image segmentation. The proposed FVP is validated using three public datasets, and experiments demonstrate that FVP yields better segmentation results, compared with various existing methods.

5 July 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
SSShuai Shao
Shuai Shao
YWYan Wang
Yan Wang
BLBin Liu
Bin Liu
WLWeifeng Liu
Weifeng Liu
YWYanjiang Wang
Yanjiang Wang
BLBao-Di Liu
Bao-Di Liu
Collecting a substantial number of labeled samples is infeasible in many real-world scenarios, thereby bringing out challenges for supervised classification. The research on Few-Shot Classification (FSC) aims to address this issue. Current FSC methods mainly leverage ideas such as meta-learning, self-supervised learning, and data augmentation. Among them, data augmentation appears to be an extremely efficient approach to alleviate the aforementioned data-deficiency problem. Here, we propose a novel data augmentation based FSC method termed Fourier-Augmentation based Data-Shunting (FADS). FADS mainly contains two operations, namely Fourier-based data augmentation (FDA) and data shunting. (i) Fourier transform has a desirable property for classification tasks: the image’s phase and amplitude components in the frequency domain correspond to its high-level structure ( i.e ., semantic) and low-level style ( i.e ., statistic) information, which do not interfere with each other. Inspired by this observation, we design the FDA operation, which changes the amplitude spectrum of the to-be-augmented images to obtain new images of the same category. (ii) Then we design the data shunting operation to cooperate with the FDA to accomplish FSC. Specifically, it splits the augmented data into different groups to get independent, weak decisions and then fuses them to obtain a unified, strong decision. We conduct experiments on four benchmark datasets. Results show that utilizing our method brings a performance gain of 0.3%-2% in terms of classification accuracy, compared with the classical methods.

30 May 2024 in Pattern Recognition
Verified
Journal Article
Closed access
BLBao-Di Liu
Bao-Di Liu
SSShuai Shao
Shuai Shao
CZChunyan Zhao
Chunyan Zhao
LXLei Xing
Lei Xing
WLWeifeng Liu
Weifeng Liu
YZYicong Zhou
Yicong Zhou

21 January 2024 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
RXRui Xu
Rui Xu
SSShuai Shao
Shuai Shao
LXLei Xing
Lei Xing
YWYanjiang Wang
Yanjiang Wang
BLBaodi Liu
Baodi Liu
WLWeifeng Liu
Weifeng Liu

21 November 2022 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
SSShuai Shao
Shuai Shao
LXLei Xing
Lei Xing
YWYanjiang Wang
Yanjiang Wang
BLBao-Di Liu
Bao-Di Liu
WLWeifeng Liu
Weifeng Liu
YZYicong Zhou
Yicong Zhou
Decoupled Few-shot learning (FSL) is an effective methodology that deals with the problem of data-scarce. Its standard paradigm includes two phases: (1) Pre-train. Generating a CNN-based feature extraction model (FEM) via base data. (2) Meta-test. Employing the frozen FEM to obtain the novel data features, then classifying them. Obviously, one crucial factor, the category gap, prevents the development of FSL, i.e., it is challenging for the pre-trained FEM to adapt to the novel class flawlessly. Inspired by a common-sense theory: the FEMs based on different strategies focus on different priorities, we attempt to address this problem from the multi-view feature collaboration (MVFC) perspective. Specifically, we first denoise the multi-view features by subspace learning method, then design three attention blocks (loss-attention block, self-attention block and graph-attention block) to balance the representation between different views. The proposed method is evaluated on four benchmark datasets and achieves significant improvements of 0.9%-5.6% compared with SOTAs.

22 June 2023 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
RXRui Xu
Rui Xu
SSShuai Shao
Shuai Shao
LXLei Xing
Lei Xing
YWYujun Wei
Yujun Wei
WLWeifeng Liu
Weifeng Liu
YWYanjiang Wang
Yanjiang Wang