Yusong Tan

Dr. Yusong Tan


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications

22 October 2022 in Neural Networks
Verified
Journal Article
Open access
XLXin Luo
Xin Luo
WCWei Chen
Wei Chen
ZLZhengfa Liang
Zhengfa Liang
CLChen Li
Chen Li
YTYusong Tan
Yusong Tan
Mainstream unsupervised domain adaptation (UDA) methods align feature distributions across different domains via adversarial learning. However, most of them focus on global distribution alignment, ignoring the fine-grained domain discrepancy. Besides, they generally require auxiliary models, bringing extra computation costs. To tackle these issues, this study proposes an UDA method that differentiates individual samples without the help of extra models. To this end, we introduce a novel discrepancy metric, termed style discrepancy, to distinguish different target samples. We also propose a paradigm for adversarial style discrepancy minimization (ASDM). Specifically, we fix the parameters of the feature extractor and maximize style discrepancy to update the classifier, which helps detect more hard samples. Adversely, we fix the parameters of the classifier and minimize the style discrepancy to update the feature extractor, pushing those hard samples near the support of the source distribution. Such adversary helps to progressively detect and adapt more hard samples, leading to fine-grained domain adaptation. Experiments on different UDA tasks validate the effectiveness of ASDM. Overall, without any extra models, ASDM reaches a 46.9% mIoU in the GTA5 to Cityscapes benchmark and an 84.7% accuracy in the VisDA-2017 benchmark, outperforming many existing adversarial-learning-based methods.

9 April 2024 in Information Sciences
Verified
Journal Article
Closed access
YZYusen Zhang
Yusen Zhang
YQYunchuan Qin
Yunchuan Qin
YZYufeng Zhang
Yufeng Zhang
XZXu Zhou
Xu Zhou
SJSonglei Jian
Songlei Jian
KLKenli Li
Kenli Li

2 January 2026 in Neural Networks
Verified
Journal Article
Closed access
RZRuyi Zhang
Ruyi Zhang
HXHongzuo Xu
Hongzuo Xu
SJSonglei Jian
Songlei Jian
YTYusong Tan
Yusong Tan
HZHaifang Zhou
Haifang Zhou
RXRulin Xu
Rulin Xu


29 September 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
CLChen Li
Chen Li
WCWei Chen
Wei Chen
YTYusong Tan
Yusong Tan
Malignant lesions are a huge threat to human health and have a high mortality rate. Locating the contour of organs is a preparation step, and it helps doctors diagnose correctly. Therefore, there is an urgent clinical need for a segmentation model specifically designed for medical imaging. However, most current medical image segmentation models directly migrate from natural image segmentation models, thus ignoring some characteristic features for medical images, such as false positive phenomena and the blurred boundary problem in 3D volume data. The research on organ segmentation models for medical images is still challenging and demanding. As a consequence, we redesign a 3D convolutional neural network (CNN) based on 3D U-Net and adopted the render method from computer graphics for 3D medical images segmentation, named Render 3D U-Net. This network adapts a subdivision-based point-sampling method to replace the original upsampling method for rendering high-quality boundaries. Besides, Render 3D U-Net integrates the point-sampling method into 3D ANU-Net architecture under deep supervision. Meanwhile, to reduce false positive phenomena in clinical diagnosis and to achieve more accurate segmentation, Render 3D U-Net specially designs a module for screening false positive. Finally, three public challenge datasets (MICCAI 2017 LiTS, MICCAI 2019 KiTS, and ISBI 2019 segTHOR) were selected as experiment datasets and to evaluate the performance on target organs. Compared with other models, Render 3D U-Net improved the performance on both overall organ and boundary in the CT image segmentation tasks, including in the liver, kidney, and heart.