Total variation minimization and a class of binary MRF models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3757 LNCS, Issue , 2005, Pages 136-152

  Chambolle, Antonin ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; IMAGE ANALYSIS; IMAGING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

IMAGE DENOISING; RUDIN-OSHER-FATEMI (ROF);

MATHEMATICAL MODELS;

EID: 33646554193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11585978_10     Document Type: Conference Paper

References (25)

1. N. Math. Ann., 332(2):329-366, June 2005.
2. F. Alter, V. Caselles, and A. Chambolle. Evolution of characteristic functions of convex sets in the plane by the minimizing total variation flow. Interfaces Free Bound., 7(l):29-53, 2005.
3. W. Bell. A C++ implementation of a Max Flow-Graph Cut algorithm, available at http://www.cs.cornell.edu/vision/wbell/, November 2001. Computer Science Dept, Cornell University.
4. G. Bouchitté. Recent convexity arguments in the calculus of variations, (lecture notes from the 3rd Int. Summer School on the Calculus of Variations, Pisa), 1998.
5. 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, 26(9):1124-1137, September 2004.
6. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. In International Conference on Computer Vision, pages 377-384, September 1999.
7. V. Caselles and A. Chambolle. Anisotropic curvature-driven flow of convex sets. Technical Report 528, CMAP, Ecole Polytechnique, 2004.
8. A. Chambolle. An algorithm for mean curvature motion. Interfaces Free Bound., 6(2):195-218, 2004.
9. A. Chambolle. An algorithm for total variation minimization and applications. J. Math. Imaging Vision, 20(1-2) :89-97, 2004. Special issue on mathematics and image analysis.
10. 1 function approximation. Technical Report 04-07, UCLA CAM, February 2004.
11. T. F. Chan, S. Esedoglu, and M. Nikolova. Algorithms for finding global minimizers of image segmentation and denoising models. Technical Report 04-54, UCLA CAM, September 2004.
12. J. Darbon and M. Sigelle. Exact optimization of discrete constrained total variation minimization problems. In R. Klette and J. Zunic, editors, Tenth International Workshop on Combinatorial Image Analysis, volume 3322 of LNCS, pages 548-557, December 2004.
13. J. Darbon and M. Sigelle. A fast and exact algorithm for total variation minimization. In J. S. Marques, N. Pérez de la Blanca, and P. Pina, editors, 2nd Iberian Conference on Pattern Recognition and Image Analysis, volume 3522 of LNCS, pages 351-359, June 2005.
14. D.M. Greig, B.T. Porteous, and A.H. Seheult. Exact maximum a posteriori estimation for binary images. J. R. Statist. Soc. B, 51:271-279, 1989.
15. H. Ishikawa. Exact optimization for Markov random fields with convex priors. IEEE Trans. Pattern Analysis and Machine Intelligence, 25(10):1333-1336, 2003.
16. H. Ishikawa and D. Geiger. Segmentation by grouping junctions. In IEEE Conf. Computer Vision and Pattern Recognition, pages 125-131, 1998.
17. V. Kolmogorov and R. Zabih. Multi-camera scene reconstruction via graph cuts. In European Conference on Computer Vision, volume 3, pages 82-96, may 2002.
18. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Analysis and Machine Intelligence, 2(26): 147-159, 2004.
19. S. Paris, F. Sillion, and L. Quan. A surface reconstruction method using global graph cut optimization. International Journal of Computer Vision, 2005. to appear.
20. G. Poggi and A. R. P. Ragozini. Image segmentation by tree-structured Markov random fields. IEEE Signal Processing Letters, 6:155-157, 1999.
21. M. Rivera and J.C. Gee. Two-level MRF models for image restoration and segmentation. In Proc. British Machine Vision Conference, London, volume 2, pages 809-818, Sept. 2004.
22. S. Roy and I. J. Cox. A maximum-flow formulation of the n-camera stereo correspondence problem. In ICCV, pages 492-502, 1998.
23. L.I. Rudin, S. Osher, and E. Fatemi. Nonlinear total variation based noise removal algorithms. Physica D, 60:259-268, 1992.
24. G. Scarpa, G. Poggi, and J. Zerubia. A binary tree-structured MRF model for multispectral satellite image segmentation. Rapport de recherche RR-5062, INRIA Sophia Antipolis, December 2003.
25. B. A. Zalesky. Network flow optimization for restoration of images. J. Appl. Math., 2(4):199-218, 2002.