Variable grouping for energy minimization

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

Volumn , Issue , 2011, Pages 1913-1920

  Kim, Taesup ^a   Nowozin, Sebastian ^b   Kohli, Pushmeet ^b   Yoo, Chang D ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

POWER MANAGEMENT; RANDOM VARIABLES;

COMPARATIVE EVALUATIONS; COMPUTATIONAL COSTS; ENERGY FUNCTIONS; ENERGY MINIMIZATION; ENERGY MINIMIZATION PROBLEM; GENERATION METHOD; GROUPING STRATEGIES; MEMORY REQUIREMENTS;

COMPUTER VISION;

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

References (27)

1. K. Alahari, P. Kohli, and P. H. S. Torr. Dynamic hybrid algorithms for MAP inference in discrete MRFs. PAMI, 2010. 1913, 1917
2. E. Boros and P. Hammer. Pseudo-boolean optimization. Discrete Applied Mathematics, 2002. 1913, 1915
3. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. PAMI, 2001. 1913, 1915
4. D. Comaniciu and P. Meer. Mean shift: A robust approach toward feature space analysis. PAMI, 24(5):603-619, 2002. 1914
5. P. Felzenszwalb and D. Huttenlocher. Efficient graph-based image segmentation. IJCV, 59(2):167-181, 2004. 1914, 1915, 1916
6. X. He, R. Zemel, and D. Ray. Learning and incorporating top-down cues in image segmentation. In ECCV, 2006. 1913
7. D. Hoiem, A. Efros, and M. Hebert. Automatic photo popup. SIGGRAPH, 24(3):577-584, 2005. 1913
8. P. Kohli, V. Lempitsky, and C. Rother. Uncertainty driven multi-scale optimization. In DAGM, 2010. 1914
9. P. Kohli and P. Torr. Efficiently solving dynamic Markov random fields using graph cuts. In ICCV, 2005. 1913
10. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. PAMI, 28(10):1568-1583, 2006. 1913, 1915, 1917
11. V. Kolmogorov and R. Zabih. Multi-camera scene reconstruction via graph cuts. In ECCV, 2002. 1913, 1915
12. N. Komodakis. Towards more efficient and effective LP-based algorithms for MRF optimization. In ECCV, 2010. 1913
13. N. Komodakis, G. Tziritas, and N. Paragios. Fast, approximately optimal solutions for single and dynamic MRFs. In CVPR, 2007. 1913, 1915
14. H. Lombaert, Y. Sun, L. Grady, and C. Xu. A multilevel banded graph cuts method for fast image segmentation. In ICCV, 2005. 1914
15. A. P. Moore, S. Prince, J. Warrell, U. Mohammed, and G. Jones. Superpixel lattices. In CVPR, 2008. 1914
16. J. Pearl. Fusion, propagation, and structuring in belief networks. Artif. Intell., 29(3):241-288, 1986. 1913, 1915
17. P. Pérez and F. Heitz. Restriction of a Markov random field on a graph and multiresolution statistical image modeling. IEEE Transactions on Information Theory, 1996. 1914
18. A. Rabinovich, S. Belongie, T. Lange, and J. Buhmann. Model order selection and cue combination for image segmentation. In CVPR, 2006. 1913
19. X. Ren and J. Malik. Learning a classification model for segmentation. In ICCV, 2003. 1914
20. J. Shi and J. Malik. Normalized cuts and image segmentation. PAMI, 22(8), 2000. 1914
21. J. Shotton, J. Winn, C. Rother, and A. Criminisi. Texton-Boost: Joint appearance, shape and context modeling for multi-class object recognition and segmentation. In ECCV (1), pages 1-15, 2006. 1917
22. A. K. Sinop and L. Grady. Accurate banded graph cut segmentation of thin structures using laplacian pyramids. In MICCAI, 2006. 1914
23. 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 Markov random fields. In ECCV, 2006. 1917
24. O. Veksler, Y. Boykov, and P. Mehrani. Superpixels and supervoxels in an energy optimization framework. In ECCV, 2010. 1914
25. M. Wainwright, T. Jaakkola, and A. Willsky. Map estimation via agreement on trees: message-passing and linear programming. IEEE Transactions on Information Theory, 51(11):3697-3717, 2005. 1913, 1915
26. Y. Weiss and W. Freeman. On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. Transactions on Information Theory, 2001. 1913, 1915, 1917
27. T. Werner. A linear programming approach to max-sum problem: A review. Research Report CTU-CMP-2005-25, Czech Technical University, December 2005. 1913, 1915