Papers for

medical imaging teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Conditional flow matching improves image recovery from noisy measurements

Fast and Faithful: Principled Conditional Flow Matching for Inverse Problems

Abstract: Flow matching approaches to imaging inverse problems commonly incorporate measurements in two ways. Conditioning-based approaches supply measurement-derived information as a network input, often through concatenation, while inference-guided approaches combine an unconditional velocity field with a separate data-consistency update. In these common formulations, the forward model is not explicitly enforced within the learned conditional velocity field. We propose a principled parametrization of the measurement-conditional velocity field to solve inverse problems. Under linear interpolation, we express the conditional velocity $v(x_t,t,y)$ in terms of the posterior mean $E[x_1 | x_t,y]$, and characterize that mean as the unique minimizer of a variational objective whose data-consistency term is explicit. We further prove that the velocity field defines a probability flow from the source distribution to the measurement-conditioned posterior. Splitting the variational objective yields a conditional velocity parameterization with operator-dependent data-consistency updates, which we train end-to-end under the flow-matching objective, with no additional guidance at inference. Our method achieves state-of-the-art PSNR with $50\times$ fewer function evaluations than the strongest flow baseline. Varying the sampling steps provides test-time control over the distortion-perception trade-off without retraining.

Fri 11 SeptComputer Vision and Pattern Recognition
The gist
Imaging inverse problems involve figuring out the original image from partial or noisy measurements. The authors propose a new approach that uses a mathematical idea called conditional flow matching to better reconstruct images by integrating measurement information directly into the recovery process. Their method is faster and produces higher-quality images than previous flow-based techniques. It also lets users balance the trade-off between image sharpness and distortion at test time without retraining the model.
Open 2609.12953v1

Self-supervised pre-training improves eye disease models with little data

Self-supervised Pre-training Helps Retinal Disease Progression Modelling Most When Data Is Scarce

Abstract: Modelling how a disease progresses over time requires longitudinal imaging cohorts, which are scarce and small, whereas cross-sectional data -- one image per participant -- is abundant. Self-supervised pre-training on such data offers a way to bridge this gap, but it is unclear which strategy best supports progression modelling, or how that answer depends on the amount of labelled longitudinal data. We study this for age-related macular degeneration (AMD), pre-training encoders on the large cross-sectional NAKO cohort and predicting time to late AMD on the longitudinal AREDS dataset. We compare in-house self-supervised encoders against a general-purpose (DINOv2) and a domain-specific (RETFound) foundation model, across contrastive, masked-autoencoding, and self-distillation objectives, under frozen and fine-tuned protocols, and across labelled training sets from 100 to 32,250 examples. Which model performs best depends on how the encoder is used. When the encoder is frozen and labels are few -- the regime typical of longitudinal cohorts -- pre-trained representations reach clinically reasonable discrimination from a few hundred labelled samples, while models trained from scratch do not; this advantage fades under fine-tuning. Transfer is governed by the self-supervision objective rather than corpus scale or domain match, so that an encoder pre-trained on a modest cross-sectional cohort matches or exceeds a far larger in-domain foundation model. Together, these results offer a practical recipe for building progression models where longitudinal data is scarce: a frozen self-supervised encoder with a lightweight survival head.

Fri 11 SeptComputer Vision and Pattern Recognition
The gist
It's hard to study how eye diseases like age-related macular degeneration (AMD) get worse over time because the right kinds of patient images are rare. The authors found that training a computer program first on many single images taken at one time (instead of changes over time) can help it learn useful information. When there isn’t much data showing disease progression, this pre-training helps the model predict AMD worsening better than starting from scratch. This improvement depends more on how the model is trained beforehand, rather than on the size or similarity of the training images.
Open 2609.12834v1

Ultra-widefield octa dataset and network improve retinal vessel segmentation

An Ultra-Widefield Swept-Source OCTA Dataset and a Polar-Gated Mamba Network for Retinal Vessel Segmentation

Abstract: Ultra-widefield (UWF) swept-source optical coherence tomography angiography (SS-OCTA) enables large-area retinal vascular imaging, yet vessel segmentation at this scale lacks dedicated public benchmarks and comprehensive evaluation for quantitative vascular analysis. We introduce WOIVES, to our knowledge the first publicly available UWF SS-OCTA vessel-segmentation dataset, comprising 206 eyes from 152 participants with a 24x20mm^2 field of view. WOIVES spans emmetropia to high myopia and provides soft probability vessel annotations. We further propose PG-Mamba, a visual state space model that enhances conventional directional scans with two complementary polar-coordinate scan orders. An auxiliary Dynamic FOV Gating module performs spatial modulation at the bottleneck. PG-Mamba outperformed seven competitive approaches on broad segmentation metrics under cross-validation. It achieved the lowest median absolute errors for vessel density, fractal dimension, and vessel length density. WOIVES is publicly available on Zenodo (DOI: 10.5281/zenodo.21904672), and the PG-Mamba code is available at https://github.com/syb1234567/PG-Mamba.

Fri 11 SeptComputer Vision and Pattern Recognition
The gist
Retinal scans cover large areas but lack good public data for analyzing blood vessels accurately. The authors created WOIVES, a new large set of retinal images with detailed vessel markings to help this problem. They also developed PG-Mamba, a model that looks at the images from different angles to better find blood vessels. This model worked better than others in measuring blood vessel features precisely.
Open 2609.12574v1

