CRISP: Rank-Guided Iterative Squeezing for Robust Medical Image Segmentation under Domain Shift

• URL: http://arxiv.org/abs/2604.05409v1
• Date: Tue, 07 Apr 2026 04:05:36 GMT
• Title: CRISP: Rank-Guided Iterative Squeezing for Robust Medical Image Segmentation under Domain Shift
• Abstract summary: We introduce Rank Stability of Positive Regions'', which states that the relative rank of predicted probabilities for positive voxels remains stable under distribution shift.<n>We then design an iterative training framework, making HP and HR progressively squeeze'' to the final segmentation.<n>CRISP is the first framework to make segmentation based on rank rather than probabilities.
• Score: 7.9644155369405665
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Distribution shift in medical imaging remains a central bottleneck for the clinical translation of medical AI. Failure to address it can lead to severe performance degradation in unseen environments and exacerbate health inequities. Existing methods for domain adaptation are inherently limited by exhausting predefined possibilities through simulated shifts or pseudo-supervision. Such strategies struggle in the open-ended and unpredictable real world, where distribution shifts are effectively infinite. To address this challenge, we introduce an empirical law called ``Rank Stability of Positive Regions'', which states that the relative rank of predicted probabilities for positive voxels remains stable under distribution shift. Guided by this principle, we propose CRISP, a parameter-free and model-agnostic framework requiring no target-domain information. CRISP is the first framework to make segmentation based on rank rather than probabilities. CRISP simulates model behavior under distribution shift via latent feature perturbation, where voxel probability rankings exhibit two stable patterns: regions that consistently retain high probabilities (destined positives according to the principle) and those that remain low-probability (can be safely classified as negatives). Based on these patterns, we construct high-precision (HP) and high-recall (HR) priors and recursively refine them under perturbation. We then design an iterative training framework, making HP and HR progressively ``squeeze'' to the final segmentation. Extensive evaluations on multi-center cardiac MRI and CT-based lung vessel segmentation demonstrate CRISP's superior robustness, significantly outperforming state-of-the-art methods with striking HD95 reductions of up to 0.14 (7.0\% improvement), 1.90 (13.1\% improvement), and 8.39 (38.9\% improvement) pixels across multi-center, demographic, and modality shifts, respectively.

Related papers

• Test-time Adaptation of Pelvic Bone Segmentation Models via Dynamic Reliability-Guided [62.10276009853225]
  Reliable pelvic bone segmentation from CT is essential for robot-assisted pelvic trauma surgery.<n>Existing methods show limited effectiveness for PBS.<n>We propose a novel closed-loop dynamic Reliability-Guided framework (ReGA) for PBS.
  arXiv  Detail & Related papers  (2026-08-01T08:13:20Z)
• CalTwin: Towards Calibrated, Shift-Robust Medical World Models via Fisher-Information Regularisation [3.5083700786844876]
  Two failure modes threaten reliability of medical world models in clinical deployment.<n>We argue that both problems admit a unified treatment via a lightweight regularisation objective.<n>We derive the combined objective, establish which proof steps transfer from the classification setting without modification, and evaluate it on the PhysioNet 2019 Sepsis Challenge.
  arXiv  Detail & Related papers  (2026-07-29T10:47:52Z)
• CRISP: Constrained Refinement via Iterative Squeezing Process for Robust Medical Image Segmentation under Domain Shift [7.9644155369405665]
  "Rank Stability of Positive Regions" is a working assumption under distribution shift.<n>We propose CRISP, a model-agnostic framework that requires no test-time parameter updates and no target-domain data.<n>We show that CRISP significantly outperforms state-of-the-art methods with striking HD95 reductions of up to 0.14.
  arXiv  Detail & Related papers  (2026-07-16T17:32:26Z)
• Clipping Bottleneck: Stabilizing RLVR via Stochastic Recovery of Near-Boundary Signals [83.0127582612634]
  Near-boundary Rescue (NSR) is a minimal, plug-and-play modification that retains out-of-bound tokens to recover lost signals.<n>NSR substantially improves training stability and delivers consistent gains over strong baselines such as DAPO and GSPO.
  arXiv  Detail & Related papers  (2026-05-21T16:45:31Z)
