Higher-order models in computer vision

Image Processing and Analysis with Graphs: Theory and Practice

Volumn , Issue , 2012, Pages 65-92

  Kohli, Pushmeet ^a   Rother, Carsten ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85055818260     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/b12281     Document Type: Chapter

References (58)

1. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and
2. C. Rother, “A comparative study of energy minimization methods for Markov random fields.” in ECCV, 2006, pp. 16-29.
3. Y. Boykov, O. Veksler, and R. Zabih, “Fast approximate energy minimization via graph cuts.” PAMI, vol. 23, no. 11, pp. 1222-1239, 2001.
4. V. Kolmogorov and R. Zabih, “What energy functions can be minimized via graph cuts?.” PAMI, vol. 26, no. 2, pp. 147-159, 2004.
5. N. Komodakis, G. Tziritas, and N. Paragios, “Fast, approximately optimal solutions for single and dynamic MRFs,” in CVPR, 2007, pp. 1-8.
6. E. Boros and P. Hammer, “Pseudo-boolean optimization.” Discrete Appl. Math., vol. 123, no. 1-3, pp. 155-225, 2002.
7. E. Boros, P. Hammer, and G. Tavares, “Local search heuristics for quadratic unconstrained binary optimization (QUBO),” J. Heuristics, vol. 13, no. 2, pp. 99-132, 2007.
8. P. Felzenszwalb and D. Huttenlocher, “Efficient Belief Propagation for Early Vision,” in Proc. CVPR, vol. 1, 2004, pp. 261-268.
9. J. Pearl, “Fusion, propagation, and structuring in belief networks,” Artif. Intell., vol. 29, no. 3, pp. 241-288, 1986.
10. Y. Weiss and W. Freeman, “On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs.” Trans. Inf. Theory, 2001.
11. V. Kolmogorov, “Convergent tree-reweighted message passing for energy minimization.” IEEE Trans. Pattern Anal. Mach. Intell., vol. 28, no. 10, pp. 1568-1583, 2006.
12. M. Wainwright, T. Jaakkola, and A. Willsky, “Map estimation via agreement on trees: message- passing and linear programming.” IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3697-3717, 2005.
13. N. Y. El-Zehiry and L. Grady, “Fast global optimization of curvature,” in CVPR, 2010, pp. 3257-3264.
14. C. Fitzgibbon, Y. Wexler, and A. Zisserman, “Image-based rendering using image-based priors.” in ICCV, 2003, pp. 1176-1183.
15. L. Ladicky, C. Russell, P. Kohli, and P. H. S. Torr, “Graph cut based inference with co-occurrence statistics,” in ECCV, 2010, pp. 239-253.
16. P. Kohli, M. Kumar, and P. Torr, “P3 and beyond: Solving energies with higher order cliques,” in CVPR, 2007.
17. X. Lan, S. Roth, D. Huttenlocher, and M. Black, “Efficient belief propagation with learned higher- order markov random fields.” in ECCV, 2006, pp. 269-282.
18. S. Roth and M. Black, “Fields of experts: A framework for learning image priors.” in CVPR, 2005, pp. 860-867.
19. C. Potetz, “Efficient belief propagation for vision using linear constraint nodes,” in CVPR, 2007.
20. S. Vicente, V. Kolmogorov, and C. Rother, “Joint optimization of segmentation and appearance models,” in ICCV, 2009, pp. 755-762.
21. S. Vicente, V. Kolmogorov, and C. Rother, “Graph cut based image segmentation with connectivity priors,” in CVPR, 2008.
22. C. Tarlow, I. E. Givoni, and R. S. Zemel, “Hop-map: Efficient message passing with high order potentials,” JMLR - Proceedings Track, vol. 9, pp. 812-819, 2010.
23. T. Werner, “High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF),” in CVPR, 2009.
24. O. Woodford, P. Torr, I. Reid, and A. Fitzgibbon, “Global stereo reconstruction under second order smoothness priors,” in CVPR, 2008.
25. P. Kohli and M. P. Kumar, “Energy minimization for linear envelope MRFs,” in CVPR, 2010, pp. 1863-1870.
26. P. Kohli, L. Ladicky, and P. Torr, “Robust higher order potentials for enforcing label consistency,” in CVPR, 2008.
27. C. Rother, P. Kohli, W. Feng, and J. Jia, “Minimizing sparse higher order energy functions of discrete variables,” in CVPR, 2009, pp. 1382-1389.
28. C. Russell, L. Ladicky, P. Kohli, and P. H. S. Torr, “Exact and approximate inference in associative hierarchical random fields using graph-cuts,” in UAI, 2010.
29. A. Blake, C. Rother, M. Brown, P. Perez, and P. Torr, “Interactive image segmentation using an adaptive GMMRF model,” in ECCV, 2004, pp. I: 428-441.
30. C. Rother, V. Kolmogorov, and A. Blake, “Grabcut: interactive foreground extraction using iterated graph cuts,” in SIGGRAPH, 2004, pp. 309-314.
31. A. Blake, P. Kohli, and C. Rother, Advances in Markov Random Fields. MIT Press, 2011.
32. S. Nowozin and C. Lampert, Structured Learning and Prediction in Computer Vision. NOW Publishers, 2011.
33. A. Shekhovtsov, P. Kohli, and C. Rother, “Curvature prior for MRF-based segmentation and shape inpainting,” Center for Machine Perception, K13133 FEE Czech Technical University, Prague, Czech Republic, Research Report CTU-CMP-2011-11, September 2011.
34. X. Ren and J. Malik, “Learning a classification model for segmentation.” in ICCV, 2003, pp. 10-17.
35. J. Shotton, J. Winn, C. Rother, and A. Criminisi, “TextonBoost: Joint appearance, shape and context modeling for multi-class object recognition and segmentation.” in ECCV (1), 2006, pp. 1-15.
36. C. Comaniciu and P. Meer, “Mean shift: A robust approach toward feature space analysis.” IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 5, pp. 603-619, 2002.
37. Y. Boykov and M. Jolly, “Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images,” in ICCV, 2001, pp. I: 105-112.
38. N. Komodakis and N. Paragios, “Beyond pairwise energies: Efficient optimization for higher-order MRFs,” in CVPR, 2009, pp. 2985-2992.
39. H. Ishikawa, “Higher-order clique reduction in binary graph cut,” in CVPR, 2009, pp. 2993-3000.
40. W. T. Freeman, E. C. Pasztor, and O. T. Carmichael, “Learning low-level vision,” IJCV, vol. 40, no. 1, pp. 25-47, 2000.
41. D. Cremers and L. Grady, “Statistical priors for efficient combinatorial optimization via graph cuts,” in ECCV, 2006, pp. 263-274.
42. M. Bleyer, C. Rother, P. Kohli, D. Scharstein, and S. Sinha, “Object stereo: Joint stereo matching and object segmentation,” in CVPR, 2011, pp. 3081-3088.
43. S. Nowozin and C. H. Lampert, “Global connectivity potentials for random field models,” in CVPR, 2009, pp. 818-825.
44. V. S. Lempitsky, P. Kohli, C. Rother, and T. Sharp, “Image segmentation with a bounding box prior,” in ICCV, 2009, pp. 277-284.
45. M. Bleyer, C. Rother, and P. Kohli, “Surface stereo with soft segmentation,” in CVPR, 2010, pp. 1570-1577.
46. A. Delong, A. Osokin, H. N. Isack, and Y. Boykov, “Fast approximate energy minimization with label costs,” in CVPR, 2010, pp. 2173-2180.
47. C. Hoiem, C. Rother, and J. M. Winn, “3D layoutcrf for multi-view object class recognition and segmentation,” in CVPR, 2007.
48. V. Kolmogorov, Y. Boykov, and C. Rother, “Applications of parametric maxflow in computer vision,” in ICCV, 2007, pp. 1-8.
49. G. Gallo, M. Grigoriadis, and R. Tarjan, “A fast parametric maximum flow algorithm and applications,” SIAM J. on Comput., vol. 18, pp. 30-55, 1989.
50. Y. Lim, K. Jung, and P. Kohli, “Energy minimization under constraints on label counts,” in ECCV, 2010, pp. 535-551.
51. O. Woodford, C. Rother, and V. Kolmogorov, “A global perspective on map inference for low-level vision,” in ICCV, 2009, pp. 2319-2326.
52. C. Sontag, T. Meltzer, A. Globerson, T. Jaakkola, and Y. Weiss, “Tightening lp relaxations for map using message passing,” in UAI, 2008.
53. J. Yedidia, W. Freeman, and Y. Weiss, “Generalized belief propagation.” in NIPS, 2000, pp. 689-695.
54. C. Chekuri, S. Khanna, J. Naor, and L. Zosin, “A linear programming formulation and approximation algorithms for the metric labeling problem,” SIAM J. Discrete Math., vol. 18, no. 3, pp. 608-625, 2005.
55. C. Freedman and P. Drineas, “Energy minimization via graph cuts: Settling what is possible.” in CVPR, 2005, pp. 939-946.
56. P. Kohli, L. Ladicky, and P. H. S. Torr, “Robust higher order potentials for enforcing label consistency,” IJCV, vol. 82, no. 3, pp. 302-324, 2009.
57. L. Torresani, V. Kolmogorov, and C. Rother, “Feature correspondence via graph matching: Models and global optimization,” in ECCV, 2008, pp. 596-609.
58. G. E. Hinton, “Training products of experts by minimizing contrastive divergence,” Neural Comput., vol. 14, no. 8, pp. 1771-1800, 2002.