Robust higher order potentials for enforcing label consistency

International Journal of Computer Vision

Volumn 82, Issue 3, 2009, Pages 302-324

  Kohli, Pushmeet ^a   Ladický, L'Ubor ^b   Torr, Philip H S ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b OXFORD BROOKES UNIVERSITY   (United Kingdom)

Author keywords

Discrete energy minimization; Markov and conditional random fields; Object recognition and segmentation

Indexed keywords

CONTENT BASED RETRIEVAL; INFERENCE ENGINES; OBJECT RECOGNITION; OPTIMIZATION;

DATA SETS; DISCRETE ENERGY MINIMIZATION; ENERGY FUNCTIONS; EXPANSION MOVES; GRAPH CUTS; HIGHER ORDERS; IMAGE REGIONS; IMAGE SEGMENTS; MARKOV AND CONDITIONAL RANDOM FIELDS; MIN CUTS; MULTI CLASS; MULTIPLE SEGMENTATIONS; OBJECT BOUNDARIES; OBJECT SEGMENTATIONS; PAIRWISE CONTRASTS; POTENTIAL FUNCTIONS; POTTS MODELS; UNSUPERVISED SEGMENTATIONS;

IMAGE SEGMENTATION;

EID: 61349174704     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-008-0202-0     Document Type: Article

References (49)