Glioma tumor changes forecasted using MRI anchored model updates

Observation-Anchored Selective Assimilation for Longitudinal Tumor-State Proxy Forecasting in Post-Treatment Glioma

Abstract: Post-treatment MRI in patients with glioma provides serial observations for updating patient-specific tumor-state proxy estimates, but variable appearances and trajectories complicate forecasting. We formulate forecasting as an observation-aware digital-twin update in which an intermediate observation anchors the patient-specific state. Among 203 patients and 594 follow-up time points, a predefined no-new-treatment criterion retained 120 of 236 candidate triplets, split into 81/24/15 training/validation/test triplets at the patient level. Each time point was represented by a continuous voxel-wise tumor-state proxy map in [0,1] derived from MRI lesion labels. A SegMamba-based single-step forecaster predicted update proposals from multimodal source-state tensors. Observation-Anchored Selective Assimilation (OASA) retained the observed intermediate proxy as the state anchor and selectively applied updates through a validation-selected tiered case-level rule and voxel-wise soft gate. We compared initial-scan forecasting, rollout without assimilation, latest-observation persistence, direct prediction, OASA, OASA + calibration, and morphological dilation. Checkpoints, OASA rules, and calibration thresholds were selected using validation data only. Across three seeds on 15 held-out test triplets, OASA maintained Dice at $τ$ = 0.2 comparable to persistence (0.6071 $\pm$ 0.0025 vs. 0.6070) while yielding numerically higher Dice at $τ$ = 0.5 (0.4269 $\pm$ 0.0079 vs. 0.3981), with a small RMSE increase. Calibration increased Dice at $τ$ = 0.2 to 0.6178 $\pm$ 0.0025, increased false-positive (FP) support (11,836$\rightarrow$18,663), and reduced false-negative (FN) support (22,107$\rightarrow$17,536). This reflects near-threshold support calibration rather than improved biological predictive capability. Code is publicly available at https://github.com/jsudg436/longitudinal-proxy-forecasting.

Fri 11 SeptMachine LearningArtificial Intelligence
The gist
Doctors use MRI scans over time to track brain tumors after treatment, but it’s hard to predict how the tumor will change. The authors created a method that updates tumor predictions by carefully combining new MRI data with previous estimates. Their approach keeps observed tumor details as anchors and selectively adjusts other areas, which helps maintain prediction accuracy compared to simpler methods. This technique may support better monitoring of tumor changes over time using MRI images.
Open 2609.12435v1

Spectral adapters improve liver tumor segmentation from CT scans

Spectral Adapters for Segment Anything Model-based Segmentation of Colorectal Liver Metastases in Computed Tomography

Abstract: Accurate segmentation of colorectal liver metastases (CRLM) in contrast-enhanced computed tomography (CT) is important for response assessment, surgical planning, and follow-up. We propose two parameter-efficient spectral adapters for the Segment Anything Model (SAM): the Directional Spectral Adapter (DiSECT) and Spectral Instance-Guided Adapter (SiGA). DiSECT uses singular value decomposition of frozen weights to constrain residual updates to leading spectral directions, while SiGA adds global and input-conditioned gating through a multilayer perceptron. We evaluate these methods on 446 contrast-enhanced CT volumes (355 training, 91 testing) and compare them with LoRA, QLoRA, convolutional adapters (CAD), and a 3D nnU-Net baseline. Experiments consider single-point, three-point, bounding-box, and no-prompt regimes. SiGA achieves the best single-point performance with a Dice score of 0.77, IoU of 0.69, and HD95 of 35.39 mm. Under no-prompt inference, SiGA reaches 0.76 Dice, 0.68 IoU, and 46.76 mm HD95, comparable to the nnU-Net baseline (0.758 Dice). DiSECT uses only 0.14 million trainable parameters. These results show that spectral adapters can efficiently adapt SAM for CRLM segmentation while retaining strong accuracy with limited trainable parameters.

Thu 10 SeptComputer Vision and Pattern Recognition
The gist
Segmenting cancer spots in liver CT scans helps doctors plan treatments and track progress. The paper introduces two lightweight add-ons to a powerful image model that improve how well it finds liver tumors. These add-ons make the model better at this task while only needing to adjust a small number of settings. Tests on hundreds of scans show these methods perform close to fully trained traditional models but with fewer training demands.
Open 2609.11703v1

Brain metastases segmentation improved with enhanced neural network and post-processing

Pre- and Post-Treatment Brain Metastases Segmentation Using nnU-Net with Post-Processing for BraTS 2026

Abstract: Brain metastases exhibit high inter-lesion variability in size, enhancement pattern, and post-treatment appearance, making volumetric segmentation of both pre- and post-treatment cases the central challenge of the BraTS 2026 Task 1 (Brain Metastases). We build a pragmatic pipeline on a 5-fold nnU-Net ResEnc-L ensemble, in which each fold is trained independently for 1,000 epochs with the standard Dice + cross-entropy loss on 1,296 four-modality training cases. This ensemble is followed by a rule-based post-processing cascade tuned for the lesion-wise Dice similarity coefficient (LW-DSC), a detection-oriented metric that behaves very differently from the traditional global Dice. The final pipeline reaches an LW-DSC of 0.733 / 0.751 / 0.713 / 0.549 on the enhancing tumour (ET), tumour core (TC), whole tumour (WT), and resection cavity (RC) sub-regions on the official validation leaderboard. Rather than trusting these leaderboard gains, we audit every post-processing stage with a five-fold out-of-fold (OOF) analysis with no model-training leakage over all 1,296 training cases, scored with the official BraTS evaluation code (BraTS_evaluation): it confirms two stages as robust, per-fold-consistent improvements while the third improves only the leaderboard and does not reproduce out-of-fold. We further provide a mechanistic analysis of the LW-DSC metric that explains why recall-recovering post-processing carries low risk whereas component deletion does not, and we report thirteen negative results spanning loss engineering, alternative backbones, and inference-time settings, several of which run counter to widely held intuitions. Source code is released under Apache-2.0 at https://github.com/hornbeamliu/brats2026-met.

