Active learning for semantic segmentation with expected change

  • Vezhnevets A
  • Buhmann J
  • Ferrari V
  • 17


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


We address the problem of semantic segmentation: classifying each pixel in an image according to the semantic class it belongs to (e.g. dog, road, car). Most existing methods train from fully supervised images, where each pixel is annotated by a class label. To reduce the annotation effort, recently a few weakly supervised approaches emerged. These require only image labels indicating which classes are present. Although their performance reaches a satisfactory level, there is still a substantial gap between the accuracy of fully and weakly supervised methods. We address this gap with a novel active learning method specifically suited for this setting. We model the problem as a pairwise CRF and cast active learning as finding its most informative nodes. These nodes induce the largest expected change in the overall CRF state, after revealing their true label. Our criterion is equivalent to maximizing an upper-bound on accuracy gain. Experiments on two data-sets show that our method achieves 97% percent of the accuracy of the corresponding fully supervised model, while querying less than 17% of the (super-)pixel labels.

Author-supplied keywords

  • Accuracy
  • Computational modeling
  • Labeling
  • Roads
  • Semantics
  • Training
  • active learning
  • class label
  • expected change
  • fully supervised images
  • image label
  • image segmentation
  • learning (artificial intelligence)
  • pairwise CRF
  • semantic segmentation
  • weakly supervised method

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • A Vezhnevets

  • J M Buhmann

  • V Ferrari

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free