Shortest path based planar graph cuts for Bi-layer segmentation of binocular stereo video
Huang, Xiangsheng; Gong, Lujin
2011
会议日期2011
页码82-91
会议录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/41331]  
专题数字内容技术与服务研究中心_听觉模型与认知计算
推荐引用方式
GB/T 7714
Huang, Xiangsheng,Gong, Lujin. Shortest path based planar graph cuts for Bi-layer segmentation of binocular stereo video[C]. 见:. 2011.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


©版权所有 ©2017 CSpace - Powered by CSpace