Thu 10 SeptComputer Vision and Pattern Recognition
The gist
Segmenting brain metastases before and after treatment is hard because the lesions look very different in size and appearance. The authors built a system using a specialized neural network called nnU-Net with added rule-based steps that help detect lesions more accurately. They carefully tested their method to make sure improvements were real and not just luck on the leaderboard scores. This work also explains why some kinds of post-processing help more than others and reports many unsuccessful experiments to guide future research.
Open 2609.11477v1

Conditional transport boosts 3d deformable point cloud matching accuracy

BridgeMatch: Conditional Transport Bridges in Matching Matrix Space for 3D Deformable Registration

Abstract: Reliable non-rigid point cloud correspondences are important for deformable anatomical registration, embodied perception and manipulation, and dynamic 3D reconstruction. Coarse-to-fine methods reduce computational cost by selecting the top-\(K\) coarse regions. However, this pruning may remove weak but correct hypotheses and restrict fine matching to an incomplete search space. We present \paper, a two-stage generative solver that maintains the complete soft matching matrix at both coarse and high resolutions. Stage~I uses denoising diffusion to estimate a global matching matrix in the compact coarse-resolution space. We then lift this matrix to high resolution while preserving its hierarchy. The lifted matrix is rank-bounded and block-constant. Stage~II refines it through a conditional transport bridge. We implement the bridge with two types of dynamics: a deterministic endpoint-parameterized conditional Flow Matching (CFM) ODE and a stochastic Brownian-bridge SDE inspired by Schrödinger bridges. Both variants share the lifted source, a time-conditioned transformer, and a matching-matrix endpoint predictor. Experiments on 4DMatch and 4DLoMatch show that both variants produce more accurate correspondences than the compared methods and improve downstream registration, with larger gains in low-overlap cases. They also improve cross-dataset generalization on CAPE and DeepDeform without target-domain adaptation while using the same deformation solver.

Thu 10 SeptComputer Vision and Pattern Recognition
The gist
Matching points between two 3D shapes that deform is tricky, especially when the shapes only partially overlap. The authors introduce BridgeMatch, a new two-step method that first finds a rough global match and then refines it carefully without losing any possible correct matches. This approach uses advanced math tools called diffusion models and transport bridges to better guess which points correspond, even in challenging cases. Their experiments show it works better than previous methods and adapts well across different datasets.
Open 2609.11472v1

DINOv3 model improves liver fibrosis staging using medical image patches

DINO-Med: A Unified Patch-Based Adaptation Framework for Multi-Modal Medical Image Analysis Applied to Liver Fibrosis Staging

Abstract: Adapting natural-image foundation models like DINOv3 to multi-modal medical imaging is challenging due to the significant domain gap between natural color images and multi-channel medical scans. We present a unified, patch-based framework that processes raw multimodal imaging through training-free registration, automated localization, and mask-filtered patch extraction. This architecture culminates in a hierarchical strategy that aggregates patch-level insights into subject-level diagnostics. Using liver fibrosis staging as a case study, we evaluate four patch-level feature representations: handcrafted Radiomics features, learned ResNet features, pre-trained foundation model SAM-Med2D features, and frozen DINOv3 features. To ensure a controlled comparison, all models utilize the same lightweight MLP head and are evaluated across both rigid and deformable registration settings. Our training protocol focuses on mild fibrosis (S1) and cirrhosis (S4) classes only, enabling a single classifier to address both substantial fibrosis detection and cirrhosis staging. Evaluated via 10 random train (90%)/ test (10%) splits on 360 subjects from the CARE 2025 Liver Track 4 cohort, our DINOv3-based framework significantly outperforms all baselines, achieving the best classification accuracy of 78.4% for S1 and 75.8% for S4.

Thu 10 SeptComputer Vision and Pattern Recognition
The gist
It is hard to use AI models made for everyday photos on medical images because medical scans look very different. The authors created a system that breaks medical images into small pieces and analyzes them to detect liver fibrosis stages. They compared different ways of representing image parts and found that a model called DINOv3 worked best. Their system was tested on 360 patients and showed more accurate detection of mild fibrosis and cirrhosis than other methods.
Open 2609.11380v1

Meta learning predicts best image classifier for diverse datasets

Meta-Learning for Classifier Selection in Image Datasets: A Feature-Driven Framework for Accuracy Prediction

