Active learning for semantic segmentation with expected change
- 1 June 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3162-3169
- https://doi.org/10.1109/cvpr.2012.6248050
Abstract
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.Keywords
This publication has 19 references indexed in Scilit:
- Large-scale live active learning: Training object detectors with crawled data and crowdsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Beyond active noun tagging: Modeling contextual interactions for multi-class active learningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- TurboPixels: Fast Superpixels Using Geometric FlowsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Dynamic Graph Cuts for Efficient Inference in Markov Random FieldsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2007
- Region Classification with Markov Field Aspect ModelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Constructing Free-Energy Approximations and Generalized Belief Propagation AlgorithmsIEEE Transactions on Information Theory, 2005
- An experimental comparison of min-cut/max- flow algorithms for energy minimization in visionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Semi-Supervised Learning on Riemannian ManifoldsMachine Learning, 2004
- Fast approximate energy minimization via graph cutsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972