{"project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"ddc":["000"],"isi":1,"file_date_updated":"2020-07-14T12:48:15Z","year":"2017","publist_id":"6526","volume":2017,"intvolume":"      2017","_id":"915","language":[{"iso":"eng"}],"citation":{"chicago":"Swoboda, Paul, and Bjoern Andres. “A Message Passing Algorithm for the Minimum Cost Multicut Problem,” 2017:4990–99. IEEE, 2017. <a href=\"https://doi.org/10.1109/CVPR.2017.530\">https://doi.org/10.1109/CVPR.2017.530</a>.","ista":"Swoboda P, Andres B. 2017. A message passing algorithm for the minimum cost multicut problem. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4990–4999.","apa":"Swoboda, P., &#38; Andres, B. (2017). A message passing algorithm for the minimum cost multicut problem (Vol. 2017, pp. 4990–4999). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2017.530\">https://doi.org/10.1109/CVPR.2017.530</a>","ama":"Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:<a href=\"https://doi.org/10.1109/CVPR.2017.530\">10.1109/CVPR.2017.530</a>","short":"P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.","mla":"Swoboda, Paul, and Bjoern Andres. <i>A Message Passing Algorithm for the Minimum Cost Multicut Problem</i>. Vol. 2017, IEEE, 2017, pp. 4990–99, doi:<a href=\"https://doi.org/10.1109/CVPR.2017.530\">10.1109/CVPR.2017.530</a>.","ieee":"P. Swoboda and B. Andres, “A message passing algorithm for the minimum cost multicut problem,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4990–4999."},"conference":{"location":"Honolulu, HA, United States","end_date":"2017-07-26","name":"CVPR: Computer Vision and Pattern Recognition","start_date":"2017-07-21"},"ec_funded":1,"publication_identifier":{"isbn":["978-153860457-1"]},"external_id":{"isi":["000418371405009"]},"has_accepted_license":"1","author":[{"last_name":"Swoboda","first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","full_name":"Swoboda, Paul"},{"full_name":"Andres, Bjoern","first_name":"Bjoern","last_name":"Andres"}],"doi":"10.1109/CVPR.2017.530","page":"4990-4999","status":"public","title":"A message passing algorithm for the minimum cost multicut problem","quality_controlled":"1","scopus_import":"1","publisher":"IEEE","date_created":"2018-12-11T11:49:11Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","oa":1,"abstract":[{"lang":"eng","text":"We propose a dual decomposition and linear program relaxation of the NP-hard minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut polytope, it is amenable to efficient optimization by message passing. Like other polyhedral relaxations, it can be tightened efficiently by cutting planes.  We define an algorithm that alternates between message passing and efficient separation of cycle- and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art algorithms based on linear programming, including algorithms written in the framework of leading commercial software, as we show in experiments with large instances of the problem from applications in computer vision, biomedical image analysis and data mining."}],"department":[{"_id":"VlKo"}],"publication_status":"published","date_published":"2017-07-01T00:00:00Z","date_updated":"2023-09-26T15:43:27Z","article_processing_charge":"No","month":"07","day":"01","type":"conference","file":[{"date_updated":"2020-07-14T12:48:15Z","date_created":"2019-01-18T12:52:46Z","file_size":883264,"file_id":"5849","checksum":"7e51dacefa693574581a32da3eff63dc","relation":"main_file","creator":"dernst","access_level":"open_access","file_name":"Swoboda_A_Message_Passing_CVPR_2017_paper.pdf","content_type":"application/pdf"}]}