Abstract: No Free Lunch theorem implies that any performance gains achieved by a classifier on a particular image distribution are necessarily offset by a loss of performance over the set of all possible problems; thus, no single model is universally optimal. Selecting the most suitable classifier for image datasets is a critical yet challenging task due to the intrinsic complexity and diversity of images. This paper proposes a meta-learning framework that leverages a comprehensive set of meta-features capturing dataset complexity to predict classifier performance without exhaustive training. By extracting and selecting features using methods such as autoencoders, pre-trained networks, and dimensionality reduction techniques, we train regression models to efficiently estimate classifier accuracies. Additionally, clustering techniques are employed to group classifiers with similar performance patterns, simplifying the recommendation process. The datasets used span a wide range of concepts, including nature, animals, numbers, motorcycles, medical images, and human bodies, to ensure broad generalization. Evaluated on 56 diverse image datasets, our approach achieves an average ranking prediction accuracy exceeding 86%, demonstrating its effectiveness in guiding model selection. This scalable and interpretable framework provides a practical solution to improve classification performance while reducing computational costs.

Thu 10 SeptComputer Vision and Pattern RecognitionMachine Learning
The gist
Choosing the right image recognition program can be tricky because no one model works best for every kind of picture. The authors created a system that looks at the characteristics of an image dataset to predict how well different classifiers will perform without having to try each one fully. They use smart feature extraction and grouping methods to make fast and accurate recommendations. Testing on many kinds of image collections showed their method correctly ranks classifiers over 86% of the time. This helps save time and computing power when picking tools to identify images.
Open 2609.11041v1

Learning continuous-time maps improves medical image alignment accuracy

Two-Parameter Flow Map Learning for Continuous-Time Diffeomorphic Image Registration

Abstract: Diffeomorphic image registration is central to medical image analysis, enabling anatomically consistent alignment across subjects. Most learning-based diffeomorphic methods model autonomous ODEs(ordinary differential equations) by parameterizing a stationary velocity field and recovering deformations via scaling-and-squaring. While non-autonomous ODEs with time-dependent velocities increase expressiveness, existing approaches rely on numerical integration to implicitly enforce flow structure that entangles model expressiveness with discretization accuracy. We propose a framework to directly learn the continuous-time solution of a non-autonomous ODE formulated as a two-parameterflow map. By enforcing cocycle consistency, a fundamental structural property of time-varying flows, we learn the flow maps without time discretization and velocity integration during training. The framework recovers diffeomorphic mappings at inference using a small number of compositions. Our proposed framework seamlessly incorporates standard registration backbones and improves alignment accuracy consistently across nine datasets while preserving diffeomorphic structure. Notably, the proposed method achieves an average Dice improvement of 2.1% on brain MRI benchmarks, a 12% TRE reduction on lung CT, and a 2.6% Dice gain on cardiac MRI and ultrasound datasets.

Wed 9 SeptComputer Vision and Pattern Recognition
The gist
Aligning medical images from different people helps doctors compare anatomy accurately. Most existing methods use simpler models that assume constant changes over time, which can limit accuracy. The authors introduce a new way to learn how images change over time using a two-parameter map that captures more detailed deformations without relying on slow computations during training. Their method improves alignment accuracy on brain, lung, heart, and ultrasound images while keeping the important mathematical properties of smooth deformations.
Open 2609.10789v1

Braintaskonomy improves brain scan learning by organizing task transfers

BrainTaskonomy: Learning How to Pretrain and What to Transfer in fMRI Foundation Models

Abstract: fMRI foundation models increasingly aggregate heterogeneous data across brain states, cohorts, and acquisition settings, yet pretraining domains are commonly treated as a flat mixture and downstream tasks are adapted independently. We study whether measured learning relations can organize both stages without modifying the backbone. During pretraining, a lightweight Brain-DiT proxy estimates difficulty and directed facilitation across ten fMRI domains, yielding a priority-guided cumulative domain curriculum combined with high-to-low-noise timestep scheduling and joint consolidation. During adaptation, controlled first- and higher-order transfer across fifteen tasks constructs a directed taskonomy, from which budgeted integer programming (BIP) selects directly supervised source tasks and target-specific routes. The joint priority-domain and high-to-low-timestep curriculum reduces v-NMSE, PSD-NMSE, and FC-MSE by 6.5%, 16.3%, and 10.5%, respectively, relative to uniform sampling over both dimensions, and shows strong downstream performance across six in- and out-of-domain tasks. The taskonomy reveals asymmetric, target-dependent transfer, while exploratory sealed-test evaluation shows larger descriptive gains for BIP policies when higher-order route spaces are available than for matched random controls. Together, these findings support organizing fMRI pretraining and adaptation by measured learning relations rather than treating domains and tasks as independent flat sets.

Wed 9 SeptComputer Vision and Pattern Recognition
The gist
Brain scans called fMRI come from many different situations, and training computers to understand them usually treats all data the same. The authors show that measuring how different brain scan tasks and data types help each other can guide smarter learning steps. Their method organizes training and adaptation in a way that improves accuracy on brain data by choosing what to learn first and how to transfer knowledge between tasks. This helps computers better analyze brain functions across diverse scanning conditions.
Open 2609.10518v1

Shape guidance improves 3D X-ray reconstruction with few views

Shape-guided Gaussian Splatting for Sparse-View X-ray 3D Reconstruction

