SPEGC: Continual Test-Time Adaptation via Semantic-Prompt-Enhanced Graph Clustering for Medical Image Segmentation

📅 2026-03-11
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the performance degradation and error accumulation in medical image segmentation caused by continuously shifting test domains. To this end, we propose a semantic prompt–enhanced continual test-time adaptation (CTTA) method that decouples shared and heterogeneous semantic prompts to enrich local features. Our approach integrates a differentiable graph clustering solver based on optimal transport to adjust decision boundaries at the cluster level, guided by high-order structural consistency. This design effectively mitigates noise induced by domain shift and prevents catastrophic forgetting. Extensive experiments demonstrate that our method significantly outperforms existing CTTA approaches on two medical image segmentation benchmarks, achieving substantial improvements in both robustness and accuracy under cross-domain settings.

Technology Category

Application Category

📝 Abstract
In medical image segmentation tasks, the domain gap caused by the difference in data collection between training and testing data seriously hinders the deployment of pre-trained models in clinical practice. Continual Test-Time Adaptation (CTTA) aims to enable pre-trained models to adapt to continuously changing unlabeled domains, providing an effective approach to solving this problem. However, existing CTTA methods often rely on unreliable supervisory signals, igniting a self-reinforcing cycle of error accumulation that culminates in catastrophic performance degradation. To overcome these challenges, we propose a CTTA via Semantic-Prompt-Enhanced Graph Clustering (SPEGC) for medical image segmentation. First, we design a semantic prompt feature enhancement mechanism that utilizes decoupled commonality and heterogeneity prompt pools to inject global contextual information into local features, alleviating their susceptibility to noise interference under domain shift. Second, based on these enhanced features, we design a differentiable graph clustering solver. This solver reframes global edge sparsification as an optimal transport problem, allowing it to distill a raw similarity matrix into a refined and high-order structural representation in an end-to-end manner. Finally, this robust structural representation is used to guide model adaptation, ensuring predictions are consistent at a cluster-level and dynamically adjusting decision boundaries. Extensive experiments demonstrate that SPEGC outperforms other state-of-the-art CTTA methods on two medical image segmentation benchmarks. The source code is available at https://github.com/Jwei-Z/SPEGC-for-MIS.
Problem

Research questions and friction points this paper is trying to address.

domain gap
continual test-time adaptation
medical image segmentation
error accumulation
unlabeled domains
Innovation

Methods, ideas, or system contributions that make the work stand out.

Continual Test-Time Adaptation
Semantic Prompt
Graph Clustering
Optimal Transport
Medical Image Segmentation
🔎 Similar Papers
No similar papers found.
X
Xiaogang Du
Shaanxi Joint Laboratory of Artificial Intelligence, Shaanxi University of Science and Technology, Xi’an, China
J
Jiawei Zhang
Shaanxi Joint Laboratory of Artificial Intelligence, Shaanxi University of Science and Technology, Xi’an, China
T
Tongfei Liu
Shaanxi Joint Laboratory of Artificial Intelligence, Shaanxi University of Science and Technology, Xi’an, China
Tao Lei
Tao Lei
Shaanxi University of Science and Technology
Image ProcessingMachine Learning
Yingbo Wang
Yingbo Wang
Dalian University of Technology
graph learningdeep learningknowledge graph