Alphabet SOUP: A framework for approximate energy minimization

2009 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009

Volumn , Issue , 2009, Pages 903-910

  Gould, Stephen ^a   Amat, Fernando ^a   Koller, Daphne ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; GRAPHIC METHODS; ITERATIVE METHODS; MARKOV PROCESSES; MESSAGE PASSING;

APPROXIMATE SOLUTION; ENERGY MINIMIZATION; MARKOV RANDOM FIELDS; MAXIMUM A POSTERIORI; MESSAGE PASSING ALGORITHM; SEQUENTIAL OPTIMIZATION; THEORETICAL GUARANTEES; VARIABLE ASSIGNMENT;

COMPUTER VISION;

EID: 70450169692     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPRW.2009.5206650     Document Type: Conference Paper

References (30)

1. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. In ICCV, 1999.
2. R. G. Cowell, A. P. Dawid, S. L. Lauritzen, and D. J. Spiegelhalter. Probabilistic Networks and Expert Systems. Springer- Verlag, 1999.
3. A. Criminisi, P. Perez, and K. Toyama. Object removal by exemplar-based inpainting. In CVPR, 2003.
4. D. Freedman and P. Drineas. Energy minimization via graph cuts: Settling what is possible. In CVPR, 2005.
5. A. Globerson and T. Jaakkola. Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations. In NIPS, 2007.
6. D. M. Greig, B. T. Porteous, and A. H. Seheult. Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society, 1989.
7. G. Heitz, G. Elidan, B. Packer, and D. Koller. Shape-based object localization for descriptive classification. In NIPS, 2008.
8. D. Hoiem, A. Stein, A. Efros, and M. Hebert. Recovering occlusion boundaries from a single image. In ICCV, 2007.
9. P. Kohli, L. Ladicky, and P. Torr. Robust higher order potentials for enforcing label consistency. In CVPR, 2008.
10. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. IEEE PAMI, 2006.
11. V. Kolmogorov and C. Rother. Minimizing nonsubmodular functions with graph cuts - A review. IEEE PAMI, 2007.
12. V. Kolmogorov and R. Zabin. What energy functions can be minimized via graph cuts? IEEE PAMI, 2004.
13. N. Komodakis, N. Paragios, and G. Tziritas. MRF optimization via dual decomposition: Message-passing revisited. In ICCV, 2007.
14. N. Komodakis and G. Tziritas. Image completion using efficient belief propagation via priority scheduling and dynamic pruning. In CVPR, 2006.
15. S. Kumar and M. Hebert. A hierarchical field framework for unified context-based classification. In ICCV, 2005.
16. J. D. Lafferty, A. McCallum, and F. C. N. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML, 2001.
17. X. Lan, S. Roth, D. Huttenlocher, and M. Black. Efficient belief propagation with learned higher-order markov random fields. In ECCV, 2006.
18. V. Lempitsky, S. Roth, and C. Rother. FusionFlow: Discretecontinuous optimization for optical flow estimation. In CVPR, 2008.
19. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
20. S. Ramalingam, P. Kohli, K. Alahari, and P. Torr. Exact inference in multi-label CRFs with higher order cliques. In CVPR, 2008.
21. C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer. Optimizing binary MRFs via extended roof duality. In CVPR, 2007.
22. M. Sara and U. Sleytr. S-layer proteins. Journal of Bacteriology, 2000.
23. J. Smit, H. Engelhardt, S. Volker, S. Smith, and W. Baumeister. The S-layer of caulobacter crescentus: 3d image reconstruction and structure analysisby electron microscopy. Journal of Bacteriology, 1992.
24. D. Sontag, T. Meltzer, A. Globerson, T. Jaakkola, and Y. Weiss. Tightening LP relaxations for map using message passing. In UAI, 2008.
25. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. A comparative study of energy minimization methods for MRFs with smoothness-based priors. IEEE PAMI, 2008.
26. O. Veksler. Efficient graph-based energy minimization methods in computer vision, 1999.
27. O. Veksler. Graph cut based optimization for MRFs with truncated convex priors. In CVPR, 2007.
28. M. Wainwright, T. Jaakkola, and A. Willsky. MAP estimation via agreement on trees: message-passing and linear programming. IEEE Trans. on Info. Theory, 2005.
29. C. Yanover, T. Meltzer, and Y. Weiss. Linear programming relaxations and belief propagation-an empirical study. JMLR, 2006.
30. C. Yanover, O. Schueler-Furman, and Y. Weiss. Minimizing and learning energy functions for side-chain prediction. In RECOMB, 2007.