1 code implementation • 1 Jul 2022 • Stefan Haller, Lorenz Feineis, Lisa Hutschenreiter, Florian Bernard, Carsten Rother, Dagmar Kainmüller, Paul Swoboda, Bogdan Savchynskyy
To address these shortcomings, we present a comparative study of graph matching algorithms.
no code implementations • 11 Mar 2022 • Stefan Haller, Adina Aldea, Christin Seifert, Nicola Strisciuglio
We complement previous surveys by providing a comprehensive analysis of recently published methods that deploy deep learning approaches.
1 code implementation • ICCV 2021 • Lisa Hutschenreiter, Stefan Haller, Lorenz Feineis, Carsten Rother, Dagmar Kainmüller, Bogdan Savchynskyy
We contribute to approximate algorithms for the quadratic assignment problem also known as graph matching.
1 code implementation • 14 Apr 2020 • Stefan Haller, Mangal Prakash, Lisa Hutschenreiter, Tobias Pietzsch, Carsten Rother, Florian Jug, Paul Swoboda, Bogdan Savchynskyy
We demonstrate the efficacy of our method on real-world tracking problems.
1 code implementation • 14 Apr 2020 • Stefan Haller, Paul Swoboda, Bogdan Savchynskyy
This property allows to significantly reduce the computational time of the combinatorial solver and therefore solve problems which were out of reach before.