Abstract: Sparse-view X-ray 3D reconstruction is essential for reducing radiation exposure, but recovering a density field from a handful of X-ray projections is severely ill-posed. Recently, 3D Gaussian Splatting has achieved state-of-the-art performance in sparse-view reconstruction by representing the volume using explicit, optimized primitives, but it requires dozens of projected views. With fewer views, reconstruction quality degrades severely since the explicit primitives are optimized freely without any anatomical information. Anatomical structures, in contrast, share similar geometry and density across a population. Their variations are bounded within a limited range that statistical shape models can capture. This paper proposes a shape-guided Gaussian splatting framework for sparse-view X-ray 3D reconstructions. Our contribution lies in driving Gaussian positions toward anatomically valid configurations, alongside atlas-based density regularization. Our method ensures anatomically consistent reconstruction and improves PSNR by 2.83 dB over a state-of-the-art Gaussian splatting baseline with as few as 5 views. Code Available: https://github.com/polyshape-lab/ShapeGuidedGaussian

Wed 9 SeptComputer Vision and Pattern Recognition
The gist
It is hard to create detailed 3D X-ray images when only a few X-ray pictures are taken, because the computer guesses many unknown details. The authors improved this by using prior knowledge about typical body shapes to guide the reconstruction. This makes the 3D images more accurate and realistic, even with as few as five X-ray views. Their method beats previous techniques by making the results more consistent with human anatomy.
Open 2609.10376v1

Cancer segmentation AI signals errors through internal patterns

Medical AI Encodes a "Feeling of Error": Verifying Cancer Segmentation via Internal Concepts

Abstract: Cancer segmentation models can fail silently, generating plausible but incorrect masks that risk missed findings or unnecessary biopsies. A critical question arises: Do AI models "know" when they are wrong, and if so, can we use the signal to predict their own failures? Humans do have a "Feeling of Error" (FOE): a spontaneous sense of unease that flags a potential error during thinking. We investigate whether cancer segmentation models exhibit an analogous internal signal. Unlike output-level cues (e.g., prediction confidence or uncertainty), which offer no insight into why a failure occurs and suffer from a sensitivity-quality tradeoff where high detection sensitivity could degrade overall segmentation quality. We instead propose to capture the model's FOE from its inner workings. Using mechanistic interpretability tools, specifically Sparse Autoencoders, we decompose internal neural activations into a dictionary of human-interpretable concepts and show that failure cases exhibit a distinct latent signature: fewer active concepts with lower activation magnitudes compared to successful segmentation. By training a classifier on these concept activations, we achieve accurate failure detection along with explanations for the model's mistakes. Experiments on prostate, pancreatic, and brain cancer segmentation demonstrate that our approach outperforms output-based methods in failure detection while preserving segmentation quality.

Tue 8 SeptComputer Vision and Pattern Recognition
The gist
Cancer detection AI can sometimes make mistakes that look convincing but are wrong, which can cause harm. The authors studied whether these AI systems have an internal 'feeling' that tells them when they might be wrong. They found that by looking inside the AI’s inner workings and spotting certain patterns, they could tell when the AI was likely to fail. This method works better than just looking at the AI’s confidence scores and also explains why the mistake happened. They tested this on models for prostate, pancreatic, and brain cancer images.
Open 2609.08879v1

Better brain scan alignment improves nerve and blood vessel views

Evaluation Principles for MRI-MRA Registration in Trigeminal Neuralgia: An ROI-Centered Neurovascular Benchmark

Abstract: Preoperative evaluation of trigeminal neuralgia (TN) often requires joint interpretation of structural MRI, which depicts the trigeminal nerve and surrounding cisternal anatomy, and time-of-flight MRA, which highlights vascular structures. Although MRI-MRA fusion is clinically attractive for visualizing neurovascular compression, this task is poorly captured by conventional whole-brain registration evaluation because the clinically relevant target is a small trigeminal ROI, vessel annotations are partial and clinically focused, local TOF-MRA contrast is variable, and field-of-view mismatch can limit deformable alignment. We formulate TN MRI-MRA fusion as an ROI-centered neurovascular registration-evaluation problem and construct a benchmark from 149 patients with clinician-annotated bilateral trigeminal ROIs. Six representative registration pipelines were evaluated using local image-based metrics, segmentation-derived vessel-localization metrics, prediction-volume analysis, and contrast- and FOV-stratified comparisons. Conventional evaluation summaries were often misleading: local image similarity, vessel-background separability, and downstream vessel localization did not co-rank methods; one-sided vessel distances were strongly affected by predicted vessel extent under partial annotations; and local MRA contrast determined when vessel-separability metrics were informative. Deformable refinement provided only a small, FOV-dependent benefit over affine alignment, while reader review showed that locally favorable vessel distances could coexist with globally implausible registrations. These findings indicate that TN MRI-MRA registration should be evaluated as a local, vessel-aware, contrast-sensitive, and FOV-aware visualization task rather than as generic multimodal brain registration. Our code is publicly available at https://github.com/jhuldr/TN-Reg-Benchmark.

Tue 8 SeptComputer Vision and Pattern Recognition
The gist
Trigeminal neuralgia is a painful nerve condition that doctors often study using two types of brain scans to see nerves and blood vessels. The researchers found that usual ways to align these scans don't work well because they focus on the whole brain instead of the tiny nerve area that matters most. They created a special test and showed that alignment methods need to focus on nerve regions, blood vessels, and scan details to be useful. Their work helps make better combined images for doctors studying this pain disorder.
Open 2609.08805v1

CoordFormer enables accurate segmentation on huge images with less computing

CoordFormer: Give Me Any Coordinates and I Will Give You Labels

