A parametric maximum flow approach for discrete total variation regularization

Image Processing and Analysis with Graphs: Theory and Practice

Volumn , Issue , 2012, Pages 93-110

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

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

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84937928741     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/b12281     Document Type: Chapter

References (30)

1. J. Moreau, “Proximite et dualite dans un espace hilbertien,” Bulletin de la S.M.F., vol. 93, pp. 273-299, 1965.
2. R. Rockafellar and R. Wets, Variational Analysis. Springer-Verlag, Heidelberg, 1998.
3. J. Eckstein and D. Bertsekas, “On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators,” Math. Program., vol. 55, pp. 293-318, 1992.
4. P. Lions and B. Mercier, “Splitting algorithms for the sum of two nonlinear operators,” SIAM J. on Numerical Analysis, vol. 16, pp. 964-979, 1992.
5. I. Daubechies, M. Defrise, and C. De Mol, “An iterative thresholding algorithm for linear inverse problems with a sparsity constraint,” Comm. Pure Appl. Math., vol. 57, no. 11, pp. 1413-1457, 2004. [Online]. Available: http://dx.doi.org/10.1002/cpa.20042
6. P. L. Combettes and V. R. Wajs, “Signal recovery by proximal forward-backward splitting,” Multiscale Model. Simul., vol. 4, no. 4, pp. 1168-1200 (electronic), 2005. [Online]. Available: http://dx.doi.org/10.1137/050626090
7. J. C. Picard and H. D. Ratliff, “Minimum cuts and related problems,” Networks, vol. 5, no. 4, pp. 357-370, 1975.
8. D. M. Greig, B. T. Porteous, and A. H. Seheult, “Exact maximum a posteriori estimation for binary images,” J. R. Statist. Soc. B, vol. 51, pp. 271-279, 1989.
9. C. Gallo, M. D. Grigoriadis, and R. E. Tarjan, “A fast parametric maximum flow algorithm and applications,” SIAM J. Comput., vol. 18, no. 1, pp. 30-55, 1989.
10. M. Eisner and D. Severance, “Mathematical techniques for efficient record segmentation in large shared databases,” J. Assoc. Comput. Mach., vol. 23, no. 4, pp. 619-635, 1976.
11. D. S. Hochbaum, “An efficient algorithm for image segmentation, Markov random fields and related problems,” J. ACM, vol. 48, no. 4, pp. 686-701 (electronic), 2001.
12. Y. Boykov, O. Veksler, and R. Zabih, “Fast approximate energy minimization via graph cuts,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 23, no. 11, pp. 1222-1239, 2001.
13. J. Darbon and M. Sigelle, “Image restoration with discrete constrained Total Variation part I: Fast and exact optimization,” J. Math. Imaging Vis., vol. 26, no. 3, pp. 261-276, December 2006.
14. J. Darbon and M. Sigelle, “Image restoration with discrete constrained Total Variation part II: Levelable functions, convex priors and non-convex cases,” Journal of Mathematical Imaging and Vision, vol. 26, no. 3, pp. 277-291, December 2006.
15. A. Chambolle and J. Darbon, “On total variation minimization and surface evolution using parametric maximum flows,” International Journal of Computer Vision, vol. 84, no. 3, pp. 288-307, 2009.
16. J. Darbon, “Global optimization for first order Markov random fields with submodular priors,” Discrete Applied Mathematics, June 2009. [Online]. Available: http://dx.doi.org/10.1016/j.dam.2009.02.026
17. A. Chambolle, “Total variation minimization and a class of binary MRF models,” in Energy Minimization Methods in Computer Vision and Pattern Recognition, ser. Lecture Notes in Computer Science, 2005, pp. 136-152.
18. C. Ishikawa, “Exact optimization for Markov random fields with convex priors,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 10, pp. 1333-1336, 2003.
19. A. Chambolle, S. Levine, and B. Lucier, “An upwind finite-difference method for total variation-based image smoothing,” SIAM Journal on Imaging Sciences, vol. 4, no. 1, pp. 277-299, 2011. [Online]. Available: http://link.aip.org/link/?SII/4/277/1
20. A. Chambolle and T. Pock, “A first-order primal-dual algorithm for convex problems with applications to imaging,” Journal of Mathematical Imaging and Vision, vol. 40, pp. 120-145, 2011. [Online]. Available: http://dx.doi.org/10.1007/s10851-010-0251-1
21. F. Bach, “Convex analysis and optimization with submodular functions: a tutorial,” INRIA, Tech. Rep. HAL 00527714, 2010.
22. L. Lovasz, “Submodular functions and convexity,” in Mathematical programming: the state of the art (Bonn, 1982). Berlin: Springer, 1983, pp. 235-257.
23. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network flows. Englewood Cliffs, NJ: Prentice Hall Inc., 1993.
24. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms. The MIT Press, 2001.
25. P. Christiano, J. A. Kelner, A. Madry, D. A. Spielman, and S.-H. Teng, “Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs,” CoRR, vol. abs/1010.2921, 2010.
26. Y. Boykov and V. Kolmogorov, “An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1124-1137, September 2004.
27. A. V. Goldberg and R. E. Tarjan, “A new approach to the maximum flow problem,” in STOC’86: Proc. of the eighteenth annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM Press, 1986, pp. 136-146.
28. A. Beck and M. Teboulle, “Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems,” Trans. Img. Proc., vol. 18, pp. 2419-2434, November 2009. [Online]. Available: http://dx.doi.org/10.1109/TIP.2009.2028250
29. Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, 2004.
30. Y. Nesterov, “Gradient methods for minimizing composite objective function,” Catholic University of Louvain, Tech. Rep. CORE Discussion Paper 2007/76, 2007.