Inference methods for CRFs with Co-occurrence statistics

International Journal of Computer Vision

Volumn 103, Issue 2, 2013, Pages 213-225

  Ladický, L'ubor ^a   Russell, Chris ^b   Kohli, Pushmeet ^c   Torr, Philip H S ^d  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^c MICROSOFT RESEARCH   (United Kingdom)

^d OXFORD BROOKES UNIVERSITY   (United Kingdom)

Author keywords

Conditional random fields; Object class segmentation; Optimization

Indexed keywords

CO-OCCURRENCE STATISTICS; COMPUTATIONAL COSTS; CONDITIONAL RANDOM FIELD; CONDITIONAL RANDOM FIELDS(CRFS); INFERENCE METHODS; LOCAL INTERACTIONS; OBJECT CLASS; RANDOM FIELDS;

IMAGE SEGMENTATION; OPTIMIZATION; RANDOM PROCESSES;

PIXELS;

EID: 84878691091     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-012-0583-y     Document Type: Article

References (43)

1. Benson, H. Y.;& Shanno, D. F. (2007). An exact primal - dual penalty method approach to warmstarting interior-point methods for linear programming. Computational Optimization and Applications, 38(3), 371-399.
2. Borenstein, E.;& Malik, J. (2006). Shape guided object segmentation. In IEEE Conference on Computer Vision and Pattern Recognition, (pp. 969-976) New York.
3. 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.
4. Choi, M. J.; Lim, J. J.; Torralba, A.;& Willsky, A. S. (2010). Exploiting hierarchical context on a large database of object categories. In IEEE Conference on Computer Vision and Pattern Recognition, San Francisco.
5. Comaniciu, D.;& Meer, P. (2002). Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 603-619.
6. Csurka, G.;& Perronnin, F. (2008). A simple high performance approach to semantic segmentation. In British Machine Vision Conference08, Leeds.
7. Delong, A.; Osokin, A.; Isack, H.;& Boykov, Y. (2010). Fast approximate energy minimization with label costs. In IEEE Conference on Computer Vision and Pattern Recognition, San Francisco.
8. Felzenszwalb, P. F.;& Huttenlocher, D. P. (2004). Efficient graph-based image segmentation. International Journal of Computer Vision, 59(2), 167-181.
9. Galleguillos, C.; Rabinovich, A.;& Belongie, S. (2008). Object categorization using co-occurrence, location and appearance. In IEEE Conference on Computer Vision and Pattern Recognition, Anchorage.
10. Gould, S.; Fulton, R.;& Koller, D. (2009). Decomposing a scene into geometric and semantically consistent regions. In International Conference on Computer Vision, Kyoto.
11. Heitz, G.;& Koller, D. (2008). Learning spatial context: Using stuff to find things. In European Conference on Computer Vision, Marseille.
12. Hoiem, D.; Rother, C.;& Winn, J. M. (2007). 3d layoutcrf for multi-view object class recognition and segmentation. In IEEE Conference on Computer Vision and Pattern Recognition, San Diego.
13. 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), 616-639.
14. Kohli, P.; Ladicky, L.;& Torr, P. H. S. (2008). Robust higher order potentials for enforcing label consistency. In IEEE Conference on Computer Vision and Pattern Recognition, Anchorage.
15. Kolmogorov, V. (2006). Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10), 1568-1583.
16. Kolmogorov, V.;& Rother, C. (2006). Comparison of energy minimization algorithms for highly connected graphs. In Proceedings of European Conference on Computer Vision (pp. 1-15). Heidelberg: Springer.
17. Komodakis, N.; Tziritas, G.;& Paragios, N. (2007). Fast, approximately optimal solutions for single and dynamic mrfs. In IEEE Conference on Computer Vision and Pattern Recognition, Minneapolis, MN.
18. Kumar, M.;& Torr, P. H. S. (2008). Efficiently solving convex relaxations for map estimation. In International Conference on Machine Learning. New York: ACM.
19. Kumar, M. P.; Veksler, O.;& Torr, P. H. S. (2011). Improved moves for truncated convex models. Journal of Machine Learning Research, 12, 31-67.
20. Ladicky, L.; Russell, C.; Kohli, P.;& Torr, P. H. S. (2009). Associative hierarchical crfs for object class image segmentation. In International Conference on Computer Vision.
21. Ladicky, L.; Russell, C.; Sturgess, P.; Alahari, K.;& Torr, P. H. S. (2010). What, where and how many? combining object detectors and crfs. European Conference on Computer Vision.
22. Lafferty, J.; McCallum, A.;& Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labelling sequence data. In International Conference on Machine Learning.
23. Larlus, D.;& Jurie, F. (2008). Combining appearance models and markov random fields for category level object segmentation. In IEEE Conference on Computer Vision and Pattern Recognition.
24. Narasimhan, M.;& Bilmes, J. A. (2005). A submodular-supermodular procedure with applications to discriminative structure learning. In Uncertainty in Artificial Intelligence (pp. 404-412).
25. Rabinovich, A.; Vedaldi, A.; Galleguillos, C.; Wiewiora, E.;& Belongie, S. (2007). Objects in context. In International Conference on Computer Vision, Rio de Janeiro.
26. Ren, X.; Fowlkes, C.;& Malik, J. (2005). Mid-level cues improve boundary detection. Tech. Rep. UCB/CSD-05-1382, EECS Department, University of California, Berkeley.
27. Rother, C.; Kumar, S.; Kolmogorov, V.;& Blake, A. (2005). Digital tapestry. In IEEE Conference on Computer Vision and Pattern Recognition (pp. 589-596).
28. 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.
29. Russell, C.; Ladicky, L.; Kohli, P.;& Torr, P. H. S. (2010). Exact and approximate inference in associative hierarchical networks using graph cuts. Uncertainty in Artificial Intelligence, Catalina Island, CA.
30. Schlesinger, M. (1976). Syntactic analysis of two-dimensional visual signals in noisy conditions. Kibernetika, 4, 113-130. (in Russian).
31. Schölkopf, B.;& Smola, A. J. (2001). Learning with kernels: support vector machines, regularization, optimization, and beyond. Adoptive Computation& Machine Learning. Cambridge, MA: MIT Press.
32. Shi, J.;& Malik, J. (2000). Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell, 22(8), 888-905.
33. 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 (Vol. 1, pp 1-15).
34. Sturgess, P.; Ladicky, L.; Crook, N.;& Torr, P. H. S. (2012). Scalable cascade inference for semantic image segmentation. In British Machine Vision Conference.
35. Szeliski, R.; Zabih, R.; Scharstein, D.; Veksler, O.; Kolmogorov, V.; Agarwala, A.; et al. (2006). A comparative study of energy minimization methods for markov random fields. In European Conference on Computer Vision.
36. Torr, P. H. S. (1998). Geometric motion segmentation and model selection [and discussion]. Philosophical Transactions: Mathematical, Physical and Engineering Sciences, 356(1740), 1321-1340.
37. Torralba, A.; Murphy, K. P.; Freeman, W. T.;& Rubin, M. A. (2003). Context-based vision system for place and object recognition. In Proceedings of the Nineth IEEE International Conference on Computer Vision.
38. Toyoda, T.;& Hasegawa, O. (2008). Random field model for integration of local information and global information. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(8), 1483-1489.
39. Wainwright, M.; Jaakkola, T.;& Willsky, A. (2002). Map estimation via agreement on (hyper)trees: Messagepassing and linear programming approaches. Cambridge, MA: MIT Press.
40. Wainwright, M.; Jaakkola, T.;& Willsky, A. (2005). Map estimation via agreement on trees: Message-passing and linear programming. IEEE Transactions on Information Theory (pp. 3697-3717).
41. Weiss, Y.;& Freeman, W. (2001). On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. IEEE Transactions on Information Theory, 47(2), 723-735.
42. Werner, T. (2007). A linear programming approach to max-sum problem: A review. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(7), 1165-1179.
43. Yang, L.; Meer, P.;& Foran, D. J. (2007). Multiple class segmentation using a unified framework over mean-shift patches. In IEEE Conference on Computer Vision and Pattern Recognition.