Kaixin Xu

Kaixin Xu

Auto-generated profile, based on publicly available information

Kaixin Xu

Institute for Infocomm Research, A*STAR, Singapore, Singapore

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
13 October 2022 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
ZZZiyuan Zhao
Ziyuan Zhao
FZFangcheng Zhou
Fangcheng Zhou
KXKaixin Xu
Kaixin Xu
ZZZeng Zeng
Zeng Zeng
CGCuntai Guan
Cuntai Guan
SZS. Kevin Zhou
S. Kevin Zhou
While deep learning methods hitherto have achieved considerable success in medical image segmentation, they are still hampered by two limitations: (i) reliance on large-scale well-labeled datasets, which are difficult to curate due to the expert-driven and time-consuming nature of pixel-level annotations in clinical practices, and (ii) failure to generalize from one domain to another, especially when the target domain is a different modality with severe domain shifts. Recent unsupervised domain adaptation (UDA) techniques leverage abundant labeled source data together with unlabeled target data to reduce the domain gap, but these methods degrade significantly with limited source annotations. In this study, we address this underexplored UDA problem, investigating a challenging but valuable realistic scenario, where the source domain not only exhibits domain shift w.r.t. the target domain but also suffers from label scarcity. In this regard, we propose a novel and generic framework called “Label-Efficient Unsupervised Domain Adaptation” (LE-UDA). In LE-UDA, we construct self-ensembling consistency for knowledge transfer between both domains, as well as a self-ensembling adversarial learning module to achieve better feature alignment for UDA. To assess the effectiveness of our method, we conduct extensive experiments on two different tasks for cross-modality segmentation between MRI and CT images. Experimental results demonstrate that the proposed LE-UDA can efficiently leverage limited source labels to improve cross-domain segmentation performance, outperforming state-of-the-art UDA approaches in the literature.

18 January 2021 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
ZZZiyuan Zhao
Ziyuan Zhao
ZZZeng Zeng
Zeng Zeng
KXKaixin Xu
Kaixin Xu
CCCen Chen
Cen Chen
CGCuntai Guan
Cuntai Guan
Image segmentation is one of the most essential biomedical image processing problems for different imaging modalities, including microscopy and X-ray in the Internet-of-Medical-Things (IoMT) domain. However, annotating biomedical images is knowledge-driven, time-consuming, and labor-intensive, making it difficult to obtain abundant labels with limited costs. Active learning strategies come into ease the burden of human annotation, which queries only a subset of training data for annotation. Despite receiving attention, most of active learning methods generally still require huge computational costs and utilize unlabeled data inefficiently. They also tend to ignore the intermediate knowledge within networks. In this work, we propose a deep active semi-supervised learning framework, DSAL, combining active learning and semi-supervised learning strategies. In DSAL, a new criterion based on deep supervision mechanism is proposed to select informative samples with high uncertainties and low uncertainties for strong labelers and weak labelers respectively. The internal criterion leverages the disagreement of intermediate features within the deep learning network for active sample selection, which subsequently reduces the computational costs. We use the proposed criteria to select samples for strong and weak labelers to produce oracle labels and pseudo labels simultaneously at each active learning iteration in an ensemble learning manner, which can be examined with IoMT Platform. Extensive experiments on multiple medical image datasets demonstrate the superiority of the proposed method over state-of-the-art active learning methods.

1 November 2024
Verified
Book Chapter
Closed access
PDF file
KXKaixin Xu
Kaixin Xu
ZWZhe Wang
Zhe Wang
CCChunyun Chen
Chunyun Chen
XGXue Geng
Xue Geng
JLJie Lin
Jie Lin
WLWeisi Lin
Weisi Lin

20 June 2022 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
ZZZeng Zeng
Zeng Zeng
ZZZiyuan Zhao
Ziyuan Zhao
KXKaixin Xu
Kaixin Xu
YLYangfan Li
Yangfan Li
CCCen Chen
Cen Chen
Xiaoli LiXiaoli Li
Xiaoli Li
Analysis of high dimensional biomedical data such as microarray gene expression data and mass spectrometry images, is crucial to provide better medical services including cancer subtyping, protein homology detection,etc. Clustering is a fundamental cognitive task which aims to group unlabeled data into multiple clusters based on their intrinsic similarities. The K-means algorithm is one of the most widely used clustering heuristics that aims at grouping the data objects into meaningful clusters such that the sum of squared Euclidean distances within each cluster is minimized. Its conceptual simplicity and computational efficiency make it easy to be used for wide applications of different data types. However, all features of data in K-means are considered equally in relevance, which distorts the performance when clustering high-dimensional data such as microarray gene expression data, mass spectrometry images, where there exist many redundant variables and correlated variables. In this paper, we propose a new correlation induced clustering, CoIn, to capture complex correlations among high dimensional data and guarantee the correlation consistency within each cluster. We evaluate the proposed method on a high dimensional mass spectrometry dataset of liver cancer tumor to explore the metabolic differences on tissues and discover the intra-tumor heterogeneity (ITH). By comparing the results of baselines and ours, it has been found that our method produces more explainable and understandable results for clinical analysis, which demonstrates the proposed clustering paradigm has the potential with application to knowledge discovery in high dimensional bioinformatics data.

8 April 2025
Verified
Book Chapter
Open access
PDF file
KXKaixin Xu
Kaixin Xu
ZWZhe Wang
Zhe Wang
CCChunyun Chen
Chunyun Chen
XGXue Geng
Xue Geng
JLJie Lin
Jie Lin
WLWeisi Lin
Weisi Lin
'Correction to: LPViT: Low-Power Semi-structured Pruning for Vision Transformers' published in 'Computer Vision – ECCV 2024'

13 February 2025
Verified
Preprint
Open access
PDF file
XKXu Kaixin
Xu Kaixin
The article generally overviews the end-to-end pipeline for Edge-AI from data to end deployment in various real applications, which is good to see as most existing surveys are isolated modules along this whole lifecycle. However, I feel the article...