Shortest path based planar graph cuts for Bi-layer segmentation of binocular stereo video

	Shortest path based planar graph cuts for Bi-layer segmentation of binocular stereo video
	Huang, Xiangsheng
	2011
会议名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议日期	2011
页码	82-91
收录类别	EI
会议录	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
内容类型	会议论文
源URL	[http://ir.ia.ac.cn/handle/173211/5312]
专题	数字内容技术与服务研究中心_听觉模型与认知计算
推荐引用方式 GB/T 7714	Huang, Xiangsheng. Shortest path based planar graph cuts for Bi-layer segmentation of binocular stereo video[C]. 见:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2011.