SOTAVerified

Universal Semi-Supervised Semantic Segmentation

2018-11-26ICCV 2019Code Available0· sign in to hype

Tarun Kalluri, Girish Varma, Manmohan Chandraker, C. V. Jawahar

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

In recent years, the need for semantic segmentation has arisen across several different applications and environments. However, the expense and redundancy of annotation often limits the quantity of labels available for training in any domain, while deployment is easier if a single model works well across domains. In this paper, we pose the novel problem of universal semi-supervised semantic segmentation and propose a solution framework, to meet the dual needs of lower annotation and deployment costs. In contrast to counterpoints such as fine tuning, joint training or unsupervised domain adaptation, universal semi-supervised segmentation ensures that across all domains: (i) a single model is deployed, (ii) unlabeled data is used, (iii) performance is improved, (iv) only a few labels are needed and (v) label spaces may differ. To address this, we minimize supervised as well as within and cross-domain unsupervised losses, introducing a novel feature alignment objective based on pixel-aware entropy regularization for the latter. We demonstrate quantitative advantages over other approaches on several combinations of segmentation datasets across different geographies (Germany, England, India) and environments (outdoors, indoors), as well as qualitative insights on the aligned representations.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
DensePASSUSSS (Mapillary)mIoU30.87Unverified
DensePASSUSSS (IDD)mIoU26.98Unverified

Reproductions