Abstract: Semantic segmentation on very-high-resolution images remains challenging due to the high computational cost and the difficulty of capturing fine-grained details. We propose CoordFormer, a novel coordinate-based architecture for semantic segmentation that predicts labels at arbitrary spatial locations through a Coordinate Decoder equipped with a Localized Cross-Attention mechanism. The decoder combines coordinate embeddings with high-resolution local patch features and interacts with global tokens extracted from a downsampled image processed by a ViT foundation encoder, enabling rich semantic context while preserving pixel-level precision. This design enables flexible inference at arbitrary resolutions while keeping memory low on very-high-resolution inputs, and supports an efficient semantic-edge-focused strategy that concentrates computation along boundaries, maintaining fine-grained accuracy while reducing latency and computational cost. CoordFormer achieves state-of-the-art performance on MaSS13K and outperforms comparably sized and higher-parameter methods on DIS5K and KPIs, demonstrating its effectiveness for high-quality, very-high-resolution semantic segmentation.

Tue 8 SeptComputer Vision and Pattern Recognition
The gist
Looking at very large, detailed images and labeling every part is hard because it needs a lot of computer power and can miss tiny details. The authors designed CoordFormer, a method that can label any exact spot in these images by combining detailed local features with a broad view of the whole image. This approach keeps the image sharp and detailed while using less memory and computing power. It also smartly focuses effort on edges where details matter most, speeding up the process without losing accuracy.
Open 2609.08660v1

Pancreatic tumor segmentation improved by lightweight TRIUNE-Net model

TRIUNE-Net: Harmonizing Scale, Shape, and Efficiency in Pancreatic Tumor Segmentation

Abstract: Pancreatic tumor segmentation in 3D CT volumes is challenged by extreme scale variability across both the pancreas and tumor, and highly irregular tumor morphology. While recent advances have pushed segmentation performance, existing methods do not explicitly address these challenges and come at the cost of excessive computational complexity, limiting their practicality in resource-constrained clinical environments. We propose TRIUNE-Net, a lightweight unified architecture that harmonizes scale, shape, and efficiency through three synergistic innovations. A multi-scale context aggregation module with stage-adaptive dilated convolutions enables the model to reason across the broad range of anatomical scales present in both organs. A serial linear-deformable attention mechanism combines large effective receptive fields with shapeadaptive deformable convolutions to capture irregular, non-convex tumor morphologies. Finally, an information-preserving downsampling module replaces conventional max pooling entirely, retaining all spatial information while adding negligible parameters, preventing small tumors from being discarded before they can be recognized. On both the MSD Pancreas and NVD Pancreas datasets, TRIUNE-Net achieves state-of-theart results with only 5.86 M parameters and no external pre-training, outperforming all baselines across all key tumor metrics. Specifically, it surpasses the next-best model by 0.45% in tumor Dice, 6.0 points in F1 score, 6.6 points in sensitivity, and 3.4 points in precision, simultaneously reflecting its ability to suppress both missed tumors and false alarms in clinically realistic conditions. Our code is available at: https://github.com/abdora-ai/TRIUNE-Net

Tue 8 SeptComputer Vision and Pattern Recognition
The gist
Pancreatic tumors are tricky to spot and outline in 3D CT scans because both the pancreas and tumors vary greatly in size and shape. The authors created TRIUNE-Net, a new computer model that adapts to these wide ranges by looking at different scales and focusing on irregular tumor shapes. It also keeps all spatial details during image processing stages to avoid missing tiny tumors. Tests show TRIUNE-Net is better and more efficient than previous methods, helping reduce false positives and missed tumors without needing extra data to learn from.
Open 2609.08303v1

Geodesic-informed model ensures shape consistency in image video generation

Geodesic-informed Generative Diffusion Model For Topology-preserved Image Video Generation

Abstract: Generative diffusion models have emerged as a class of powerful techniques for various imaging applications, including but not limited to synthesis, reconstruction, and segmentation. Despite their success, current generative models pose two key limitations. First, they primarily rely on image intensity and texture information, with limited attention to underlying object geometry. As a result, they do not guarantee geometric or topological consistency during the generation process, which is a crucial requirement for high-stakes domains such as computational anatomy, biology, and robotics, where preserving object structure is critical. Second, existing models fail to explicitly learn or represent shape changes in the generative process. Such deformation dynamics remain occluded within network parameters; hence leaving the transformation process uninterpretable and physically uninformed. To address these challenges, we introduce IGG (Image Generation informed by Geodesic dynamics), a novel framework that integrates topology-preserving geodesic principles into the diffusion-based generative process. In contrast to conventional methods that operate in image intensity space, IGG learns and synthesizes diverse samples within geodesic deformation spaces, where geometric object changes are learned as smooth and invertible smooth mappings from a given template/source image. Our code is publicly available at https://github.com/nellie689/IGG.

Tue 8 SeptMachine LearningComputer Vision and Pattern RecognitionGraphics
The gist
Creating new images or videos often changes important object shapes and structures in unpredictable ways. The authors developed a model that keeps the shape and structure consistent when generating image videos, by learning smooth transformations from a source image. This makes the generation process easier to understand and more reliable, especially for fields where preserving object shape is crucial, like biology or robotics.
Open 2609.08153v1

MRI method improves 3D heart shape reconstruction from limited image slices

MRI-Guided Reslice-Refined Cross-Slice SDF Reconstruction of the Left Ventricle from Cardiac MRI with Sparse Axial Supervision

