English

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

Computer Vision and Pattern Recognition 2018-02-05 v1

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.

Keywords

Cite

@article{arxiv.1802.00470,
  title  = {Learning random-walk label propagation for weakly-supervised semantic segmentation},
  author = {Paul Vernaza and Manmohan Chandraker},
  journal= {arXiv preprint arXiv:1802.00470},
  year   = {2018}
}

Comments

This is a revised version of a paper presented at CVPR 2017 that corrects some equations. See footnotes

R2 v1 2026-06-23T00:08:05.100Z