Min norm point algorithm for higher order MRF-MAP inference

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

Volumn 2016-December, Issue , 2016, Pages 5365-5374

  Shanu, Ishant ^a   Arora, Chetan ^a   Singla, Parag ^b  

^a INDRAPRASTHA INSTITUTE OF INFORMATION TECHNOLOGY   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; LEARNING SYSTEMS; OPTIMIZATION; PATTERN RECOGNITION;

CLIQUE POTENTIAL; HIGHER ORDER MRF MAPS; INFERENCE ALGORITHM; INFERENCE PROBLEM; MATHEMATICAL OPTIMIZATIONS; POINT ALGORITHMS; STATE OF THE ART; SUBMODULAR FUNCTIONS;

INFERENCE ENGINES;

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

References (47)

1. C. Arora, S. Banerjee, P. Kalra, and S. Maheshwari. Generalized flows for optimal inference in higher order MRF-MAP. IEEE TPAMI, 37 (7): 1323-1335, 2015.
2. A. Beck and L. Tetruashvili. On the convergence of block coordinate descent type methods. SIAM journal on Optimization, 23 (4): 2037-2060, 2013.
3. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE TPAMI, 23 (11): 1222-1239, 2001.
4. D. Chakrabarty, P. Jain, and P. Kothari. Provable submodular minimization using wolfe's algorithm. In Proc. of NIPS, pages 802-809, 2014.
5. A. Criminisi, G. Cross, A. Blake, and V. Kolmogorov. Bilayer segmentation of live video. In Proc. of CVPR, pages 53-60, 2006.
6. J. Dahl and L. Vandenberghe. Cvxopt, 2007. http://mloss. org/software/view/34/.
7. A. Ene and H. L. Nguyen. Random coordinate descent methods for minimizing decomposable submodular functions. ArXiv preprint arXiv: 1502. 02643, 2015.
8. A. Fix, A. Gruber, E. Boros, and R. Zabih. A graph cut algorithm for higher-order markov random fields. In Proc. of ICCV, pages 1020-1027, 2011.
9. A. Fix, T. Joachims, S. M. Park, and R. Zabih. Structured learning of sum-of-submodular higher order energy functions. In Proc. of ICCV, pages 3104-3111, 2013.
10. A. Fix, C. Wang, and R. Zabih. A primal-dual algorithm for higher-order multilabel markov random fields. In Proc. of CVPR, pages 1138-1145, 2014.
11. D. Freedman and P. Drineas. Energy minimization via graph cuts: Settling what is possible. In Proc. of CVPR, pages 939-946, 2005.
12. S. Fujishige and S. Isotani. A submodular function minimization algorithm based on the minimum-norm base. Pacific Journal of Optimization, 7: 3-17, 2011.
13. A. C. Gallagher, D. Batra, and D. Parikh. Inference for order reduction in markov random fields. In Proc. of CVPR, pages 1857-1864, 2011.
14. S. Geman and D. Geman. Stochastic relaxation, gibbs distributions, and the Bayesian restoration of images. IEEE TPAMI, 6 (6): 721-741, 1984.
15. T. Hazan and A. Shashua. Norm-product belief propagation: Primal-dual message-passing for approximate inference. Information Theory, 56 (12): 6294-6316, 2010.
16. R. J. ian and T. S. Huang. Object detection using hierarchical MRF and MAP estimation. In Proc. of CVPR, pages 186-192, 1997.
17. H. Ishikawa. Transformation of general binary MRF minimization to the first-order case. IEEE TPAMI, 33 (6): 1234-1249, 2011.
18. H. Ishikawa. Higher-order clique reduction without auxiliary variables. In Proc. of CVPR, pages 1362-1369, 2014.
19. S. Iwata, L. Fleischer, and S. Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM (JACM), 48 (4): 761-777, 2001.
20. S. Jegelka, F. Bach, and S. Sra. Reflection methods for userfriendly submodular optimization. In Proc. of NIPS, pages 1313-1321, 2013.
21. F. Kahl and P. Strandmark. Generalized roof duality for pseudo-boolean optimization. In Proc. of ICCV, pages 255-262, 2011. 1
22. P. Kohli, P. H. Torr, et al. Robust higher order potentials for enforcing label consistency. IJCV, 82 (3): 302-324, 2009.
23. V. Kolmogorov. Minimizing a sum of submodular functions. Discrete Applied Mathematics, 160 (15): 2246-2258, 2012.
24. V. Kolmogorov. A new look at reweighted message passing. IEEE TPAMI, 37 (5): 919-930, 2015.
25. V. Kolmogorov and C. Rother. Minimizing nonsubmodular functions with graph cuts - A review. IEEE TPAMI, 29 (7): 1274-1279, 2007.
26. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts IEEE TPAMI, 26 (2): 147-159, 2004. 1
27. N. Komodakis and N. Paragios. Beyond pairwise energies: Efficient optimization for higher-order MRFs. In Proc. of CVPR, pages 2985-2992, 2009.
28. V. Kwatra, A. Schödl, I. Essa, G. Turk, and A. Bobick. Graphcut textures: Image and video synthesis using graph cuts. In Proc. of SIGGRAPH, pages 277-286, 2003.
29. Y. T. Lee, A. Sidford, and S. C.-w. Wong. A faster cutting plane method and its implications for combinatorial and convex optimization. ArXiv preprint arXiv: 1508. 04874, 2015.
30. U. Mudenagudi, S. Banerjee, and P. K. Kalra. Space-time super-resolution using graph-cut optimization. IEEE TPAMI, 33 (5): 995-1008, 2011.
31. A. C. Müller and S. Behnke. pystruct-learning structured prediction in python. Journal of Machine Learning Research, 15: 2055-2060, 2014.
32. A. Opelt, A. Pinz, M. Fussenegger, and P. Auer. Generic object recognition with boosting. IEEE TPAMI, 28 (3): 416-431, 2006.
33. J. B. Orlin. A faster strongly polynomial time algorithm for submodular function minimization. Mathematical Programming, 118 (2): 237-251, 2009.
34. J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, 2014.
35. W. Pieczynski and A.-N. Tebbache. Pairwise markov random fields and segmentation of textured images. Machine Graphics and Vision, 9 (3): 705-718, 2000.
36. B. Potetz and T. S. Lee. Efficient belief propagation for higher-order cliques using linear constraint nodes. CVIU, 112 (1): 39-54, Oct. 2008.
37. S. Ramalingam, C. Russell, L. Ladicky, and P. H. Torr. Efficient minimization of higher order submodular functions using monotonic boolean functions. ArXiv preprint arXiv: 1109. 2304, 2011.
38. S. Roth and M. J. Black. Fields of experts. IJCV, 82 (2): 205-229, 2009.
39. C. Rother, P. Kohli, W. Feng, and J. Jia. Minimizing sparse higher order energy functions of discrete variables. In Proc. of CVPR, pages 1382-1389, 2009.
40. C. Rother, V. Kolmogorov, and A. Blake. Grabcut: Interactive foreground extraction using iterated graph cuts. ACM Transactions on Graphics (TOG), 23 (3): 309-314, 2004.
41. A. Schrijver. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B, 80 (2): 346-355, 2000.
42. J. Shotton, J. Winn, C. Rother, and A. Criminisi. Textonboost: Joint appearance, shape and context modeling for multi-class object recognition and segmentation. In Proc. of ECCV, pages 1-15, 2006.
43. D. Sontag, A. Globerson, and T. Jaakkola. Introduction to dual decomposition for inference. Optimization for Machine Learning, 1: 219-254, 2011.
44. P. Stobbe and A. Krause. Efficient minimization of decomposable submodular functions. In Proc. of NIPS, pages 2208-2216, 2010.
45. D. Tarlow, I. E. Givoni, and R. S. Zemel. Hop-map: Efficient message passing with high order potentials. In Proc. of AISTATS, 2010.
46. P. Wolfe. Finding the nearest point in a polytope. Mathematical Programming, 11, 1976.
47. O. Woodford, P. Torr, I. Reid, and A. Fitzgibbon. Global stereo reconstruction under second order smoothness priors. In Proc. of CVPR, pages 1-8, 2008.