Efficient Transductive Semantic Segmentation

Semantically describing the contents of images is one of the classical problems of computer vision. With huge numbers of images being made available daily, there is increasing interest in methods for semantic pixel labelling that exploit large image sets. Graph transduction provides a framework for the flexible inclusion of labeled data that can be exploited in the classification of unlabeled samples without requiring a trained classifier. Unfortunately, current approaches lack the scalability to tackle the joint segmentation of large image sets. Here we introduce an efficient flexible graph transduction approach to semantic segmentation that allows simple and efficient leveraging of large image sets without requiring separate computation of unary potentials, or a trained classifier. We demonstrate that this technique can handle far larger graphs than previous methods, and that results continue to improve as more labeled images are made available. Furthermore, we show that the method is able to benefit from dense or sparse unary labels when they are available.


Published in:
2016 Ieee Winter Conference On Applications Of Computer Vision (Wacv 2016)
Presented at:
Winter Conference on Applications of Computer Vision (WACV)
Year:
2016
Publisher:
New York, Ieee
ISSN:
2472-6737
ISBN:
978-1-5090-0641-0
Laboratories:




 Record created 2016-10-18, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)