Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Alter, F., Caselles, V., Chambolle, A.: A characterization of convex calibrable sets in ℝ N . Math. Ann. 332(2), 329–366 (2005)
2. Alter, F., Caselles, V., Chambolle, A.: Evolution of characteristic functions of convex sets in the plane by the minimizing total variation flow. Interfaces Free Bound. 7(1), 29–53 (2005)
3. Bell, W.: A C++ implementation of a Max Flow-Graph Cut algorithm. Computer Science Dept., Cornell University (November 2001), available at http://www.cs.cornell.edu/vision/wbell/
4. Bouchitté, G.: Recent convexity arguments in the calculus of variations. In: Lecture Notes from the 3rd Int. Summer School on the Calculus of Variations, Pisa (1998)
5. Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Analysis and Machine Intelligence 26(9), 1124–1137 (2004)
Cited by
209 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献