Global optimization for first order Markov Random Fields with submodular priors

Discrete Applied Mathematics

Volumn 157, Issue 16, 2009, Pages 3412-3423

  Darbon, Jérôme ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Global optimization; Maximum flow s, t minimum cut; Submodular functions

Indexed keywords

ARBITRARY GRAPHS; BINARY VARIABLES; CARDINALITIES; FIRST ORDER; GLOBAL OPTIMIZER; INTERACTION TERM; LEVEL SET; MARKOV RANDOM FIELDS; MARKOVIAN; MAXIMUM FLOW/S, T MINIMUM CUT; NUMERICAL RESULTS; PAIRWISE INTERACTION; SUBMODULAR; SUBMODULAR FUNCTIONS; SUBMODULARITY; SUFFICIENT CONDITIONS;

COMBINATORIAL MATHEMATICS; GLOBAL OPTIMIZATION; HIDDEN MARKOV MODELS; IMAGE SEGMENTATION; LABELS; OPTIMIZATION;

SET THEORY;

EID: 70249141267     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.02.026     Document Type: Article

References (65)

1. Ahuja R.K., Hochbaum D.S., and Orlin J.B. A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem. Algorithmica 39 3 (2004) 189-208
2. Ahuja R.K., Hochbaum D.S., and Orlin J.B. Solving the convex cost integer dual network flow problem. Management Science 49 7 (2003) 950-964
3. Ahuja R., Magnanti T., and Orlin J. Network Flows: Theory, Algorithms and Applications (1993), Prentice Hall
4. Amini A., Weymouth T., and Jain R. Using dynamic programming for solving variational problems in vision. IEEE Transactions on Pattern Analysis and Machine Interaction 12 9 (1990) 855-867
5. Barahona F. Finding ground states in random-field Ising ferromagnets. Journal of Physics A 18 (1985) 673-675
6. Besag J. On the statistical analysis of dirty pictures. Journal of the Royal Statistics Society 48 (1986) 259-302
7. Bioucas-Dias J., and Valado G. Phase unwrapping via graph cuts. IEEE Transactions on Image processing 16 3 (2007) 698-709
8. Blake A., and Zisserman A. Visual Reconstruction (1987), MIT Press
9. Boykov Y., and Funka-Lea G. Graph cuts and efficient n-d image segmentation. International Journal of Computer Vision 70 2 (2006) 109-131
10. Y. Boykov, M.-P. Jolly, Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images, in: Proceedings of the IEEE Tenth International Conference on Computer Vision, ICCV, 2001
11. Boykov Y., and Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Interaction 26 9 (2004) 1124-1137
12. Boykov Y., Veksler O., and Zabih R. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Interaction 23 11 (2001) 1222-1239
13. Carnevali P., Coletti L., and Patarnello S. Image processing by simulated annealing. IBM Journal of Research and Development 29 6 (1985) 569-579
14. Chambolle A. Total variation minimization and a class of binary mrf models. Energy Minimization Methods in Computer Vision and Pattern Recognition. LNCS vol. 3757 (2005), St. Augustine, Florida, USA
15. A. Chambolle, J. Darbon, On total variation minimization and surface evolution using parametric maximum flows, Tech. Rep., UCLA, 2008
16. 1 Function Approximation. SIAM journal of Applied Mathematics 65 5 (2005) 1817-1837
17. T. Chan, S. Esedoglu, M. Nikolova, Algorithms for finding global minimizers of image segmentation and denoising models, Tech. Rep., UCLA, 2004
18. In: Chellappa R., and Jain A. (Eds). Markov Random Fields: Theory and Application (1993), Academic Press
19. Cohen L., and Kimmel R. Global minimum for active contour models: A minimal path approach. International Journal of Computer Vision 24 1 (1997) 57-78
20. Croxton K., Gendron B., and Magnanti T. A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problem. Management Science 49 9 (2003) 1268-1273
21. Dantzig G. Linear Programming and Extensions (1963), Princeton University Press
22. J. Darbon, Composants logiciels et algorithmes de minimisation exacte d'énergies dédiés au traitement des images, Ph.D. thesis, Ecole Nationale Supérieure des Télécommunications, 2005
23. Darbon J. Global optimization for first order Markov Random Fields with submodular priors. In: Brimkov V., Barneva R., and Hauptman H. (Eds). Combinatorial Image Analysis. Lecture Notes in Computer Science Series vol. 4958 (2008), Springer, Berlin
24. Darbon J., and Peyronnet S. A vectorial self-dual morphological filter based on total variation minimization. Proceedings of the International Symposium on Visual Computing. ISVC 2005 (2005), Springer-Verlag
25. Darbon J., and Sigelle M. Image restoration with discrete constrained total variation part II: Levelable functions, convex priors and non-convex cases. Journal of Mathematical Imaging and Vision 26 3 (2006) 277-291
26. Darbon J., and Sigelle M. Image restoration with discrete constrained total variation part I: Fast and exact optimization. Journal of Mathematical Imaging and Vision 26 3 (2006) 261-276
27. L. Denis, F. Tupin, J. Darbon, M. Sigelle, Sar image regularization with fast approximate discrete minimization, Tech. Rep. CAM-07-38, UCLA, 2007
28. Durand S., and Nikolova M. Stability of the minimizers of least squares with a non-convex regularization. Part I: Local behavior. Journal of Applied Mathematics and Optimization 53 2 (2006) 185-208
29. Durand S., and Nikolova M. Stability of the minimizers of least squares with a non-convex regularization. Part II: Global behavior. Journal of Applied Mathematics and Optimization 53 3 (2006) 259-277
30. D. Freedman, P. Drineas, Energy minimization via graph cuts: Settling what is possible, in: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR, vol. 2, 2005
31. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman
32. Geman S., and Geman D. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Interaction 6 6 (1984) 721-741
33. Gimel'farb G.L. Image Textures and Gibbs Random Fields (1999), Kluwer Academic Publishers
34. D. Goldfarb, Y. Yin, Parametric maximum flow algorithms for fast total variation minimization, Tech. Rep., Rice University, 2007
35. Greig D., Porteous B., and Seheult A. Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistics Society 51 2 (1989) 271-279
36. F. Guichard, J.-M. Morel, Image iterative smoothing and PDE s., downloadable manuscript: please write email to fguichard@poseidon-tech.com, 2000
37. Guichard F., and Morel J.-M. Mathematical morphology "almost everywhere". Proceedings of International Symposium on Mathematical Morphology (2002), Csiro Publishing
38. Hartmann A., and Usadel K. Exact determination of all ground states of random field systems in polynomial time. Physica A 214 2 (1995) 141-152
39. Hochbaum D. An efficient algorithm for image segmentation, Markov Random Fields and related problems. Journal of the ACM 48 2 (2001) 686-701
40. Hochbaum D., and Shanthikumar J. Convex separable optimization is not much harder than linear optimization. Journal of the ACM 37 (1990) 843-862
41. Ishikawa H. Exact optimization for Markov random fields with convex priors. IEEE Transactions on Pattern Analysis and Machine Interaction 25 10 (2003) 1333-1336
42. Iwata S., Fleischer L., and Fujishige S. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM 48 4 (2001) 761-777
43. Jungnickel D. Graphs, Networks and Algorithms (2005), Springer-Verlag
44. V. Kolmogorov, Primal-dual algorithm for convex Markov random fields, Tech. Rep., Microsoft Research, 2005
45. V.N. Kolmogorov, M.J. Wainwright, On optimality of tree-reweighted max-product message-passing, in: Proceedings of the 21st conference on Uncertainty in Artificial Intelligence, Edinburgh, Scotland, 2005
46. Kolmogorov V., and Zabih R. What energy can be minimized via graph cuts?. IEEE Transactions on Pattern Analysis and Machine Interaction 26 2 (2004) 147-159
47. A.B.V. Lempitsky, C. Rother, Logcut - efficient graph cut optimization for Markov random fields, in: The Proceedings of the IEEE International Conference on Computer Vision, ICCV, 2007
48. Li S.Z. Markov Random Field Modeling in Image Analysis. 2nd (2001), Springer-Verlag
49. X. Liu, O. Veksler, J. Samarabandu, Graph cut with ordering constraints on labels and its applications, in: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR, 2007
50. Lovász L. Mathematical programming - the state of the art, chap. Submodular functions and convexity (1983), Springer-Verlag 235-257
51. Maragos P., and Ziff R. Threshold superposition in morphological image analysis systems. IEEE Transactions on Pattern Analysis and Machine Intelligence 12 5 (1990) 498-504
52. Murota K. Discrete Convex Analyis (2003), SIAM Society for Industrial and Applied Mathematics
53. Nikolova M. Analysis of the recovery of edges in images and signals by minimizing nonconvex regularized least-squares. SIAM Journal on Multiscale Modeling and Simulation 4 3 (2005) 960-991
54. Nikolova M. Model distortions in Bayesian MAP reconstruction. AIMS Journal on Inverse Problems and Imaging 1 2 (2007) 399-422
55. Ogielski A. Integer optimization and zero-fixed point in Ising random-field systems. Physical Review Letters 57 10 (1986) 1251-1254
56. Picard J., and Ratliff H. Minimum cuts and related problem. Networks 5 (1975) 357-370
57. Rudin L., Osher S., and Fatemi E. Nonlinear total variation based noise removal algorithms. Physica D 60 (1992) 259-268
58. D. Schlesinger, B. Flach, Transforming an arbitrary minsum problem into a binary one, Tech. Rep., Dresden University of Technology, 2008
59. Schrijver L. Combinatorial optimization - polyhedra and efficiency (2003), Springer-Verlag
60. Schrijver A. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory Series B 80 2 (2000) 346-355
61. O. Veksler, Graph cut based optimization for mrfs with truncated convex priors, in: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR, 2007
62. Wainwright M.J., Jaakkola T.S., and Willsky A.S. MAP estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches. IEEE Transactions on Information Theory 51 11 (2005) 3697-3717
63. Winkler G. Image Analysis, Random Fields and Dynamic Monte Carlo Methods. A Mathematical Introduction. Applications of Mathematics. 3rd ed. (2006), Springer-Verlag
64. B. Zalesky, Efficient determination of Gibbs estimator with submodular energy functions, Tech. Rep., United Institution of Information Problem, 2005
65. Zalesky B. Network flow optimization for restoration of images. Journal of Applied Mathematics 2 4 (2002) 199-218