arXiv Machine Learning

Component-Adaptive and Lesion-Level Supervision for Improved Small Structure Segmentation in Brain MRI

arXiv Computer Vision
Sep 11

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

The paper presents a segmentation pipeline for brain metastases in both pre‑ and post‑treatment cases using a 5‑fold nnU‑Net ResEnc‑L ensemble trained on 1,296 four‑modality cases. A rule‑based post‑processing cascade improves the lesion‑wise Dice similarity coefficient (LW‑DSC) for enhancing tumour, tumour core, whole tumour, and resection cavity sub‑regions, achieving LW‑DSC scores of 0.733, 0.751, 0.713, and 0.549 respectively on the official validation leaderboard. The authors conduct a five‑fold out‑of‑fold analysis to validate the robustness of each post‑processing stage, provide a mechanistic explanation of LW‑DSC behaviour, and report thirteen negative results that challenge common intuitions, with all code released under Apache‑2.0.

By Haobin Liu, Xin Wang
Hugging Face Trending Papers
Sep 10

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

The paper presents a pragmatic segmentation pipeline for brain metastases in the BraTS 2026 Task 1, using a 5‑fold nnU-Net ResEnc‑L ensemble trained for 1,000 epochs on 1,296 four‑modality cases. A rule‑based post‑processing cascade tuned for the lesion‑wise Dice similarity coefficient (LW‑DSC) improves performance, achieving LW‑DSC scores of 0.733, 0.751, 0.713, and 0.549 on enhancing tumour, tumour core, whole tumour, and resection cavity, respectively. The authors audit each post‑processing stage with a five‑fold out‑of‑fold analysis, confirm two stages as robust, and provide a mechanistic analysis of LW‑DSC, along with thirteen negative results that challenge common intuitions.

arXiv AI
Jun 3

Efficient Transformer-Based Localized Patch Sampling for Choroid Plexus Segmentation in Multiple Sclerosis

arXiv:2606. 03566v1 Announce Type: cross Abstract: Background: The lateral ventricle choroid plexus (LVCP) is gaining recognition as a key imaging biomarker for multiple sclerosis (MS) related to physical disability and neuroinflammation.

By Po-Jui Lu, Alessandro Cagol, Mario Ocampo-Pineda, Federico Spagnolo, Marina Mastantuono, Andreea-Alexandra Aldea, Jannis M\"uller, \"Ozg\"ur Yaldizli, Matthias Weigel, Lester Melie-Garcia, Roberta Magliozzi, Maria Pia Sormani, Ludwig Kappos, Jens Kuhle, Cristina Granziera
arXiv Machine Learning
Jun 16

Lesion-DDPM: Lesion-Enhanced 3D Diffusion for MS MRI Synthesis

arXiv:2606. 15457v1 Announce Type: cross Abstract: 3D FLAIR MRI is widely recommended as one of the standard MRI sequences for brain imaging in multiple sclerosis (MS), but publicly available MS datasets remain relatively small and vary across scanners, acquisition protocols, and lesion patterns.

By Weidong Zhang, Yongchan Jung, Shafayat Mowla Anik, Furen Xiao, Vasudevan Janarthanan, Enkhzaya Chuluunbaatar, Byeong Kil Lee, Jeeho Ryoo
arXiv Computer Vision
Sep 22

VGG16-MCA UNet: Whole-Tumor Segmentation in 2D FLAIR MRI with Decoder-Side Channel Attention

VGG16-MCA UNet is a hybrid neural network that combines an ImageNet‑pretrained VGG16 encoder with a decoder enhanced by a Multi‑Channel Attention module, trained using Focal Tversky loss to address class imbalance. The model was evaluated as a 2‑D, FLAIR‑only whole‑tumor segmenter on BraTS 2020 and LGG datasets, achieving a pixel‑level Dice of 95.10 % on BraTS and 88.32 % on LGG in a 5‑fold cross‑validation setting. Inference time is 66.32 ms per 256×256 slice on a single RTX 2060, only slightly slower than a VGG16‑UNet without attention. whyItMatters":"The study provides a reproducible 2‑D FLAIR baseline for whole‑tumor segmentation, demonstrating high Dice scores and detailed reporting of training and evaluation protocols."

By Shubham Gajjar, Deep Joshi, Avi Poptani, Vishal Barot
arXiv Computer Vision
Sep 25

BiCC: Bidirectional Connected-Component Loss for Instance-Aware Segmentation

The paper introduces BiCC, a bidirectional connected-component loss that pairs annotation- and prediction-derived partitions to score predicted components on their own scale. By deriving instances from predictions, BiCC directly penalizes false-positive components regardless of size, allowing a balance parameter to control the lesion-wise precision–recall trade-off. Across five datasets, BiCC outperforms existing instance-aware losses such as CC-DiceCE and blob loss in lesion-wise F1, and improves over DiceCE on multiple datasets.

By Luc Bouteille, Frederic Jonske, Jens Kleesiek, Alexander Jaus
arXiv AI
Oct 2

MIRTO: a registration-gated, multiverse-tested evaluation protocol for unsupervised anomaly segmentation in brain MRI

MIRTO is an evaluation protocol for unsupervised anomaly segmentation in brain MRI that explicitly documents key methodological choices—such as registration alignment, threshold setting, and false‑positive budgeting—and measures their impact. It applies a registration check, uses validation data for thresholding, reports realized false‑positive volumes, and repeats each comparison across 15,552 evaluation pipelines with bootstrap intervals. In a study on four UAD methods and 312 BraTS 2020 subjects, MIRTO revealed that an axis‑order mismatch dramatically lowered a diffusion model’s voxel AUROC, and that many performance differences were driven by lesion definition and threshold transfer rather than model quality.

By Negin Kafee Hernashki, Soumick Chatterjee
arXiv Computer Vision
Sep 11

Confidence-Calibrating Regularization for Robust Brain MRI Segmentation Under Domain Shift

The paper introduces CalSAM, a lightweight adaptation framework that fine‑tunes only the mask decoder of the Segment Anything Model (SAM) while keeping its encoders frozen. CalSAM employs a Feature Fisher Information Penalty (FIP) to reduce encoder sensitivity to domain shift and a Confidence Misalignment Penalty (CMP) to curb overconfident voxel‑wise errors. Experiments on cross‑center, scanner‑shift, and motion‑corrupted brain MRI datasets show significant gains in Dice similarity coefficient, Hausdorff distance, and expected calibration error, with only a modest training‑time overhead.

By Behraj Khan, Tahir Qasim Syed, Syed Ahmad Chan Bukhari