1. Alahari, K., Kohli, P., & Torr, P. (2008). Reduce, reuse and recycle: efficiently solving multi-label MRFs. In IEEE conference on computer vision and pattern recognition.
2. Blake, A., Rother, C., Brown, M., Perez, P., & Torr, P. (2004). Interactive image segmentation using an adaptive GMMRF model. In European conference on computer vision (pp. I: 428-441).
3. Borenstein, E., & Malik, J. (2006). Shape guided object segmentation. In IEEE conference on computer vision and pattern recognition (pp. 969-976).
4. Boros, E., & Hammer, P. (2002). Pseudo-boolean optimization. Discrete Applied Mathematics, 123(1-3), 155-225.
5. Boykov, Y., & Jolly, M. (2001). Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In International conference on computer vision (pp. I: 105-112).
6. Boykov, Y., Veksler, O., & Zabih, R. (2001). Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11), 1222-1239.
7. Bray, M., Kohli, P., & Torr, P. (2006). Posecut: Simultaneous segmentation and 3d pose estimation of humans using dynamic graph-cuts. In European conference on computer vision (pp. 642-655).
8. Comaniciu, D., & Meer, P. (2002). Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(5), 603-619.
9. Felzenszwalb, P., & Huttenlocher, D. (2004). Efficient graph-based image segmentation. International Journal of Computer Vision, 59(2), 167-181.
10. Flach, B. (2002). Strukturelle bilderkennung (Tech. Rep.). Universit at Dresden.
11. Freedman, D., & Drineas, P. (2005). Energy minimization via graph cuts: Settling what is possible. In IEEE conference on computer vision and pattern recognition (pp. 939-946).
12. Fujishige, S. (199.1). Submodular functions and optimization. Amsterdam: North-Holland.
13. He, X., Zemel, R., & Carreira-Perpiñán, M. (2004). Multiscale conditional random fields for image labeling. In IEEE conference on computer vision and pattern recognition (2) (pp. 695-702).
14. He, X., Zemel, R., & Ray, D. (2006). Learning and incorporating topdown cues in image segmentation. In European conference on computer vision (pp. 338-351).
15. Hoiem, D., Efros, A., & Hebert, M. (2005a). Automatic photo pop-up. ACM Transactions on Graphics, 24(3), 577-584.
16. Hoiem, D., Efros, A., & Hebert, M. (2005b). Geometric context from a single image. In International conference on computer vision (pp. 654-661).
17. Huang, R., Pavlovic, V., & Metaxas, D. (2004). A graphical model framework for coupling MRFs and deformable models. In IEEE conference on computer vision and pattern recognition (Vol. 11, pp.739-746).
18. Ishikawa, H. (2003). Exact optimization for Markov random fields with convex priors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25, 1333-1336.
19. 3 and beyond: solving energies with higher order cliques. In IEEE conference on computer vision and pattern recognition.
20. Kohli, P., Ladicky, L., & Torr, P. (2008). Robust higher order potentials for enforcing label consistency. In CVPR.
21. Kolmogorov, V. (2006). Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10), 1568-1583.
22. Kolmogorov, V., & Zabih, R. (2004). What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2), 147-159.
23. Komodakis, N., & Tziritas, G. (2005). A new framework for approximate labeling via graph cuts. In International conference on computer vision (pp. 1018-1025).
24. Komodakis, N., Tziritas, G., & Paragios, N. (2007). Fast, approximately optimal solutions for single and dynamic MRFs. In CVPR.
25. Kumar, M., & Torr, P. (2008). Improved moves for truncated convex models. In Proceedings of advances in neural information processing systems.
26. Kumar, M., Torr, P., & Zisserman, A. (2005). Obj cut. In IEEE conference on computer vision and pattern recognition (1) (pp. 18-25).
27. Lafferty, J., McCallum, A., & Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labelling sequence data. In International conference on machine learning (pp. 282-289).
28. Lan, X., Roth, S., Huttenlocher, D., & Black, M. (2006). Efficient belief propagation with learned higher-order Markov random fields. In European conference on computer vision (pp. 269-282).
29. Lauristzen, S. (1996). Graphical models. Oxford: Oxford University Press.
30. Lempitsky, V., Rother, C., & Blake, A. (2007). Logcut - efficient graph cut optimization for Markov random fields. In ICCV.
31. Levin, A., & Weiss, Y. (2006). Learning to combine bottom-up and topdown segmentation. In European conference on computer vision (pp. 581-594).
32. Lovasz, L. (1983). Submodular functions and convexity. In Mathematical programming: the state of the art (pp. 235-257).
33. Orlin, J. (2007). A faster strongly polynomial time algorithm for submodular function minimization. In Proceedings of integer programming and combinatorial optimization (pp. 240-251).
34. Paget, R., & Longstaff, I. (1998). Texture synthesis via a noncausal nonparametric multiscale Markov random field. IEEE Transactions on Image Processing, 7(6), 925-931.
35. Potetz, B. (2007). Efficient belief propagation for vision using linear constraint nodes. In IEEE conference on computer vision and pattern recognition.
36. Rabinovich, A., Belongie, S., Lange, T., & Buhmann, J. (2006). Model order selection and cue combination for image segmentation. In IEEE conference on computer vision and pattern recognition (1) (pp. 1130-1137).
37. Ren, X., & Malik, J. (2003). Learning a classification model for segmentation. In International conference on computer vision (pp. 10-17).
38. Roth, S., & Black, M. (2005). Fields of experts: A framework for learning image priors. In IEEE conference on computer vision and pattern recognition (pp. 860-867).
39. Rother, C., Kolmogorov, V., & Blake, A. (2004). Grabcut: interactive foreground extraction using iterated graph cuts. In ACM transactions on graphics (pp. 309-314).
40. Russell, B., Freeman, W., Efros, A., Sivic, J., & Zisserman, A. (2006). Using multiple segmentations to discover objects and their extent in image collections. In IEEE conference on computer vision and pattern recognition (2) (pp. 1605-1614).
41. Schlesinger, D., & Flach, B. (2006). Transforming an arbitrary minsum problem into a binary one (Tech. Rep. TUD-FI06-01). Dresden University of Technology, April 2006.
42. Sharon, E., Brandt, A., & Basri, R. (2001). Segmentation and boundary detection using multiscale intensity measurements. In IEEE conference on computer vision and pattern recognition (1) (pp. 469-476).
43. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 888-905.
44. Shotton, J., Winn, J., Rother, C., & Criminisi, A. (2006). TextonBoost: Joint appearance, shape and context modeling for multi-class object recognition and segmentation. In European conference on computer vision (pp. 1-15).
45. Tu, Z., & Zhu, S. (2002). Image segmentation by data-driven Markov chain Monte Carlo. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(5), 657-673.
46. Veksler, O. (2007). Graph cut based optimization for MRFs with trun-cated convex priors. In CVPR.
47. Wainwright, M., Jaakkola, T., & Willsky, A. (2005). Map estimation via agreement on trees: message-passing and linear programming. IEEE Transactions on Information Theory, 51(11), 3697-3717.
48. Wang, J., Bhat, P., Colburn, A., Agrawala, M., & Cohen, M. (2005). Interactive video cutout. ACM Transactions on Graphics, 24(3), 585-594.
49. Yedidia, J., Freeman, W., & Weiss, Y. (2000). Generalized belief propagation. In NIPS (pp. 689-695).