Author:
Arora Chetan,Banerjee Subhashis,Kalra Prem,Maheshwari S. N.
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell. 26, 1124–1137 (2004)
2. http://vision.middlebury.edu/stereo/code/
3. http://vision.csd.uwo.ca/maxflow-data/
4. Boykov, Y., Funka-Lea, G.: Graph cuts and efficient n-d image segmentation. Int. J. Comput. Vision 70, 109–131 (2006)
5. Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: Proceedings of the International Conference on Computer Vision, vol. 2, pp. 508–515 (2001)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献