Probabilistic Graphlet Cut: Exploiting Spatial Structure Cue for Weakly Supervised Image Segmentation

Citations Over TimeTop 1% of 2013 papers

Abstract

Weakly supervised image segmentation is a challenging problem in computer vision field. In this paper, we present a new weakly supervised image segmentation algorithm by learning the distribution of spatially structured super pixel sets from image-level labels. Specifically, we first extract graph lets from each image where a graph let is a small-sized graph consisting of super pixels as its nodes and it encapsulates the spatial structure of those super pixels. Then, a manifold embedding algorithm is proposed to transform graph lets of different sizes into equal-length feature vectors. Thereafter, we use GMM to learn the distribution of the post-embedding graph lets. Finally, we propose a novel image segmentation algorithm, called graph let cut, that leverages the learned graph let distribution in measuring the homogeneity of a set of spatially structured super pixels. Experimental results show that the proposed approach outperforms state-of-the-art weakly supervised image segmentation methods, and its performance is comparable to those of the fully supervised segmentation models.

Related Papers

• → A study and comparison of different image segmentation algorithms(2016)28 cited
• → Medical Image Segmentation(2013)11 cited
• → A real-time parallel combination segmentation method for aluminum surface defect images(2015)8 cited
• → Parameter-free hierarchical image segmentation(2017)1 cited
• Research of interactive image segmentation algorithm based on graph theory(2010)