Author:
Boykov Yuri,Kolmogorov Vladimir
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Y. Boykov and D. Huttenlocher. A new bayesian framework for object recognition. In IEEE Conference on Computer Vision and Pattern Recognition, volume 2, pages517–523, 1999.
2. Y. Boykov, O. Veksler, and R. Zabih. Markov random fields with efficient approxiations. In IEEE Conference on Computer Vision and Pattern Recognition, pages 648–655, 1998.
3. Yuri Boykov and Marie-Pierre Jolly. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In International Conference on Computer Vision, July 2001.
4. Yuri Boykov, Olga Veksler, and Ramin Zabih. Fast approximate energy minimization via graph cuts. In International Conference on Computer Vision, volume I, pages 377–384, 1999.
5. B. V. Cherkassky and A. V. Goldberg. On implementing push-relabel method for the maximum flow problem. Algorithmica, 19:390–410, 1997.
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The role of a digital twin in supporting criminal investigations - a case report about a possible abuse;Forensic Science, Medicine and Pathology;2024-07-18
2. A graph model to describe the network connectivity of trabecular plates and rods;Frontiers in Bioengineering and Biotechnology;2024-05-06
3. Maximum Flow on Highly Dynamic Graphs;2023 IEEE International Conference on Big Data (BigData);2023-12-15
4. Research on seamless image stitching based on fast marching method;IET Image Processing;2023-09-11
5. Sparse Non-local CRF;2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR);2022-06