Weakly-Supervised Semantic Segmentation by Learning Label Uncertainty
Robby Neven, Davy Neven, Bert De Brabandere, Marc Proesmans, Toon, Goedem\'e

TL;DR
This paper introduces a novel loss function for training segmentation networks using mostly weakly-annotated data, effectively learning label uncertainty within bounding boxes to improve segmentation accuracy.
Contribution
The proposed loss function enables training with limited pixel-perfect labels by leveraging bounding-box annotations and learning label uncertainty for online mask generation.
Findings
Achieves ~98.33% of baseline IoU on binary segmentation
Reaches 97.12% of baseline mIoU on multi-class segmentation
Effective with only 18% pixel-perfect labels in training data
Abstract
Since the rise of deep learning, many computer vision tasks have seen significant advancements. However, the downside of deep learning is that it is very data-hungry. Especially for segmentation problems, training a deep neural net requires dense supervision in the form of pixel-perfect image labels, which are very costly. In this paper, we present a new loss function to train a segmentation network with only a small subset of pixel-perfect labels, but take the advantage of weakly-annotated training samples in the form of cheap bounding-box labels. Unlike recent works which make use of box-to-mask proposal generators, our loss trains the network to learn a label uncertainty within the bounding-box, which can be leveraged to perform online bootstrapping (i.e. transforming the boxes to segmentation masks), while training the network. We evaluated our method on binary segmentation tasks,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