Abstract: Reconstructing a three-dimensional left-ventricular (LV) endocardial surface from cardiac magnetic resonance (CMR) data is challenging when supervision is available on only a small number of axial slices. Through-plane geometry is weakly constrained, and automatically generated two-dimensional masks can propagate segmentation errors into the recovered shape. We present MR-RS-SDFR, a per-case implicit signed distance field (SDF) framework that reconstructs a continuous LV surface from a CMR volume and sparse axial weak masks. The method first builds a cross-slice SDF initialization from axial and longitudinal geometric cues and then refines the field using two complementary signals: MRI edge-field normal alignment, which provides an image-derived boundary cue independent of the weak masks, and differentiable reslice Dice and contour consistency, which preserve agreement with the observed planes. We evaluate three weak-mask generators -- LOO TransUNet, LOO nnU-Net, and an off-the-shelf Medical SAM3 model used without MM-WHS-specific training or fine-tuning -- and five sparsity levels from 4 to 64 axial planes. In the sparse-16 setting, final MR-RS-SDFR reconstruction reaches 0.928 Dice and 3.80mm HD95 with Medical SAM3 masks. The upstream generators do not exhibit a single common ranking across 2D and dense 3D segmentation, and nnU-Net- and Medical-SAM3-driven sparse reconstruction achieve the same mean final Dice despite different upstream error profiles. Across all three sparse-16 mask sources, MR-RS-SDFR is numerically better than protocol-matched full GHD+DVS in both Dice and HD95. Final Dice improves markedly from sparse-4 to sparse-16 and then saturates at the reported precision through sparse-64. These results support MRI-guided per-case SDF refinement as a reconstruction strategy that remains effective across weak-mask generators and supervision densities.

Tue 8 SeptComputer Vision and Pattern Recognition
The gist
Rebuilding a detailed 3D model of the heart’s left ventricle from MRI scans is hard when only a few cross-sectional images are clear. The authors developed a method that starts with rough guesses from the available images, then refines the heart’s shape using image boundaries and consistency checks, even when segmentation boundaries are imperfect. Their approach works well across different segmentation tools and various amounts of data, producing more accurate heart models from sparse information. This could help make heart imaging more reliable without needing many image slices.
Open 2609.08148v1

Calibration improves shortcut learning in medical image classifiers

Prevalence calibration as shortcut mitigation

Abstract: Shortcut learning denotes the widespread situation in which a classifier exploits spurious correlations rather than diagnostic features. Existing mitigation strategies mostly aim to learn shortcut-invariant representations; their empirical success is limited and they cannot be applied to classifiers using frozen foundation model encoders. We propose to reframe shortcut learning as fundamentally a calibration problem: unconstrained learning implicitly calibrates each shortcut group to its training set disease prevalence, rendering the resulting classifier necessarily over-confident in one group and under-confident in the other. Building on this insight, we prevalence-equalize calibration between shortcut groups through two encoder-agnostic methods, an in-processing regularizer and a post-hoc prevalence-equalized recalibration step. Across chest-drain-pneumothorax benchmarks on CheXpert and SIIM-ACR, spanning fine-tuned CNNs and frozen foundation-model backbones, both methods substantially outperform all baselines. Post-hoc recalibration of a standard ERM-trained DenseNet raises misaligned-group AUROC from 0.23 to 0.73, indicating that shortcut reliance degrades the classification head rather than the underlying representation. Besides two new state-of-the-art shortcut mitigation approaches, our findings more fundamentally connect shortcut learning to calibration theory and algorithmic fairness.

Mon 7 SeptMachine LearningComputer Vision and Pattern Recognition
The gist
Sometimes computer programs that classify medical images learn to rely on shortcuts—like patterns that are not truly related to the disease but happen to appear in certain groups of images. This leads to mistakes when the program sees new types of images. The paper shows that these shortcuts are linked to how confident the program feels about these groups, which is called calibration. The authors propose ways to fix this calibration so the program treats all groups more fairly, which improves its ability to correctly detect diseases.
Open 2609.07922v1

Latent to latent flow boosts efficiency in 3d medical image segmentation

Latent-to-Latent Flow for Volumetric Stochastic Segmentation

Abstract: Uncertainty arising from inter-observer variability in medical image segmentation plays an important role in developing treatment plans. Research in this area is inhibited by the lack of multiple annotations for large-scale medical datasets, especially for volumetric data, which suffers from additional scaling and computational complexity challenges. Flow matching has emerged as a powerful framework for generative modelling and has also been demonstrated to maintain strong performance when working with latent representations of images. In this work, we introduce a latent-to-latent flow technique for stochastic segmentation of medical volumes via encoded representations of both the image and label space. We evaluate our method on two challenging applications covering delineation uncertainty for radiotherapy planning and multiple organ structure segmentation, improving efficiency up to 14x compared with full resolution models while maintaining clinically relevant performance.

Mon 7 SeptComputer Vision and Pattern RecognitionArtificial IntelligenceMachine Learning
The gist
Medical images often have differences in how experts mark important areas, and this uncertainty affects treatment decisions. The authors present a new technique that works with simpler, encoded versions of these images to predict different possible segmentations efficiently. Their method speeds up the processing by up to fourteen times without losing important accuracy, helping with tasks like planning radiation therapy and identifying organs. This approach makes handling complex 3D medical images more practical.
Open 2609.07460v1

Kidney tumor detection improves with weak labels and anatomy filtering

Weakly-supervised Kidney Tumor Classification from CT Scans with Multi-Instance Learning and Anatomical Filtering

