On Regularized Losses for Weakly-supervised CNN Segmentation
Minimization of regularized losses is a principled approach to weak supervision well-established in deep learning, in general. However, it is largely overlooked in semantic segmentation currently dominated by methods mimicking full supervision via "fake" fully-labeled training masks (proposals) generated from available partial input. To obtain such full masks the typical methods explicitly use standard regularization techniques for "shallow" segmentation, e.g. graph cuts or dense CRFs. In contrast, we integrate such standard regularizers directly into the loss functions over partial input. This approach simplifies weakly-supervised training by avoiding extra MRF/CRF inference steps or layers explicitly generating full masks, while improving both the quality and efficiency of training. This paper proposes and experimentally compares different losses integrating MRF/CRF regularization terms. We juxtapose our regularized losses with earlier proposal-generation methods using explicit regularization steps or layers. Our approach achieves state-of-the-art accuracy in semantic segmentation with near full-supervision quality.
Code (0)
등록된 구현이 없습니다.
Tasks
SegmentationSemantic SegmentationSimilar Papers 제목 키워드 기반
Robust Trust Region for Weakly Supervised Segmentation
Acquisition of training data for the standard semantic segmentation is expensive if requiring that each pixel is labeled. Yet, current methods significantly deteriorate in weakly supervised settings, e.g. where a fractio…
SegmentationSemantic SegmentationWeakly supervised segmentationDynamic Feature Regularized Loss for Weakly Supervised Semantic Segmentation
We focus on tackling weakly supervised semantic segmentation with scribble-level annotation. The regularized loss has been proven to be an effective solution for this task. However, most existing regularized losses only …
Semantic SegmentationWeakly supervised Semantic SegmentationWeakly-Supervised Semantic SegmentationRegularized Loss for Weakly Supervised Single Class Semantic Segmentation
Fully supervised semantic segmentation is highly successful, but obtaining dense ground truth is expensive. Thus there is an increasing interest in weakly supervised approaches. We propose a new weakly supervised method …
ObjectSegmentationSemantic SegmentationBeyond Gradient Descent for Regularized Segmentation Losses
The simplicity of gradient descent (GD) made it the default method for training ever-deeper and complex neural networks. Both loss functions and architectures are often explicitly tuned to be amenable to this basic local…
SegmentationSelf-supervised Scale Equivariant Network for Weakly Supervised Semantic Segmentation
Weakly supervised semantic segmentation has attracted much research interest in recent years considering its advantage of low labeling cost. Most of the advanced algorithms follow the design principle that expands and co…
SegmentationSemantic SegmentationWeakly-supervised LearningWeakly supervised Semantic Segmentation+1