atlas

Research map / Label-efficient and robust learning / Test-time adaptation

Test-Time Domain Generalization via Universe Learning: A Multi-Graph Matching Approach for Medical Image Segmentation

CVPR 2025 · Label-efficient and robust learning › Test-time adaptation · approach: Test-time adaptation of vision-language models · 7 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes a multi-graph matching framework with learnable universe embeddings that encode morphological priors for test-time domain generalization in medical image segmentation, evaluated on retinal fundus and polyp segmentation.

Problem

Test-time adaptation for medical image segmentation under domain shift performs poorly because existing TTA methods ignore morphological priors of medical images, and pairwise graph matching cannot handle multiple domains consistently.

Approach

Learnable universe embeddings learned during multi-source training encode morphological priors; multi-graph matching via the universe guarantees cycle-consistency, and at test time the embeddings are frozen while the segmentation network is adapted via a matching loss on unlabeled target batches.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use TTDG multi-graph matching instead of DeY-NetU-Net for retinal fundus segmentation · Retinal fundus segmentation, multi-source, average across Sites A–EDSC (%): 85.58 -> 88.46Helped
Use TTDG multi-graph matching instead of NC-TTTU-Net for polyp segmentation · Polyp segmentation, multi-source, average across Sites A–DDSC (%): 84.80 -> 87.32Helped
Use TTDG multi-graph matching instead of NC-TTTU-Net for polyp segmentation · Polyp segmentation, single-source, average across 12 transfersDSC (%): 79.93 -> 81.75Helped
Add learned universe embeddings rather than using randomly initialized universe matching (ablation)TTDG for retinal fundus segmentation · Retinal fundus segmentation, multi-source, average across Sites A–EDSC (%): 80.47 -> 88.46Helped
Add morphological priors to universe embeddings (ablation)TTDG for retinal fundus segmentation · Retinal fundus segmentation, multi-source, average across Sites A–EDSC (%): 78.71 -> 88.46Helped
Replace pairwise matching with multi-matching (ablation)TTDG for retinal fundus segmentation · Retinal fundus segmentation, Sites A–EDSC (%): 84.63 -> 88.46Helped

Surprising findings

Limitations

Experimental setup

Datasets: RIM-ONE REFUGE ORIGA REFUGE-Test Drishti-GS BKAI-IGH-NEOPolyp CVC-ClinicDB CVC-612 ETIS Kvasir

Benchmarks: retinal fundus OD/OC segmentation (5 sites) polyp segmentation (4 sites)

Metrics: DSC E-max phi S-alpha

Baselines: No Adapt TENT SAR TASD DLTTA DomainAdaptor VPTTA DeY-Net NC-TTT

Builds on: universe of nodes multi-graph matching VPTTA HiPPI Sinkhorn algorithm

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy