Unsupervised scene segmentation using sparse coding context

被引:0
作者
Yen-Cheng Liu
Hwann-Tzong Chen
机构
[1] National Tsing Hua University,Department of Computer Science
来源
Machine Vision and Applications | 2013年 / 24卷
关键词
Unsupervised image segmentation; Semantic scene analysis; Sparse coding; Markov random fields;
D O I
暂无
中图分类号
学科分类号
摘要
This paper presents an approach to image understanding on the aspect of unsupervised scene segmentation. With the goal of image understanding in mind, we consider ‘unsupervised scene segmentation’ a task of dividing a given image into semantically meaningful regions without using annotation or other human-labeled information. We seek to investigate how well an algorithm can achieve at partitioning an image with limited human-involved learning procedures. Specifically, we are interested in developing an unsupervised segmentation algorithm that only relies on the contextual prior learned from a set of images. Our algorithm incorporates a small set of images that are similar to the input image in their scene structures. We use the sparse coding technique to analyze the appearance of this set of images; the effectiveness of sparse coding allows us to derive a priori the context of the scene from the set of images. Gaussian mixture models can then be constructed for different parts of the input image based on the sparse-coding contextual prior, and can be combined into an Markov-random-field-based segmentation process. The experimental results show that our unsupervised segmentation algorithm is able to partition an image into semantic regions, such as buildings, roads, trees, and skies, without using human-annotated information. The semantic regions generated by our algorithm can be useful, as pre-processed inputs for subsequent classification-based labeling algorithms, in achieving automatic scene annotation and scene parsing.
引用
收藏
页码:243 / 254
页数:11
相关论文
共 30 条
[1]  
Boykov Y.(2001)Fast approximate energy minimization via graph cuts IEEE Trans. Pattern Anal. Mach. Intell. 23 1222-1239
[2]  
Veksler O.(2002)Mean shift: a robust approach toward feature space analysis IEEE Trans. Pattern Anal. Mach. Intell. 24 603-619
[3]  
Zabih R.(2004)Efficient graph-based image segmentation Int. J. Comput. Vis. 59 167-181
[4]  
Comaniciu D.(2008)Scene completion using millions of photographs Commun. ACM 51 87-94
[5]  
Meer P.(1985)Comparing partitions J. Classif. 2 193-218
[6]  
Felzenszwalb P.F.(1993)Comparing images using the hausdorff distance IEEE Trans. Pattern Anal. Mach. Intell. 15 850-863
[7]  
Huttenlocher D.P.(2004)Distinctive image features from scale-invariant keypoints Int. J. Comput. Vis. 60 91-110
[8]  
Hays J.(2001)Modeling the shape of the scene: a holistic representation of the spatial envelope Int. J. Comput. Vis. 42 145-175
[9]  
Efros A.A.(1971)Objective criteria for the evaluation of clustering methods J. Am. Stat. Assoc. 66 846-850
[10]  
Hubert L.(2004)“grabcut”—interactive foreground extraction using iterated graph cuts ACM Trans. Graph. 23 309-314