维普期刊资源整合服务平台（V6.5）

380篇 您的检索式：作者名="Boykov Y"

选中清除导出查看参考文献查看引证文献引用追踪共19页首页上一页第1页下一页末页 /19 跳转

	题名	作者	年代	出处	被引量
1	An experimental comparison of mincut/max-flow algorithms for energy minimization in vision显示文摘	Boykov Y Kolmogorov V	2004	IEEE Trans Pattern Anal Mach Intell2004，26，9：	1
2	An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision显示文摘	BOYKOV Y KOLMOGOROV V	2004	IEEE Transactions on Pattern Analysis and Machine Intelligence2004，26，9：	1
3	Graph Cuts and Efficient N-D Segmentation显示文摘	Boykov Y Gareth F	2006	International Journal of Computer Vision2006，70，2：	1
4	Fast approximate energy minimization via graph cuts显示文摘	BOYKOV Y VEKSLER O ZABIH R	2001	IEEE Transactions on Pattern Analysis and Machine Intelligence2001，23，11：	1
5	Fast approximate energy minimization via graph cuts显示文摘	Boykov Y Veksle O Zabih R	2001	IEEE Transactions on Pattern Analysis and Machine Intelligence2001，23，11：	1
6	Graph cuts and efficient ND image segmentation 显示文摘	BOYKOV Y FUNKA-LEA G	2006	International Journal of Computer Vision2006，70，2：	1
7	Active graph cuts显示文摘	Juan O Boykov Y	2006	CVPR2006，1，：	1
8	An experimental comparison of mincut/ max-flow algorithms for energy minimization in vision显示文摘	Boykov Y Kolmogorov V	2004	IEEE Transactions on Pattern Analysis and Machine Intelligence2004，26，9：	1
9	Fast approximate energy minimization via graph cuts 显示文摘	BOYKOV Y VEKSLER O Zabih R	2001	IEEE Transcations on Pattern Analysis and Machine Intelligence2001，23，11：	1
10	An experimental comaarison of min-cut/max-flow algorithms for energy minirrization in vision 显示文摘	Boykov Y Kolmogorov V	2004	IEEE Transactions on Pattern Analysis and Ma-chine Intelligence2004，26，9：	1
11	Graph cuts and efficient N-D image segmentation显示文摘	BOYKOV Y FUNKA-LEA G	2006	International Journal of Computer Vision2006，70，2：	1
12	An experimental comparison of mincut/max-flow algorithms for energy minimization in vision显示文摘	Boykov Y Kolmogorov V	2004	IEEE Transactions on Pattern Analysis and Machine Intelligence2004，26，9：	1
13	Fast approximate energy minimization via graph cuts 显示文摘	Boykov Y Veksler O Zabih R	2001	IEEE Transactions on Pattern Analysis and Machine Intelligence2001，23，11：	1
14	Fast approximate energy minimization via graph cuts显示文摘	Boykov Y Veksler O Zabih R	2001	IEEE Transactions on Pattern Analysis and Ma- chine Intelligence2001，23，11：	1
15	Fast approximate energy minimization via graph cuts 显示文摘	BOYKOV Y VEKSLER O ZABIH R	2001	IEEE Transac- tions on Pattern Analysis and Machine Intelligence2001，23，11：	1
16	An experimental comparison of min -cut/rnax-flow algorithms for energy minimization in vision显示文摘	Boykov Y Kolmogorov V	2004	IEEE Transactions on Pattern Analysis and Machine Intelligence2004，26，9：	1
17	An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision显示文摘	Boykov Y Kolmogorov V	2004	IEEE Trans on PAMI2004，26，9：	1
18	Fast approximate energy minimization via graph cuts 显示文摘	Boykov Y Veksler O Zabih R	2001	IEEE Transactions on Pattern Analysis and Machine Intelligence2001，23，：	1
19	Fast Approximate Energy Minimization via Graph Cuts显示文摘	Boykov Y Veksler O Zabih R	2001	IEEE Transactions on Pattern Analysis and Machine Intelligence2001，23，11：	1
20	An experimental comparison of rain-cut/ max-flow algorithms for energy minimization in vision 显示文摘	Boykov Y Kolmogorov V	2001	IEEE Transactions on Pattern Analysis and Machine Intelligence2001，26，9：	1

返回顶部每页显示：

共19页首页上一页第1页下一页末页 /19 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示