• SHAPE: Structure-aware Hierarchical Unsupervised Domain Adaptation with Plausibility Evaluation for Medical Image Segmentation [7.174788000625294]
  Unsupervised Domain Adaptation (UDA) is essential for deploying medical segmentation models across diverse clinical environments.<n>Structure-aware Hierarchical Unsupervised Domain Adaptation with Plausibility Evaluation (SHAPE) is a framework that reframes adaptation towards global anatomical plausibility.
  arXiv  Detail & Related papers  (2026-03-23T12:25:56Z)
• First-Mover Bias in Gradient Boosting Explanations: Mechanism, Detection, and Resolution [0.0]
  First-mover bias is a concentration of feature importance caused by sequential residual fitting in gradient boosting.<n>We show that model independence is sufficient to resolve first-mover bias in the linear regime, and remains the most effective mitigation under nonlinear data-generating processes.
  arXiv  Detail & Related papers  (2026-03-22T02:59:40Z)
• Improving Search Agent with One Line of Code [68.58667107354253]
  Tool-based Agentic Reinforcement Learning (TARL) has emerged as a promising paradigm for training search agents to interact with external tools.<n>We propose textbfSearch textbfAgent textbfPolicy textbfOptimization (textbfSAPO), which stabilizes training via a conditional token-level KL constraint.
  arXiv  Detail & Related papers  (2026-03-10T04:07:39Z)
• BadCLIP++: Stealthy and Persistent Backdoors in Multimodal Contrastive Learning [73.46118996284888]
  Research on backdoor attacks against multimodal contrastive learning models faces two key challenges: stealthiness and persistence.<n>We propose BadCLIP++, a unified framework that tackles both challenges.<n>For stealthiness, we introduce a semantic-fusion QR micro-trigger that embeds imperceptible patterns near task-relevant regions.<n>For persistence, we stabilize trigger embeddings via radius shrinkage and centroid alignment.
  arXiv  Detail & Related papers  (2026-02-19T08:31:16Z)
• Anatomically-aware conformal prediction for medical image segmentation with random walks [8.829058131683764]
  Conformal prediction (CP) is a powerful distribution-free framework for constructing statistically valid prediction intervals.<n>This paper proposes Random-Walk Conformal Prediction (RW-CP), a model-agnostic framework which can be added on top of any segmentation method.
  arXiv  Detail & Related papers  (2026-01-26T22:16:07Z)
• ClinNet: Evidential Ordinal Regression with Bilateral Asymmetry and Prototype Memory for Knee Osteoarthritis Grading [3.337151338735509]
  Knee osteoarthritis (KOA) grading based on radiographic images is a critical yet challenging task.<n>In this work, we propose ClinNet, a novel trustworthy framework that addresses KOA grading as evidential ordinal regression problem.
  arXiv  Detail & Related papers  (2026-01-24T05:49:41Z)
• Navigating the Reality Gap: Privacy-Preserving Adaptation of ASR for Challenging Low-Resource Domains [4.585227671447896]
  We show that a robust multilingual model (IndicWav2Vec) degrades to a 40.94% WER on rural clinical data from India, rendering it unusable.<n>To address this, we explore a zero-data-exfiltration framework enabling localized, continual adaptation via Low-Rank Adaptation (LoRA)<n>Our results demonstrate that multi-domain Experience Replay (ER) yields the primary performance gains, achieving a 17.1% relative improvement in target WER and reducing catastrophic forgetting by 55% compared to naive adaptation.
  arXiv  Detail & Related papers  (2025-12-18T10:56:27Z)
• Parameterized Diffusion Optimization enabled Autoregressive Ordinal Regression for Diabetic Retinopathy Grading [53.11883409422728]
  This work proposes a novel autoregressive ordinal regression method called AOR-DR.<n>We decompose the diabetic retinopathy grading task into a series of ordered steps by fusing the prediction of the previous steps with extracted image features.<n>We exploit the diffusion process to facilitate conditional probability modeling, enabling the direct use of continuous global image features for autoregression.
  arXiv  Detail & Related papers  (2025-07-07T13:22:35Z)
• Towards Reliable Medical Image Segmentation by Modeling Evidential Calibrated Uncertainty [57.023423137202485]
  Concerns regarding the reliability of medical image segmentation persist among clinicians.<n>We introduce DEviS, an easily implementable foundational model that seamlessly integrates into various medical image segmentation networks.<n>By leveraging subjective logic theory, we explicitly model probability and uncertainty for medical image segmentation.
  arXiv  Detail & Related papers  (2023-01-01T05:02:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.