Paul Swoboda

Kolmogorov Group

9 Publications

Mark all

[9]
2019 | Conference Paper | IST-REx-ID: 7468 | OA
Swoboda P, Kolmogorov V. Map inference via block-coordinate Frank-Wolfe algorithm. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Vol 2019-June. IEEE; 2019. doi:10.1109/CVPR.2019.01140
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 703 | OA
Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2018 | Conference Paper | IST-REx-ID: 5978 | OA
Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial search with LP relaxation. In: Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI Press; 2018:6581-6588.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[6]
2017 | Conference Paper | IST-REx-ID: 641
Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26
View | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 646 | OA
Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:10.1007/978-3-319-58771-4_19
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[4]
2017 | Conference Paper | IST-REx-ID: 916 | OA
Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol 2017. IEEE; 2017:7062-7071. doi:10.1109/CVPR.2017.747
[Submitted Version] View | Files available | DOI | WoS
 
[3]
2017 | Conference Paper | IST-REx-ID: 915 | OA
Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:10.1109/CVPR.2017.530
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2017 | Conference Paper | IST-REx-ID: 917 | OA
Swoboda P, Kuske J, Savchynskyy B. A dual ascent framework for Lagrangean decomposition of combinatorial problems. In: Vol 2017. IEEE; 2017:4950-4960. doi:10.1109/CVPR.2017.526
[Submitted Version] View | Files available | DOI | WoS
 
[1]
2016 | Research Data | IST-REx-ID: 5557 | OA
Swoboda P. Synthetic discrete tomography problems. 2016. doi:10.15479/AT:ISTA:46
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: AMA

    Export / Embed

9 Publications

Mark all

[9]
2019 | Conference Paper | IST-REx-ID: 7468 | OA
Swoboda P, Kolmogorov V. Map inference via block-coordinate Frank-Wolfe algorithm. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Vol 2019-June. IEEE; 2019. doi:10.1109/CVPR.2019.01140
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 703 | OA
Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2018 | Conference Paper | IST-REx-ID: 5978 | OA
Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial search with LP relaxation. In: Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI Press; 2018:6581-6588.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[6]
2017 | Conference Paper | IST-REx-ID: 641
Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26
View | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 646 | OA
Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:10.1007/978-3-319-58771-4_19
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[4]
2017 | Conference Paper | IST-REx-ID: 916 | OA
Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol 2017. IEEE; 2017:7062-7071. doi:10.1109/CVPR.2017.747
[Submitted Version] View | Files available | DOI | WoS
 
[3]
2017 | Conference Paper | IST-REx-ID: 915 | OA
Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:10.1109/CVPR.2017.530
[Submitted Version] View | Files available | DOI | WoS
 
[2]
2017 | Conference Paper | IST-REx-ID: 917 | OA
Swoboda P, Kuske J, Savchynskyy B. A dual ascent framework for Lagrangean decomposition of combinatorial problems. In: Vol 2017. IEEE; 2017:4950-4960. doi:10.1109/CVPR.2017.526
[Submitted Version] View | Files available | DOI | WoS
 
[1]
2016 | Research Data | IST-REx-ID: 5557 | OA
Swoboda P. Synthetic discrete tomography problems. 2016. doi:10.15479/AT:ISTA:46
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: AMA

    Export / Embed