Domain Adaptive Relational Reasoning for 3D Multi-Organ Segmentation
In this paper, we present a novel unsupervised domain adaptation (UDA) method, named Domain Adaptive Relational Reasoning (DARR), to generalize 3D multi-organ segmentation models to medical data collected from different scanners and/or protocols (domains). Our method is inspired by the fact that the spatial relationship between internal structures in medical images is relatively fixed, e.g., a spleen is always located at the tail of a pancreas, which serves as a latent variable to transfer the knowledge shared across multiple domains. We formulate the spatial relationship by solving a jigsaw puzzle task, i.e., recovering a CT scan from its shuffled patches, and jointly train it with the organ segmentation task. To guarantee the transferability of the learned spatial relationship to multiple domains, we additionally introduce two schemes: 1) Employing a super-resolution network also jointly trained with the segmentation model to standardize medical images from different domain to a certain spatial resolution; 2) Adapting the spatial relationship for a test image by test-time jigsaw puzzle training. Experimental results show that our method improves the performance by 29.60% DSC on target datasets on average without using any data from the target domain during training.
Code (0)
등록된 구현이 없습니다.
Tasks
Domain AdaptationOrgan SegmentationRelational ReasoningSegmentationSuper-ResolutionUnsupervised Domain AdaptationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Why Relational Graphs Will Save the Next Generation of Vision Foundation Models?
Vision foundation models (FMs) have become the predominant architecture in computer vision, providing highly transferable representations learned from large-scale, multimodal corpora. Nonetheless, they exhibit persistent…
Human Activity RecognitionBrain Tumor SegmentationComputational EfficiencyRelational ReasoningHyperRAG: Reasoning N-ary Facts over Hypergraphs for Retrieval Augmented Generation
Graph-based retrieval-augmented generation (RAG) methods, typically built on knowledge graphs (KGs) with binary relational facts, have shown promise in multi-hop open-domain QA. However, their rigid retrieval schemes and…
Knowledge GraphsJev-Mem: System-One-Controlled Agentic Memory for Efficient AI Agents
Agentic memory is becoming essential for long-horizon AI agents, yet many existing systems rely on autoregressive LLMs to control how memories are organized, retrieved, and used, placing expensive generation on the criti…
Adjacency List Oriented Relational Fact Extraction via Adaptive Multi-task Learning
Relational fact extraction aims to extract semantic triplets from unstructured text. In this work, we show that all of the relational fact extraction models can be organized according to a graph-oriented analytical persp…
Multi-Task LearningRelation ExtractionTripletA2RAG: Adaptive Agentic Graph Retrieval for Cost-Aware and Reliable Reasoning
Graph Retrieval-Augmented Generation (Graph-RAG) enhances multihop question answering by organizing corpora into knowledge graphs and routing evidence through relational structure. However, practical deployments face two…
Question AnsweringKnowledge Graphs