pith. sign in

arxiv: 1802.00470 · v1 · pith:YCSBXXRTnew · submitted 2018-02-01 · 💻 cs.CV

Learning random-walk label propagation for weakly-supervised semantic segmentation

classification 💻 cs.CV
keywords segmentationtraininglabelingssemanticapproachgivenlearningnetwork
0
0 comments X
read the original abstract

Large-scale training for semantic segmentation is challenging due to the expense of obtaining training data for this task relative to other vision tasks. We propose a novel training approach to address this difficulty. Given cheaply-obtained sparse image labelings, we propagate the sparse labels to produce guessed dense labelings. A standard CNN-based segmentation network is trained to mimic these labelings. The label-propagation process is defined via random-walk hitting probabilities, which leads to a differentiable parameterization with uncertainty estimates that are incorporated into our loss. We show that by learning the label-propagator jointly with the segmentation predictor, we are able to effectively learn semantic edges given no direct edge supervision. Experiments also show that training a segmentation network in this way outperforms the naive approach.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.