Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. Y. Boykov, O. Veksler, and R. Zabih, “Fast approximate energy minimization via graph cuts,” IEEE Trans. Pattern Analysis and Machine Intel., Vol. 23, No. 11, 1222–1239 (2001). https://doi.org/10.1109/34.969114.
2. Y. Boykov and V. Kolmogorov, “An experimental comparison of min-cut/maxflow algorithms for energy minimization in vision,” IEEE Trans. Pattern Analysis and Machine Intel., Vol. 26, No. 9, 1124–1137 (2004). https://doi.org/10.1109/TPAMI.2004.60.
3. M. I. Schlesinger and V. V. Giginyak, “Solution to structural recognition (max,+)-problems by their equivalent transformations. I,” Control Systems and Machines, No. 1, 3–15 (2007).
4. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother, “A comparative study of energy minimization methods for Markov random fields with smoothness-based priors,” IEEE Trans. Pattern Analysis and Machine Intel., Vol. 30, No. 6, 1068–1080 (2008). https://doi.org/10.1109/TPAMI.2007.70844.
5. C. Wang, N. Komodakis, and N. Paragios, “Markov random field modeling, inference & learning in computer vision & image understanding: A survey,” Computer Vision and Image Understanding (CVIU), Vol. 117, Iss. 11, 1610–1627 (2013).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献