A primal-dual algorithm for higher-order multilabel markov random fields

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2014, Pages 1138-1145

  Fix, Alexander ^a   Wang, Chen ^a   Zabih, Ramin ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

Markov Random Fields; Optimization; primal dual algorithms

Indexed keywords

COMPUTER VISION; GRAPHIC METHODS; IMAGE SEGMENTATION; MAGNETORHEOLOGICAL FLUIDS; OPTIMIZATION; STEREO IMAGE PROCESSING;

APPROXIMATION BOUNDS; ENERGY FUNCTIONS; LOWER ENERGIES; MARKOV RANDOM FIELDS; OPTIMIZATION PROBLEMS; PRIMAL DUAL ALGORITHMS; PRIMAL-DUAL METHODS; PROBLEM-SPECIFIC KNOWLEDGE;

MARKOV PROCESSES;

EID: 84911448421     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2014.149     Document Type: Conference Paper

References (30)

1. C. Arora, S. Banerjee, P. Kalra, and S. N. Maheshwari. Generic cuts: an efficient algorithm for optimal inference in higher order MRF-MAP. In ECCV, 2012.
2. D. Batra and P. Kohli. Making the right moves: Guiding alpha-expansion using local primal-dual gaps. In CVPR, pages 1865-1872, 2011.
3. E. Boros and P. L. Hammer. Pseudo-boolean optimization. Discrete Applied Mathematics, 123(1-3), 2002.
4. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. TPAMI, 23(11):1222-1239, 2001.
5. J. Edmonds. Submodular functions, matroids, and certain polyhedra. In M. Jnger, G. Reinelt, and G. Rinaldi, editors, Combinatorial Optimization Eureka, You Shrink!, volume 2570 of Lecture Notes in Computer Science, pages 11-26. Springer Berlin Heidelberg, 2003.
6. A. Fix, A. Gruber, E. Boros, and R. Zabih. A graph cut algorithm for higher-order Markov Random Fields. In ICCV, 2011.
7. A. Fix, T. Joachims, S. Park, and R. Zabih. Structured learning of sum-of-submodular higher order energy functions. arXiv, 1309.7512, Sept. 2013.
8. A. C. Gallagher, D. Batra, and D. Parikh. Inference for order reduction in Markov Random Fields. In CVPR, pages 1857-1864, 2011.
9. H. Ishikawa. Higher-order gradient descent by fusion move graph cut. In ICCV, pages 568-574, 2009.
10. H. Ishikawa. Transformation of general binary MRF minimization to the first order case. TPAMI, 33(6), 2010.
11. F. Kahl and P. Strandmark. Generalized roof duality for pseudo-boolean optimization. In ICCV, pages 255-262, 2011.
12. J. Kleinberg and E. Tardos. Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov Random Fields. J. ACM, 49(5):616-639, 2002.
13. P. Kohli, M. P. Kumar, and P. H. Torr. P3 and beyond: Move making algorithms for solving higher order functions. TPAMI, 31(9):1645-1656, 2008.
14. V. Kolmogorov. Minimizing a sum of submodular functions. Discrete Appl. Math., 160(15):2246-2258, Oct. 2012.
15. V. Kolmogorov and T. Schoenemann. Generalized sequential tree-reweighted message passing. arXiv, 1205.6352, Dec. 2012.
16. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? TPAMI, 26(2):147-59, 2004.
17. N. Komodakis and N. Paragios. Beyond pairwise energies: Efficient optimization for higher-order MRFs. In CVPR, pages 2985-2992, 2009.
18. N. Komodakis, N. Paragios, and G. Tziritas. MRF energy minimization and beyond via dual decomposition. TPAMI, 33(3):531-552, 2011.
19. N. Komodakis and G. Tziritas. A new framework for approximate labeling via graph cuts. In ICCV, 2005.
20. N. Komodakis and G. Tziritas. Approximate labeling via graph cuts based on linear programming. TPAMI, 29(8):1436-1453, 2007.
21. N. Komodakis, G. Tziritas, and N. Paragios. Fast primal-dual strategies for MRF optimization. Technical Report 0605, Ecole Centrale de Paris, 2006.
22. V. Lempitsky, C. Rother, S. Roth, and A. Blake. Fusion moves for Markov Random Field optimization. TPAMI, 32(8):1392-1405, Aug 2010.
23. S. Roth and M. Black. Fields of experts. IJCV, 82:205-229, 2009.
24. C. Rother, P. Kohli, W. Feng, and J. Jia. Minimizing sparse higher order energy functions of discrete variables. In CVPR, pages 1382-1389, 2009.
25. M. Shlezinger. Syntactic analysis of two-dimensional visual signals in the presence of noise. Cybernetics, 12(4):612-628, 1976.
26. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kol-mogorov, A. Agarwala, M. Tappen, and C. Rother. A comparative study of energy minimization methods for Markov Random Fields. TPAMI, 30(6):1068-1080, 2008.
27. D. Tarlow, I. E. Givoni, and R. S. Zemel. HOP-MAP: Efficient message passing with high order potentials. In AIS-TATS, pages 812-819, 2010.
28. Y. Weiss, C. Yanover, and T. Meltzer. Map estimation, linear programming and belief propagation with convex free energies. In UAI, 2007.
29. T. Werner. High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (map-mrf). In CVPR, 2008.
30. O. Woodford, P. Torr, I. Reid, and A. Fitzgibbon. Global stereo reconstruction under second-order smoothness priors. TPAMI, 31:2115-2128, 2009.