conference paper published yes Paul Swoboda author 446560C6-F248-11E8-B48F-1D18A9856A87 Bjoern Andres author VlKo department CVPR: Computer Vision and Pattern Recognition Discrete Optimization in Computer Vision: Theory and Practice project 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. https://research-explorer.ista.ac.at/download/915/5849/Swoboda_A_Message_Passing_CVPR_2017_paper.pdf application/pdfno IEEE2017Honolulu, HA, United States eng 978-153860457-1 00041837140500910.1109/CVPR.2017.530 20174990-4999 P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999. 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> 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> 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. 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. 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>. 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>. 9152018-12-11T11:49:11Z2024-11-04T13:52:34Z