Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual strategies

Computer Vision and Image Understanding

Volumn 112, Issue 1, 2008, Pages 14-29

  Komodakis, Nikos ^a   Tziritas, Georgios ^a   Paragios, Nikos ^b,c  

^a UNIVERSITY OF CRETE   (Greece)

^b ECOLE CENTRALE PARIS   (France)

^c INRIA SACLAY   (France)

Author keywords

Discrete optimization; Graph cuts; Linear programming; Markov random fields; Primal dual schema

Indexed keywords

CHLORINE COMPOUNDS; HIDDEN MARKOV MODELS; LINEAR PROGRAMMING; LINEARIZATION; NUCLEAR PROPULSION; OPTIMIZATION; STRUCTURAL FRAMES;

DISCRETE OPTIMIZATION; GRAPH CUTS; MARKOV RANDOM FIELDS; NOVEL METHODS; NP-HARD PROBLEMS; OPTIMIZATION CODES; POTENTIAL FUNCTIONS; PRIMAL-DUAL; PRIMAL-DUAL SCHEMA; STATE OF THE ARTS; STATE-OF-THE-ART METHODS; STATIC AND DYNAMIC;

FACILITIES;

EID: 52949110978     PISSN: 10773142     EISSN: 1090235X     Source Type: Journal    
DOI: 10.1016/j.cviu.2008.06.007     Document Type: Article

References (44)

1. Y. Boykov, V. Kolmogorov, An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision, in: IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 26, no. 9, 2004.
2. Y. Boykov, O. Veksler, R. Zabih, Fast approximate energy minimization via graph cuts, in: IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 23, no. 11, 2001.
3. O. Juan, Y. Boykov, Active graph cuts, in: Proceedings of the Computer Vision and Pattern Recognition (CVPR), 2006.
4. P. Kohli, P.H. Torr, Efficiently solving dynamic Markov random fields using graph cuts, in: Proceedings of the International Conference on Computer Vision (ICCV), 2005.
5. N. Komodakis, G. Tziritas, A new framework for approximate labeling via graph-cuts, in: Proceedings of the International Conference on Computer Vision (ICCV), 2005.
6. C. Rother, S. Kumar, V. Kolmogorov, A. Blake, Digital tapestry, in: Proceedings of the Computer Vision and Pattern Recognition (CVPR), 2005.
7. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, C. Rother, A comparative study of energy minimization methods for Markov random fields, in: Proceedings of the European Conference on Computer Vision (ECCV), 2006.
8. V. Kolmogorov, R. Zabih, What Energy Functions can be Minimized via Graph Cuts?, in: IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 26, no. 2, 2004.
9. N. Komodakis, G. Tziritas, N. Paragios, Fast, approximately optimal solutions to single and dynamic MRFs, in: CVPR, 2007.
10. N. Komodakis, G. Tziritas, Approximate labeling via graph cuts based on linear programming, in: IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 29, no. 8, 2007.
11. C. Chekuri, S. Khanna, J. Naor, L. Zosin, Approximation algorithms for the metric labeling problem via a new linear programming formulation, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 109-118.
12. Vazirani V. Approximation Algorithms (2001), Springer
13. Hochbaum D.S. Approximation Algorithms for NP-Hard Problems (1997), PWS Publishing Company, Boston, MA
14. Papadimitriou C.H., and Steiglitz K. Combinatorial Optimization: Algorithms and Complexity (1982), Prentice-Hall
15. M.F. Tappen, W.T. Freeman, Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters, in: ICCV, 2003, pp. 900-907.
16. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (1988), Morgan Kaufmann Publishers Inc., San Francisco, CA, USA
17. M. Wainwright, T. Jaakkola, A. Willsky, Map estimation via agreement on (hyper)trees: message-passing and linear programming, IEEE Transactions on Information Theory, 2005.
18. N. Komodakis, N. Paragios, G. Tziritas, MRF optimization via dual decomposition: message-passing revisited, in: ICCV, 2007.
19. J. Yedidia, W. Freeman, Y. Weiss, Constructing free energy approximations and generalized belief propagation algorithms, in: IEEE Transactions on Information Theory, 2005.
20. T. Meltzer, C. Yanover, Y. Weiss, Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation, in: ICCV, 2005.
21. V. Kolmogorov, Convergent tree-reweighted message passing for energy minimization, in: IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 2006.
22. H. Ishikawa, exact optimization for Markov random fields with convex priors, in: IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), vol. 25, no. 10, 2003.
23. O. Veksler, Efficient graph-based energy minimization methods in computer vision, Ph.D. dissertation, Cornell, 1999.
24. S. Roy, I. Cox, A maximum-flow formulation of the n-camera stereo correspondence problem, in: ICCV, 1998.
25. B. Glocker, N. Komodakis, N. Paragios, G. Tziritas, N. Navab, Inter and intra-modal deformable registration: continuous deformations meet efficient optimal linear programming, in: IPMI, 2007.
26. A. Raj, G. Singha, R. Zabih, MRF's forMRI's: Bayesian reconstruction of MR images via graph cuts, in: CVPR, 2006.
27. V. Kolmogorov, R. Zabih, Multi-camera scene reconstruction via graph cuts, in: ECCV, 2002, pp. 82-96.
28. R. Zabih, V. Kolmogorov, Spatially coherent clustering using graph cuts, in: CVPR, 2004, pp. 437-444.
29. J. Kim, V. Kolmogorov, R. Zabih, Visual correspondence using energy minimization and mutual information, in: ICCV, 2003.
30. Scharstein D., and Szeliski R. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision 47 1-3 (2002) 7-42
31. M. Kumar, P. Torr, A. Zisserman, OBJ CUT, in: CVPR, 2005.
32. V. Kwatra, A. Schodl, I. Essa, G. Turk, A. Bobick, Graphcut textures: image and video synthesis using graph cuts, in: SIGGRAPH, 2003.
33. N. Komodakis, G. Tziritas, Image Completion Using Global Optimization, in: CVPR, 2006.
34. S. Roth, M. Black, Fields of experts: a framework for learning image priors, in: CVPR, 2005.
35. P. Felzenszwalb, D. Huttenlocher, Pictorial structures for object recognition, in: IJCV, vol. 61, no. 1, 2005.
36. Frey B. Graphical Models for Machine Learning and Digital Communication (1998), MIT Press
37. Jordan M. Learning in Graphical Models (1999), MIT Press
38. J. Schnabel, D. Rueckert, M. Quist, J. Blackall, A. Castellano-Smith, T. Hartkens, G. Penney, W. Hall, H. Liu, C. Truwit, F. Gerritsen, D. Hill, D. Hawkes, A generic framework for non-rigid registration based on non-uniform multi-level free-form deformations, in: MICCAI, 2001.
39. T. Werner, A linear programming approach to max-sum problem: a review, in: IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 2007.
40. M.I. Schlesinger, Syntactic analysis of two-dimensional visual signals in noisy conditions, in: Kybernetica, 1976.
41. V. Kolmogorov, A note on the primal-dual method for the semi-metric labeling problem, Technical Report, 2007.
42. B. Glocker, N. Komodakis, N. Paragios, G. Tziritas, N. Navab, Dense image registration through MRFs and efficient linear programming, Medical Image Analysis, 2008.
43. B. Glocker, N. Paragios, N. Komodakis, G. Tziritas, N. Navab, Optical flow estimation with uncertainties through dynamic MRFs, in: CVPR, 2008.
44. N. Komodakis, N. Paragios, Beyond loose LP-relaxations: optimizing MRFs by repairing cycles, in: ECCV, 2008.