Abstract: Deep learning models for CT scan analysis are often limited by the scarcity of precise pixel-level annotations, which require significant radiologist effort to produce. Training on scan-level labels alone reduces annotation requirements but introduces challenges: low supervision ratios and large input volumes make models prone to overfitting and shortcut learning. In this work, we investigate two complementary methods to address these challenges: multi-instance learning (MIL) and anatomical filtering. MIL divides CT volumes into 2D slice instances, enabling efficient 2D architectures with ImageNet pretraining rather than computationally demanding 3D models. Anatomical filtering uses Compass, our self-supervised body part regression model, to crop scans to pathology-relevant subregions without requiring segmentation masks. We evaluate two MIL frameworks - Attention-based MIL (ABMIL) and FocusMIL - on kidney tumor classification across one internal dataset (TUH) and two external datasets (KiTS23 and TCGA-KiRC). Our best models achieve F1 = 0.83 on the internal test set using only scan-level labels. We further show that anatomical filtering with the Compass model is critical for the out-of-distribution generalization of embedding-based ABMIL, while instance-based FocusMIL demonstrates greater inherent robustness to distribution shift. While evaluated on kidney tumors, we consider this a proof-of-concept for a broader weakly supervised CT classification pipeline applicable to other organs and pathologies.

Mon 7 SeptComputer Vision and Pattern Recognition
The gist
Getting detailed labels for CT scans is hard and takes a lot of effort from doctors. The authors show that using only broad labels about a whole scan, combined with smart methods that look at parts of the scan individually and use knowledge about body regions, can still successfully identify kidney tumors. They tested these methods on multiple datasets and found they work well even when scans come from different sources. This approach might also work for detecting problems in other organs.
Open 2609.07178v1

Quantum walk simulates X-ray scattering for better imaging

QCxSimulation: Scatter-Aware X-Ray Projection Radiography via Discrete-Time Quantum Walks

Abstract: X-ray projection radiography is a non-invasive imaging technique used in medical diagnostics and industrial inspection. The simulation of X-ray projections is commonly used to optimise acquisition protocols and improve image quality before performing costly scans. Classical photon transport simulations that include realistic X-ray scattering physics are computationally expensive because they require the sampling of a large number of distinct scattering paths. This limits the practical exploration of parameter spaces such as beam energy. Quantum computing offers the potential to solve high-dimensional problems faster by making use of quantum properties such as superposition. This work introduces a discrete-time quantum walk algorithm that simulates the transport of X-ray photons through heterogeneous volumes. It approximates the physics of X-ray projection radiography, including processes such as photoelectric absorption and higher-order scattering, including Compton and Rayleigh scattering. The quantum walk encodes all admissible photon paths into a single quantum state, enabling all scattering histories to be propagated simultaneously via the superposition principle. This quantum state representation enables flexible readout of various imaging modalities, including the primary, i.e., unscattered, image, or images exclusively containing Rayleigh and Compton scattering of specified orders. A quantitative comparison with classically computed reference simulations shows that the proposed quantum walk accurately reproduces radiographic projections, given the limitations of the underlying physical model. These results indicate that quantum circuits for X-ray transport can produce accurate radiographic images and imply that, as quantum hardware scales up, these algorithms could outperform classical Monte Carlo-based approaches in large-scale, scatter-aware virtual imaging studies.

Mon 7 SeptEmerging Technologies
The gist
Simulating how X-ray photons move and scatter inside objects is usually slow and expensive on regular computers. The authors develop a special quantum computing algorithm that can represent many possible photon paths at once, speeding up the simulation. Their method can mimic different types of X-ray interactions important for producing medical and industrial images. Tests show their quantum approach creates images that closely match classical simulations, hinting that future quantum hardware could do this faster and more efficiently.
Open 2609.07089v1

Concept guided model improves lung lesion segmentation accuracy

CGSM: Concept-Guided Segmentation Model for Precise Pulmonary Lesion Delineation

Abstract: Accurate segmentation of pulmonary lesions is essential for effective clinical diagnosis and treatment strategies. Existing segmentation approaches often lack task-specific semantic guidance, as text-based annotations typically offer coarse localization of lesions, leading to inadequate delineation of lesion boundaries and poor performance on small-scale lesions. To address this, we propose CGSM, a Concept-Guided Segmentation Model that integrates LLM-generated and clinically reviewed concepts into the segmentation process. Specifically, we design a Concept-Visual Alignment Module (CVAM) to activate relevant tokens within the concepts that align with visual features, enhancing the interaction between textual and visual information. In addition, we introduce a Concept Modulated Decoder (CM-Decoder), which uses concepts from CVAM as modulation signals to facilitate the adaptive fusion of image and text features, improving the segmentation accuracy. Extensive experiments on two public datasets show that CGSM achieves state-of-the-art performance, with results of 91.59% Dice and 84.49% mIoU on the QaTa-COV19 dataset, demonstrating its effectiveness in pulmonary lesion segmentation.

Mon 7 SeptComputer Vision and Pattern Recognition
The gist
Identifying lung lesions accurately in medical images is important for diagnosis and treatment, but existing methods often miss fine details or struggle with small lesions. The authors propose a new approach called CGSM that uses concepts generated by large language models and reviewed by experts to guide the segmentation process. This method combines text and image information more effectively to outline lesions precisely. Tests on public datasets show CGSM performs better than previous models in detecting lung lesions.
Open 2609.07004v1