QQ客服 官方微博 反馈留言

	Weakly-supervised image parsing via constructing semantic graphs and hypergraphs
	Xie, Wenxuan ; Peng, Yuxin ; Xiao, Jianguo
	2014
英文摘要	In this paper, we address the problem of weakly-supervised image parsing, whose aim is to automatically determine the class labels of image regions given image-level labels only. In the literature, existing studies pay main attention to the formulation of the weakly-supervised learning problem, i.e., how to propagate class labels from images to regions given an affinity graph of regions. Notably, however, the affinity graph of regions, which is generally constructed in relatively simpler settings in existing methods, is of crucial importance to the parsing performance due to the fact that the weakly-supervised image parsing problem cannot be handled within a single image, and that the affinity graph facilitates label propagation among multiple images. Therefore, in contrast to existing methods, we focus on how to make the affinity graph more descriptive through embedding more semantics into it. We develop two novel graphs by leveraging the weak supervision information carefully: 1) Semantic graph, which is established upon a conventional graph by utilizing the proposed weakly-supervised criteria; 2) Semantic hypergraph, which explores both intra-image and inter-image high-order semantic relevance. Experimental results on two standard datasets demonstrate that the proposed semantic graphs and hypergraphs not only capture more semantic relevance, but also perform significantly better than conventional graphs in image parsing. More remarkably, due to the complementariness among the proposed semantic graphs and hypergraphs, the combination of them shows even more promising results.; EI; 0
语种	英语
DOI标识	10.1145/2647868.2654910
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/321434]
专题	计算机科学技术研究所
推荐引用方式 GB/T 7714	Xie, Wenxuan,Peng, Yuxin,Xiao, Jianguo. Weakly-supervised image parsing via constructing semantic graphs and hypergraphs. 2014-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。