MC-PanDA: Mask Confidence for Panoptic Domain Adaptation

Ivan Martinovic, Josip Saric, Siniša Šegvić
2/14/2026

No official code found. Best implementation: helen1c/MC-PanDA (6 stars, MIT, last commit 2025-01-07).

Abstract

Domain adaptive panoptic segmentation promises to resolve the long tail of corner cases in natural scene understanding. Previous state of the art addresses this problem with cross-task consistency, careful system-level optimization and heuristic improvement of teacher predictions. In contrast, we propose to build upon remarkable capability of mask transformers to estimate their own prediction uncertainty. Our method avoids noise amplification by leveraging fine-grained confidence of panoptic teacher predictions. In particular, we modulate the loss with mask-wide confidence and discourage back-propagation in pixels with uncertain teacher or confident student. Experimental evaluation on standard benchmarks reveals a substantial contribution of the proposed selection techniques. We report 47.4 PQ on Synthia to Cityscapes, which corresponds to an improvement of 6.2 percentage points over the state of the art. The source code is available at https://github.com/helen1c/MC-PanDA.

View on arXivView PDF

Code Implementations(1)

helen1c/MC-PanDACommunity68%
MIT

Official code for ECCV'24 paper MC-PanDA: Mask Confidence for Panoptic Domain Adaptation.

60C++, CudaJul 8, 20241 years agoMIT
domain-adaptationpanoptic-segmentation

Similar Papers

Cite this paper

@article{martinovic2026mcpanda,
  title  = {MC-PanDA: Mask Confidence for Panoptic Domain Adaptation},
  author = {Ivan Martinovic and Josip Saric and Siniša Šegvić},
  year   = {2026},
  eprint = {2407.14110},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2407.14110},
  journal = {ECCV 2024 2024}
}

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/2407.14110.svg)](https://codeofpaper.com/paper/2407.14110)

Discussion