The Community for Technology Leaders
2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2013)
Portland, OR, USA
June 23, 2013 to June 28, 2013
ISSN: 1063-6919
ISBN: 978-0-7695-4989-7
pp: 1908-1915
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.
INDEX TERMS
high-order, graphlet, weakly segmentation
CITATION

L. Zhang, M. Song, Z. Liu, X. Liu, J. Bu and C. Chen, "Probabilistic Graphlet Cut: Exploiting Spatial Structure Cue for Weakly Supervised Image Segmentation," 2013 IEEE Conference on Computer Vision and Pattern Recognition(CVPR), Portland, OR, USA USA, 2013, pp. 1908-1915.
doi:10.1109/CVPR.2013.249
94 ms
(Ver 3.3 (11022016))