QQ客服 官方微博 反馈留言

	A fast and effective algorithm for image co-segmentation
	Chen, Ji Kai ; Wu, Shunxiang ; Qu, Yanyun ; Wu SX(吴顺祥) ; Qu YY(曲延云)
	2012
关键词	Approximation algorithms Computer science Computer vision Problem solving
英文摘要	Conference Name:Computer Science and Information Engineering, CSIE 2012. Conference Address: Zhengzhou, China. Time:May 19, 2012 - May 20, 2012.; International Science and Education Researcher Association; VIP Information Conference Center; Beijing Gireda Research Center; The target of co-segmentation is to recognize the same object among many images and segment the object [1]. Generally, the model of co-segmentation is a Markov random field (MRF) model [1][2]. The complexity of optimizing the problem is NP-hard [2]. Actually, there is a high-speed approximate algorithm that can solve the problem well, this paper proposed an approximate algorithm which combines the color and shape information and image segmentation preprocessing to simplify the problem. Experiment results show that the algorithm has a high successful rate and its low error rate is also acceptable under the circumstance of its high speed. 漏 2012 Springer-Verlag GmbH.
语种	英语
出处	http://dx.doi.org/10.1007/978-3-642-30223-7_109
出版者	Springer Verlag
内容类型	其他
源URL	[http://dspace.xmu.edu.cn/handle/2288/86718]
专题	信息技术－会议论文
推荐引用方式 GB/T 7714	Chen, Ji Kai,Wu, Shunxiang,Qu, Yanyun,et al. A fast and effective algorithm for image co-segmentation. 2012-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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