On total variation minimization and surface evolution using parametric maximum flows

International Journal of Computer Vision

Volumn 84, Issue 3, 2009, Pages 288-307

  Chambolle, Antonin ^a   Darbon, Jérôme ^b  

^a CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Crystalline and anisotropic mean curvature flow; Max flow min cut; Parametric max flow algorithms; Submodular functions; Total variation; Variational approaches

Indexed keywords

CRYSTALLINE AND ANISOTROPIC MEAN CURVATURE FLOW; MAX-FLOW/MIN-CUT; PARAMETRIC MAX-FLOW ALGORITHMS; SUBMODULAR FUNCTIONS; TOTAL VARIATION; VARIATIONAL APPROACHES;

ANISOTROPY; COMPUTATIONAL COMPLEXITY; COMPUTER VISION; DIFFERENTIATION (CALCULUS); EQUATIONS OF MOTION; PARTIAL DIFFERENTIAL EQUATIONS;

CRYSTALLINE MATERIALS;

EID: 67349189437     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-009-0238-9     Document Type: Article

References (61)

1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows. Theory, algorithms, and applications. Englewood Cliffs: Prentice-Hall.
2. W. K. Allard 2007 Total variation regularization for image denoising, I. Geometric theory SIAM Journal on Mathematical Analysis 39 4 1150 1190
3. R. Almgren 1993 Variational algorithms and pattern formation in dendritic solidification Journal of Computational Physics 106 2 337 354
4. F. Almgren J. E. Taylor L.-H. Wang 1993 Curvature-driven flows: a variational approach SIAM Journal on Control and Optimization 31 2 387 438
5. N Mathematische Annalen 332 2 329 366 (Pubitemid 40630699)
6. Babenko, M. A., Derryberry, J., Goldberg, A. V., Tarjan, R. E., & Zhou, Y. (2007). Experimental evaluation of parametric max-flow algorithms. In Lecture notes in computer science (Vol. 4252, pp. 256-269). Berlin: Springer. (Pubitemid 350259674)
7. A. Beck M. Teboulle 2009 A fast iterative shrinkage-thresholding algorithm for linear inverse problems SIAM Journal on Imaging Sciences 2 1 183 202
8. G. Bellettini M. Paolini 1996 Anisotropic motion by mean curvature in the context of Finsler geometry Hokkaido Mathematical Journal 25 3 537 566
9. G. Bellettini M. Novaga M. Paolini 1999 Facet-breaking for three-dimensional crystals evolving by mean curvature Interfaces and Free Boundaries 1 1 39 55
10. G. Bellettini V. Caselles A. Chambolle M. Novaga 2006 Crystalline mean curvature flow of convex sets Archive for Rational Mechanics and Analysis 179 1 109 152 (Pubitemid 41697406)
11. E. Boros P. L. Hammer 2002 Pseudo-boolean optimization Discrete Applied Mathematics 123 1-3 155 225
12. Bouchitté, G. (1998). Recent convexity arguments in the calculus of variations. In Lecture notes from the 3rd int. summer school on the calculus of variations, Pisa.
13. Boykov, Y., & Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts. In International conference on computer vision, pp. 26-33.
14. Y. Boykov V. Kolmogorov 2004 An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision IEEE Transactions on Pattern Analysis and Machine Intelligence 26 9 1124 1137
15. Y. Boykov O. Veksler R. Zabih 2001 Fast approximate energy minimization via graph cuts IEEE Transactions on Pattern Analysis and Machine Intelligence 23 11 1222 1239 (Pubitemid 33137959)
16. Boykov, Y., Kolmogorov, V., Cremers, D., & Delong, A. (2006). An integral solution to surface evolution PDEs via Geo-Cuts. In A. Leonardis, H. Bischof, & A. Pinz (Eds.), Lecture notes in computer science : Vol. 3953. European conference on computer vision (ECCV) (pp. 409-422). Graz, Austria, May 2006. Berlin: Springer. (Pubitemid 44029694)
17. V. Caselles A. Chambolle 2006 Anisotropic curvature-driven flow of convex sets Nonlinear Analysis 65 8 1547 1577 (Pubitemid 44038102)
18. V. Caselles A. Chambolle M. Novaga 2007 The discontinuity set of solutions of the TV denoising problem and some extensions Multiscale Modeling and Simulation 6 3 879 894
19. A. Chambolle 2004 An algorithm for mean curvature motion Interfaces and Free Boundaries 6 2 195 218 (Pubitemid 38977091)
20. Chambolle, A. (2005). Total variation minimization and a class of binary MRF models. In Lecture notes in computer science. Energy minimization methods in computer vision and pattern recognition (pp. 136-152). Berlin: Springer. (Pubitemid 43722931)
21. A. Chambolle M. Novaga 2007 Approximation of the anisotropic mean curvature flow Mathematical Models and Methods in the Applied Sciences 17 6 833 844
22. A. Chambolle M. Novaga 2008 Implicit time discretization of the mean curvature flow with a discontinuous forcing term Interfaces and Free Boundaries 10 3 283 300
23. 1 function approximation SIAM Journal on Applied Mathematics 65 5 1817 1837 (electronic)
24. L. D. Cohen 1991 On active contour models and balloons CVGIP: Image Understanding 53 2 211 218
25. P. L. Combettes V. R. Wajs 2005 Signal recovery by proximal forward-backward splitting Multiscale Modeling and Simulation 4 4 1168 1200 (electronic) (Pubitemid 44932287)
26. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms. Cambridge: MIT Press.
27. W. H. Cunningham 1985 On submodular function minimization Combinatoria 5 185 192
28. 1 data fidelity as a contrast invariant filter. In Proceedings of the 4th international symposium on image and signal processing and analysis (ISPA 2005), Zagreb, Croatia, September 2005.
29. J. Darbon M. Sigelle 2006 Image restoration with discrete constrained total variation part i: fast and exact optimization Journal of Mathematical Imaging and Vision 26 3 261 276 (Pubitemid 44916361)
30. M. J. Eisner D. G. Severance 1976 Mathematical techniques for efficient record segmentation in large shared databases Journal of the ACM 23 4 619 635
31. Ekeland, I., & Témam, R. (1999). Classics in applied mathematics : Vol. 28. Convex analysis and variational problems. Philadelphia: SIAM. (English ed., translated from the French).
32. Federer, H. (1969). Geometric measure theory. New York: Springer.
33. Freedman, D., & Drineas, P. (2005). Energy minimization via graph cuts: settling what is possible. In IEEE computer society conference on computer vision and pattern recognition (CVPR) (pp. 939-946).
34. G. Gallo M. D. Grigoriadis R. E. Tarjan 1989 A fast parametric maximum flow algorithm and applications SIAM Journal on Computing 18 1 30 55
35. Giusti, E. (1984). Monographs in mathematics : Vol. 80. Minimal surfaces and functions of bounded variation. Basel: Birkhäuser.
36. Goldberg, A. V., & Tarjan, R. E. (1986). A new approach to the maximum flow problem. In STOC'86: proceedings of the eighteenth annual ACM symposium on theory of computing (pp. 136-146). New York: ACM Press.
37. Goldfarb, D., & Yin, Y. (2007). Parametric maximum flow algorithms for fast total variation minimization. Technical report, Rice University (2007).
38. D. M. Greig B. T. Porteous A. H. Seheult 1989 Exact maximum a posteriori estimation for binary images Journal of the Royal Statistical Society Series B 51 271 279
39. M. Grötschel L. Lovász A. Schrijver 1981 The ellipsoid method and its consequences in combinatorial optimization Combinatoria 1 169 197
40. D. S. Hochbaum 2001 An efficient algorithm for image segmentation, Markov random fields and related problems Journal of the ACM 48 4 686 701 (electronic)
41. D. S. Hochbaum 2005 Complexity and algorithms for convex network optimization and other nonlinear problems A Quarterly Journal of Operations Research 3 3 171 216 (Pubitemid 41436931)
42. Iwata, S., Fleischer, L., & Fujishige, S. (2000). A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. In STOC'00: Proceedings of the thirty-second annual ACM symposium on theory of computing (pp. 97-106). New York: ACM.
43. Juan, O., & Boykov, Y. (2006). Active graph cuts. In Proceedings of the IEEE Computer Society conference on computer vision and pattern recognition (CVPR), (pp. 1023-1029). (Pubitemid 44931434)
44. Kholi, P., & Torr, P. (2005). Efficient solving dynamic Markov random fields using graph cuts. In Proceedings of the 10th international conference on computer vision (pp. 922-929). (Pubitemid 44042280)
45. Kolmogorov, V., & Zabih, R. (2002). What energy functions can be minimized via graph cuts? In European conference on computer vision (Vol. 3, pp. 65-81), May 2002.
46. V. Kolmogorov R. Zabih 2004 What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence 2 26 147 159
47. Kolmogorov, V., Boykov, Y., & Rother, C. (2007). Applications of parametric maxflow in computer vision. In Proceedings of the IEEE 11th international conference on computer vision (ICCV 2007) (pp. 1-8).
48. Lee, J. (2004). A first course in combinatorial optimization. Cambridge: Cambridge University Press.
49. Lovász, L. (1983). Submodular functions and convexity. In Mathematical programming: the state of the art (pp. 235-257). Bonn, 1982. Berlin: Springer.
50. S. Luckhaus T. Sturzenhecker 1995 Implicit time discretization for the mean curvature flow equation Calculus of Variations and Partial Differential Equations 3 2 253 271
51. McCormick, S. T. (1996) Fast algorithms for parametric scheduling come from extensions to parametric maximum flow. In Proceedings of the twenty-eighth annual ACM symposium on theory of computing (pp. 319-328).
52. Murota, K. (2003). SIAM monographs on discrete mathematics and applications. Discrete convex analysis. Philadelphia: SIAM.
53. Nesterov, Y. (2004). Introductory lectures on convex optimization: a basic course. Dordrecht: Kluwer.
54. Nesterov, Y. (2007) Gradient methods for minimizing composite objective function. Technical report, CORE discussion paper 2007/76, Catholic University of Louvain (2007).
55. Paolini, M., & Pasquarelli, F. (2000). Numerical simulation of crystalline curvature flow in 3D by interface diffusion. In GAKUTO international series. Mathematical sciences and applications : Vol. 14. Free boundary problems: theory and applications, II (pp. 376-389). Chiba, 1999. Tokyo: Gakkōtosho.
56. J. C. Picard H. D. Ratliff 1975 Minimum cuts and related problems Networks 5 4 357 370
57. Rockafellar, R. T. (1997). Princeton landmarks in mathematics. Convex analysis. Princeton: Princeton University Press (Reprint of the 1970 original Princeton paperbacks).
58. E. Rouy A. Tourin 1992 A viscosity solutions approach to shape-from-shading SIAM Journal on Numerical Analysis 29 3 867 884
59. A. Schrijver 2000 A combinatorial algorithm minimizing submodular functions in strongly polynomial time Journal of Combinatorial Theory (B) 80 436 355
60. J. A. Sethian 1999 Fast marching methods SIAM Review 41 2 199 235 (electronic)
61. J. N. Tsitsiklis 1995 Efficient algorithms for globally optimal trajectories IEEE Transactions on Automatic Control 40 9 1528 1538