1 code implementation • 26 Jun 2024 • Max Kahl, Sebastian Stricker, Lisa Hutschenreiter, Florian Bernard, Bogdan Savchynskyy
We consider the incomplete multi-graph matching problem, which is a generalization of the NP-hard quadratic assignment problem for matching multiple finite sets.
2 code implementations • 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.
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.
2 code implementations • 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.