A note on the discrete binary Mumford-Shah model

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

Volumn 4418 LNCS, Issue , 2007, Pages 283-294

  Darbon, Jérôme ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; EDGE DETECTION; GRAPH THEORY; PROBLEM SOLVING;

DATA FIDELITY; DISCRETE VERSION; MUMFORD-SHAH MODEL;

IMAGE PROCESSING;

EID: 37149057048     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71457-6_26     Document Type: Conference Paper

References (33)

1. R.K Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1993.
2. G. Aubert and P. Kornprobst. Mathematical Problems in Image Processing. Springer-Ver lag, 2002.
3. Y. Boykov and M.-P Jolly. Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In Proceedings of International Conference on Computer Vision, pages 105-112, 2001.
4. Y. Boykov and V. Kolmogorov. Computing geodesic and minimal surfaces via graph cuts. In International Conference on Computer Vision, volume 1, pages 26-33, 2003.
5. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/maxflow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(9):1124-1137, 2004.
6. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11):1222-1239, 2001.
7. X. Bresson, S. Esedoglu, P. Vandergheynst, J.P. Thiran, and S. Osher. Global minimizers of the active contour/snake model. Technical Report 05-04, UCLA CAM Report, 2005.
8. V. Caselles and A. Chambolle. Anistropic curvature-driven flow of convex sets. Technical Report 528, CMAP Ecole Polytechnique, 2004.
9. A. Chambolle. Total variation minimization and a class of binary mrf models. In Energy Minimization Methods in Computer Vision and Pattern Recognition, volume LNCS 3757, pages 136 - 152, St. Augustine, Florida, USA, 2005.
10. T. F. Chan, S. Esedoglu, and M. Nikolova. Finding the global minimum for binary image restoration. In Proceedings of the ICIP 2005, pages 121-124, Genova, Italy, 2005.
11. T.F. Chan, S. Esedoglu, and M. Nikolova. Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models. Technical Report 54, UCLA, 2004.
12. T.F. Chan and L. Vese. Active contours without edges. IEEE Transactions on Image Processing, 10(2):266-277, 2002.
13. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 2001.
14. J. Darbon. Composants Logiciels et Algorithmes de minimisation exacte d'énergies dédiś au traitement des images. PhD thesis, Ecole Nationale Supérieure des Télécommunications, October 2005.
15. J. Darbon. Total Variation minimization with L data fidelity as a contrast invariant filter. In Proceedings of the 4th IEEE International Symposium on Image and Signal Processing and Analysis (ISPA 2005), Zagreb, Croatia, September 2005.
16. J. Darbon and M. Sigelle. A fast and exact algorithm for Total Variation minimization. In Proceedings of the 2nd Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA), volume 3522, pages 351-359, Estoril, Portugal, June 2005. Springer-Ver lag.
17. J. Darbon and M. Sigelle. Image restoration with discrete constrained Total Variation part I: Fast and exact optimization. Journal of Mathematical Imaging and Vision, Online First, 2005.
18. P.M. Djurić, Y. Huang, and T. Ghirmai. Perfect sampling : A review and applications to signal processing. IEEE Signal Processing, 50(2):345-256, 2002.
19. S. Geman and D. Geman. Stochastic relaxation, Gibbs distributions, and the bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6):721-741, 1984.
20. D. Greig, B. Porteous, and A. Seheult. Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistics Society, 51(2):271-279, 1989.
21. F. Guichard and J.-M. Morel. Image Iterative Smoothing and PDE's. please write email to fguichard@poseidon-tech.com, 2000.
22. F. Guichard and J.M. Morel. Mathematical morphology "almost everywhere". In the Proceedings of Internationnal Symposium on Mathematical Morpholy, pages 293-303. CSIRO Publishing, April 2002.
23. L. He and S. Osher. Solving the chan-vese model by a multuphase level set algorithm based on the topological derivative. Technical Report CAM 06-56, University of California, Los Angeles (UCLA), October 2006.
24. D. S. Hochbaum. An efficient algorithm for image segmentation, markov random fields and related problems. Journal of the ACM, 48(2):686-701, 2001.
25. V. Kolmogorov and R. Zabih. What energy can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2):147-159, 2004.
26. D. Mumford and J. Shah. Optimal approximation by piecewise smooth functions and associated variational problems. Comm. on Pure and Applied Mathematics, 42:577-685, 1989.
27. S. Osher and N. Paragios, editors. Geometric Level Set Methods. Springer, 2003.
28. J. G. Propp and D. B. Wilson. Exact sampling with coupled Markov chains and statistical mechanics. Random Structures and Algorithms, 9(1):223-252, 1996.
29. J. Serra. Image Analysis and Mathematical Morphology. Academic Press, 1988.
30. B. Song and T.F. Chan. A fast algorithm for level set based optimization. Technical Report CAM 02-68, University of California, Los Angeles (UCLA), December 2002.
31. L. Vese and T.F. Chan. A mutiphase level set framework for image segmentation using the Mumford-Shah model. International Journal of Computer Vision, 50(3) :266-277, 2002.
32. nd edition, 2003.
33. B.A. Zalesky. Network Flow Optimization for Restoration of Images. Journal of Applied Mathematics, 2:4:199-218, 2002.