[{"oa_version":"Preprint","dini_type":"doc-type:preprint","date_updated":"2021-01-12T07:00:45Z","date_created":"2018-12-11T12:00:23Z","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas","last_name":"Schoenemann"}],"department":[{"_id":"VlKo","tree":[{"_id":"ResearchGroups"},{"_id":"IST"}]}],"publication_status":"published","status":"public","_id":"2928","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","creator":{"id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","login":"kschuh"},"publist_id":"3809","abstract":[{"lang":"eng"}],"type":"preprint","language":[{}],"date_published":"2012-05-29T00:00:00Z","page":"16","external_id":{"arxiv":[]},"main_file_link":[{"url":"http://arxiv.org/abs/1205.6352","open_access":"1"}],"oa":1,"citation":{"ista":"Kolmogorov V, Schoenemann T. 2012. Generalized sequential tree-reweighted message passing. arXiv, .","apa":"Kolmogorov, V., & Schoenemann, T. (2012). Generalized sequential tree-reweighted message passing. arXiv. ArXiv.","ieee":"V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” arXiv. ArXiv, 2012.","mla":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” ArXiv, ArXiv, 2012.","short":"V. Kolmogorov, T. Schoenemann, ArXiv (2012).","chicago":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” ArXiv. ArXiv, 2012."},"publication":"arXiv","uri_base":"https://research-explorer.ista.ac.at","article_processing_charge":"No","month":"05","day":"29","dc":{"source":["Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message passing. arXiv. 2012."],"rights":["info:eu-repo/semantics/openAccess"],"relation":["info:eu-repo/semantics/altIdentifier/arxiv/1205.6352"],"publisher":["ArXiv"],"title":["Generalized sequential tree-reweighted message passing"],"date":["2012"],"language":["eng"],"identifier":["https://research-explorer.ista.ac.at/record/2928"],"type":["info:eu-repo/semantics/preprint","doc-type:preprint","text","http://purl.org/coar/resource_type/c_816b"],"description":[" This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an efficient way. Experiments show an improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on a number of computer vision and natural language processing problems. "],"creator":["Kolmogorov, Vladimir","Schoenemann, Thomas"]}}]