UncertainSAM: Fast and Efficient Uncertainty Quantification of the Segment Anything Model

Timo Kaiser, Thomas Norrenbrock, Bodo Rosenhahn
2/14/2026

No official code found. Best implementation: GreenAutoML4FAS/UncertainSAM (14 stars, MIT, last commit 2025-11-05).

Abstract

The introduction of the Segment Anything Model (SAM) has paved the way for numerous semantic segmentation applications. For several tasks, quantifying the uncertainty of SAM is of particular interest. However, the ambiguous nature of the class-agnostic foundation model SAM challenges current uncertainty quantification (UQ) approaches. This paper presents a theoretically motivated uncertainty quantification model based on a Bayesian entropy formulation jointly respecting aleatoric, epistemic, and the newly introduced task uncertainty. We use this formulation to train USAM, a lightweight post-hoc UQ method. Our model traces the root of uncertainty back to under-parameterised models, insufficient prompts or image ambiguities. Our proposed deterministic USAM demonstrates superior predictive capabilities on the SA-V, MOSE, ADE20k, DAVIS, and COCO datasets, offering a computationally cheap and easy-to-use UQ alternative that can support user-prompting, enhance semi-supervised pipelines, or balance the tradeoff between accuracy and cost efficiency.

View on arXivView PDF

Code Implementations(1)

MIT
141Shell, PythonJan 6, 202511 months agoMIT

Similar Papers

Cite this paper

@article{kaiser2026uncertainsam,
  title  = {UncertainSAM: Fast and Efficient Uncertainty Quantification of the Segment Anything Model},
  author = {Timo Kaiser and Thomas Norrenbrock and Bodo Rosenhahn},
  year   = {2026},
  eprint = {2505.05049},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2505.05049},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.05049.svg)](https://codeofpaper.com/paper/2505.05049)

Discussion