Fast approximate energy minimization with label costs

International Journal of Computer Vision

Volumn 96, Issue 1, 2012, Pages 1-27

  Delong, Andrew ^a   Osokin, Anton ^b   Isack, Hossam N ^a   Boykov, Yuri ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

Energy minimization; Graph cuts; Metric labeling; Minimum description length; Multi model fitting

Indexed keywords

ENERGY MINIMIZATION; GRAPH CUT; METRIC LABELING; MINIMUM DESCRIPTION LENGTH; MULTI-MODEL;

COMPUTER VISION; COSTS; IMAGE SEGMENTATION; MATLAB;

ALGORITHMS;

EID: 84855348351     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-011-0437-z     Document Type: Article

References (64)

1. H. Akaike 1974 A new look at statistical model identification IEEE Transactions on Automatic Control 19 716 723 10.1109/TAC.1974.1100705 0314.62039 423716
2. I. B. Ayed A. Mitiche 2008 A region merging prior for variational level set image segmentation IEEE Transactions on Image Processing 17 12 2301 2311 10.1109/TIP.2008.2006425 2517433
3. D. A. Babayev 1974 Comments on the note of frieze Mathematical Programming 7 1 249 252 10.1007/BF01585522 0294.90056 359732
4. Barinova, O., Lempitsky, V., & Kohli, P. (2010). On the detection of multiple object instances using hough transforms. In IEEE conf. on computer vision and pattern recognition (CVPR), June 2010.
5. Birchfield, S., & Tomasi, C. (1999). Multiway cut for stereo and motion with slanted surfaces. In International conf. on computer vision (ICCV).
6. Bishop, C. M. (2006). Pattern recognition and machine learning. Berlin: Springer.
7. Blake, A., & Zisserman, A. (1987). Visual reconstruction. Cambridge: MIT Press.
8. E. Boros P. L. Hammer 2002 Pseudo-boolean optimization Discrete Applied Mathematics 123 1-3 155 225 10.1016/S0166-218X(01)00341-9 1076.90032 1922334 (Pubitemid 34775573)
9. Boykov, Y., & Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts. In International conf. on computer vision (ICCV).
10. Y. Boykov V. Kolmogorov 2004 An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision IEEE transactions on pattern analysis and machine intelligence 29 9 1124 1137 10.1109/TPAMI.2004. 60
11. Y. Boykov O. Veksler R. Zabih 2001 Fast approximate energy minimization via graph cuts IEEE transactions on pattern analysis and machine intelligence 23 11 1222 1239 10.1109/34.969114 (Pubitemid 33137959)
12. Brox, T., & Weickert, J. (2004). Level set based segmentation of multiple objects. In LNCS: Vol. 3175. Pattern recognition (pp. 415-423).
13. Burnham, K. P., & Anderson, D. R. (2002). Model selection and multimodel inference. Berlin: Springer.
14. D. Comaniciu P. Meer 2002 Mean shift: a robust approach toward feature space analysis IEEE transactions on pattern analysis and machine intelligence 24 5 603 619 10.1109/34.1000236 (Pubitemid 34550429)
15. G. Cornuejols M. L. Fisher G. L. Nemhauser 1977 Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms Management Science 23 8 789 810 10.1287/mnsc.23.8.789 0361.90034 444049
16. Cornuejols, G., Nemhauser, G. L., & Wolsey, L. A. (1983). The uncapacitated facility location problem. Technical Report 605, Op. Research, Cornell University, August.
17. E. Dahlhaus D. S. Johnson C. H. Papadimitriou P. D. Seymour M. Yannakakis 1994 The complexity of multiterminal cuts SIAM Journal on Computing 23 4 864 894 10.1137/S0097539792225297 0809.68075 1283579
18. Delong, A., Osokin, A., Isack, H., & Boykov, Y. (2010). Fast approximate energy minimization with label costs. In IEEE conf. on computer vision and pattern recognition (CVPR), June 2010.
19. A. P. Dempster N. M. Laird D. B. Rubin 1977 Maximum likelihood from incomplete data via the EM algorithm Journal of the Royal Statistical Society 39 1 1 38 0364.62022 501537
20. H. Everett 1963 Generalized Lagrange multiplier method for solving problems of optimum allocation of resources Operations Research 11 3 399 417 10.1287/opre.11.3.399 0113.14202 152360
21. U. Feige 1998 A threshold of ln n for approximating set cover Journal of the ACM 45 4 634 652 10.1145/285055.285059 1065.68573 1675095 (Pubitemid 128488790)
22. M. A. Figueiredo A. K. Jain 2002 Unsupervised learning of finite mixture models IEEE Transactions on Pattern Analysis and Machine Intelligence 24 3 381 396 10.1109/34.990138 (Pubitemid 35289353)
23. M. A. Fischler R. C. Bolles 1981 Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography Communications of the ACM 24 6 381 395 10.1145/358669.358692 618158 (Pubitemid 12444102)
24. Freedman, D., & Drineas, P. (2005). Energy minimization via graph cuts: settling what is possible. In IEEE conf. on computer vision and pattern recognition (CVPR), June 2005.
25. A. M. Frieze 1974 A cost function property for plant location problems Mathematical Programming 7 1 245 248 10.1007/BF01585521 0292.90039 359731
26. S. Geman D. Geman 1984 Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images IEEE Transactions on Pattern Analysis and Machine Intelligence 6 721 741 10.1109/TPAMI.1984.4767596 0573.62030 (Pubitemid 15453722)
27. Gersho, A., & Gray, R. M. (2001). Vector quantization and signal compression. Norwell: Kluwer Academic.
28. Hartley, R., & Zisserman, A. (2003). Multiple view geometry in computer vision. Cambridge: Cambridge University Press.
29. D. S. Hochbaum 1982 Heuristics for the fixed cost median problem Mathematical Programming 22 1 148 162 10.1007/BF01581035 0473.90029 643582
30. Hoiem, D., Rother, C., & Winn, J. (2007). 3D LayoutCRF for multi-view object class recognition and segmentation. In IEEE conf. on computer vision and pattern recognition (CVPR).
31. Isack, H. N., & Boykov, Y. (2011) Energy-based geometric multi-model fitting. International Journal of Computer Vision (IJCV). doi: 10.1007/s11263-011-0474-7
32. Kleinberg, J., & Tardos, E. (2002). Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. Journal of the ACM, 49(5).
33. 3 & Beyond: solving energies with higher order cliques. In IEEE conf. on computer vision and pattern recognition (CVPR).
34. P. Kohli L. Ladický P. H. S. Torr 2009 Robust higher order potentials for enforcing label consistency International Journal of Computer Vision 82 3 302 324 10.1007/s11263-008-0202-0
35. V. Kolmogorov 2006 Convergent tree-reweighted message passing for energy minimization IEEE Transactions on Pattern Analysis and Machine Intelligence 28 10 1568 1583 10.1109/TPAMI.2006.200 (Pubitemid 46405078)
36. Kolmogorov, V., Boykov, Y., & Rother, C. (2007). Applications of parametric maxflow in computer vision. In International conf. on computer vision (ICCV).
37. V. Kolmogorov R. Zabih 2004 What energy functions can be optimized via graph cuts IEEE Transactions on Pattern Analysis and Machine Intelligence 26 2 147 159 10.1109/TPAMI.2004.1262177
38. A. A. Kuehn M. J. Hamburger 1963 A heuristic program for locating warehouses Management Science 9 4 643 666 10.1287/mnsc.9.4.643
39. Ladický, L., Russell, C., Kohli, P., & Torr, P. (2010). Graph cut based inference with co-occurrence statistics. In European conf. on computer vision (ECCV), September 2010.
40. Lazic, N., Givoni, I., Frey, B., & Aarabi, P. (2009). FLoSS: facility location for subspace segmentation. In International conf. on computer vision (ICCV).
41. Y. G. Leclerc 1989 Constructing simple stable descriptions for image partitioning International Journal of Computer Vision 3 1 73 102 10.1007/BF00054839
42. Li, H. (2007). Two-view motion segmentation from linear programming relaxation. In IEEE conf. on computer vision and pattern recognition (CVPR).
43. D. G. Lowe 2004 Distinctive image features from scale-invariant keypoints International Journal of Computer Vision 60 91 110 10.1023/B:VISI.0000029664. 99615.94
44. MacKay, D. J. C. (2003). Information theory, inference, and learning algorithms. Cambridge: Cambridge University Press.
45. T. Mitchell J. Beauchamp 1988 Bayesian variable selection in linear regression Journal of the American Statistical Association 83 404 1023 1032 10.2307/2290129 0673.62051 997578
46. G. L. Nemhauser L. A. Wolsey M. L. Fisher 1978 An analysis of approximations for maximizing submodular set functions-I Mathematical Programming 14 1 265 294 10.1007/BF01588971 0374.90045 503866
47. A. Ortega K. Ramchandran 1998 Rate-distortion methods for image and video compression IEEE Signal Processing Magazine 15 6 23 50 10.1109/79.733495 (Pubitemid 128556821)
48. Rother, C., Kolmogorov, V., & Blake, A. (2004). GrabCut: interactive foreground extraction using iterated graph cuts. In ACM SIGGRAPH.
49. Shmoys, D. B., Tardos, E., & Aardal, K. (1998). Approximation algorithms for facility location problems (extended abstract). In ACM symposium on theory of computing (STOC) (pp. 265-274).
50. Sun, M. (2005). A tabu search heuristic for the uncapacitated facility location problem. In Metaheuristic optimization via memory and evolution: Vol. 30 (pp. 191-211). Berlin: Springer.
51. K. K. Sung T. Poggio 1995 Example based learning for view-based human face detection IEEE Transactions on Pattern Analysis and Machine Intelligence 20 39 51 10.1109/34.655648 (Pubitemid 128741306)
52. R. Szeliski R. Zabih D. Scharstein O. Veksler V. Kolmogorov A. Agarwala M. Tappen C. Rother 2008 A comparative study of energy minimization methods for Markov random fields with smoothness-based priors IEEE Transactions on Pattern Analysis and Machine Intelligence 30 6 1068 1080 10.1109/TPAMI.2007.70844 (Pubitemid 351650109)
53. Szummer, M., Kohli, P., & Hoiem, D. (2008). Learning CRFs using graph cuts. In European conf. on computer vision (ECCV).
54. Taskar, B., Chatalbashev, V., & Koller, D. (2004). Learning associative Markov networks. In International conf. on machine learning (ICML).
55. Torr, P. H. S. (1998). Geometric motion segmentation and model selection. Philosophical Trans. of the Royal Society A (pp. 1321-1340). (Pubitemid 128548608)
56. Tron, R., & Vidal, R. (2007). A benchmark for the comparison of 3-d motion segmentation algorithms. In IEEE conf. on computer vision and pattern recognition (CVPR).
57. I. Tsochantaridis T. Joachims T. Hofmann Y. Altun 2006 Large margin methods for structured and interdependent output variables Journal of Machine Learning Research 6 2 1453 1484 2249862
58. N. Ueda R. Nakano Z. Ghahramani G. E. Hinton 2000 SMEM algorithm for mixture models Neural Computation 12 9 2109 2128 10.1162/089976600300015088
59. Werner, T. (2008). High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF). In IEEE conf. on computer vision and pattern recognition (CVPR), June 2008.
60. Woodford, O. J., Rother, C., & Kolmogorov, V. (2009). A global perspective on MAP inference for low-level vision. In International conf. on computer vision (ICCV), October 2009.
61. Yuan, J., & Boykov, Y. (2010). TV-based multi-label image segmentation with label cost prior. In British machine vision conference (BMVC), Sept 2010.
62. Zabih, R., & Kolmogorov, V. (2004). Spatially coherent clustering with graph cuts. In IEEE conf. on computer vision and pattern recognition (CVPR), June 2004.
63. S. C. Zhu A. L. Yuille 1996 Region competition: unifying snakes, region growing, and Bayes/MDL for multiband image segmentation IEEE Transactions on Pattern Analysis and Machine Intelligence 18 9 884 900 10.1109/34.537343 (Pubitemid 126772831)
64. Zuliani, M., Kenney, C. S., & Manjunath, B. S. (2005). The multiRANSAC algorithm and its application to detect planar homographies. In International conf. on image processing (ICIP).