{"doi":"10.1109/CVPR.2011.5995361","status":"public","page":"1889 - 1896","publication_status":"published","day":"22","main_file_link":[{"url":"http://arxiv.org/pdf/1103.1077v1","open_access":"0"}],"month":"08","date_updated":"2021-01-12T07:41:47Z","publisher":"IEEE","title":"Submodular decomposition framework for inference in associative Markov networks with global constraints","date_created":"2018-12-11T12:02:00Z","conference":{"name":"CVPR: Computer Vision and Pattern Recognition"},"type":"conference","_id":"3206","publist_id":"3476","citation":{"short":"A. Osokin, D. Vetrov, V. Kolmogorov, in:, IEEE, 2011, pp. 1889–1896.","mla":"Osokin, Anton, et al. <i>Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints</i>. IEEE, 2011, pp. 1889–96, doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">10.1109/CVPR.2011.5995361</a>.","ama":"Osokin A, Vetrov D, Kolmogorov V. Submodular decomposition framework for inference in associative Markov networks with global constraints. In: IEEE; 2011:1889-1896. doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">10.1109/CVPR.2011.5995361</a>","ista":"Osokin A, Vetrov D, Kolmogorov V. 2011. Submodular decomposition framework for inference in associative Markov networks with global constraints. CVPR: Computer Vision and Pattern Recognition, 1889–1896.","ieee":"A. Osokin, D. Vetrov, and V. Kolmogorov, “Submodular decomposition framework for inference in associative Markov networks with global constraints,” presented at the CVPR: Computer Vision and Pattern Recognition, 2011, pp. 1889–1896.","chicago":"Osokin, Anton, Dmitry Vetrov, and Vladimir Kolmogorov. “Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints,” 1889–96. IEEE, 2011. <a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">https://doi.org/10.1109/CVPR.2011.5995361</a>.","apa":"Osokin, A., Vetrov, D., &#38; Kolmogorov, V. (2011). Submodular decomposition framework for inference in associative Markov networks with global constraints (pp. 1889–1896). Presented at the CVPR: Computer Vision and Pattern Recognition, IEEE. <a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">https://doi.org/10.1109/CVPR.2011.5995361</a>"},"abstract":[{"text":"In this paper we address the problem of finding the most probable state of discrete Markov random field (MRF) with associative pairwise terms. Although of practical importance, this problem is known to be NP-hard in general. We propose a new type of MRF decomposition, submod-ular decomposition (SMD). Unlike existing decomposition approaches SMD decomposes the initial problem into sub-problems corresponding to a specific class label while preserving the graph structure of each subproblem. Such decomposition enables us to take into account several types of global constraints in an efficient manner. We study theoretical properties of the proposed approach and demonstrate its applicability on a number of problems.","lang":"eng"}],"author":[{"first_name":"Anton","full_name":"Osokin, Anton","last_name":"Osokin"},{"first_name":"Dmitry","full_name":"Vetrov, Dmitry","last_name":"Vetrov"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov"}],"date_published":"2011-08-22T00:00:00Z","extern":1,"year":"2011","quality_controlled":0}