English

Efficient KernelSHAP Explanations for Patch-based 3D Medical Image Segmentation

Computer Vision and Pattern Recognition 2026-04-14 v1 Artificial Intelligence

Abstract

Perturbation-based explainability methods such as KernelSHAP provide model-agnostic attributions but are typically impractical for patch-based 3D medical image segmentation due to the large number of coalition evaluations and the high cost of sliding-window inference. We present an efficient KernelSHAP framework for volumetric CT segmentation that restricts computation to a user-defined region of interest and its receptive-field support, and accelerates inference via patch logit caching, reusing baseline predictions for unaffected patches while preserving nnU-Net's fusion scheme. To enable clinically meaningful attributions, we compare three automatically generated feature abstractions within the receptive-field crop: whole-organ units, regular FCC supervoxels, and hybrid organ-aware supervoxels, and we study multiple aggregation/value functions targeting stabilizing evidence (TP/Dice/Soft Dice) or false-positive behavior. Experiments on whole-body CT segmentations show that caching substantially reduces redundant computation (with computational savings ranging from 15% to 30%) and that faithfulness and interpretability exhibit clear trade-offs: regular supervoxels often maximize perturbation-based metrics but lack anatomical alignment, whereas organ-aware units yield more clinically interpretable explanations and are particularly effective for highlighting false-positive drivers under normalized metrics.

Keywords

Cite

@article{arxiv.2604.11775,
  title  = {Efficient KernelSHAP Explanations for Patch-based 3D Medical Image Segmentation},
  author = {Ricardo Coimbra Brioso and Giulio Sichili and Damiano Dei and Nicola Lambri and Pietro Mancosu and Marta Scorsetti and Daniele Loiacono},
  journal= {arXiv preprint arXiv:2604.11775},
  year   = {2026}
}
R2 v1 2026-07-01T12:07:01.346Z