Sample and Filter: Nonparametric Scene Parsing via Efficient Filtering
Authors:
- Mohammad NajafiMNMohammad Najafi
- Sarah Taghavi NaminSNSarah Taghavi Namin
- Mathieu SalzmannMSMathieu Salzmann
- Lars PeterssonLPLars Petersson
- 1 June 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 33, 607-615
Abstract
Scene parsing has attracted a lot of attention in computer vision. While parametric models have proven effective for this task, they cannot easily incorporate new training data. By contrast, nonparametric approaches, which bypass any learning phase and directly transfer the labels from the training data to the query images, can readily exploit new labeled samples as they become available. Unfortunately, because of the computational cost of their label transfer procedures, state-of-the-art nonparametric methods typically filter out most training images to only keep a few relevant ones to label the query. As such, these methods throw away many images that still contain valuable information and generally obtain an unbalanced set of labeled samples. In this paper, we introduce a nonparametric approach to scene parsing that follows a sample-andfilter strategy. More specifically, we propose to sample labeled superpixels according to an image similarity score, which allows us to obtain a balanced set of samples. We then formulate label transfer as an efficient filtering procedure, which lets us exploit more labeled samples than existing techniques. Our experiments evidence the benefits of our approach over state-of-the-art nonparametric methods on two benchmark datasets.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Inference Methods for CRFs with Co-occurrence StatisticsInternational Journal of Computer Vision, 2012
- SuperparsingInternational Journal of Computer Vision, 2012
- PatchMatchGraph: Building a Graph of Dense Patch Correspondences for Label Transfer2012
- Domain transform for edge-aware image and video processingACM Transactions on Graphics, 2011
- Fast High‐Dimensional Filtering Using the Permutohedral LatticeComputer Graphics Forum, 2010
- PatchMatchACM Transactions on Graphics, 2009
- Gaussian KD-trees for fast high-dimensional filteringACM Transactions on Graphics, 2009
- Robust Higher Order Potentials for Enforcing Label ConsistencyInternational Journal of Computer Vision, 2009
- Efficient Graph-Based Image SegmentationInternational Journal of Computer Vision, 2004
- An Efficient Method for Weighted Sampling without ReplacementSIAM Journal on Computing, 1980