← Search

Stefan Haller

3 accepted papers

2022

A Comparative Study of Graph Matching Algorithms in Computer Vision

ECCV 2022poster

"The graph matching optimization problem is an essential component for many tasks in computer vision, such as bringing two deformable objects in correspondence. Naturally, a wide range of applicable algorithms have been proposed in the last decades. Since a common standard benchmark has not been dev…

2021

Fusion Moves for Graph Matching

ICCV 2021poster

We contribute to approximate algorithms for the quadratic assignment problem also known as graph matching. Inspired by the success of the fusion moves technique developed for multilabel discrete Markov random fields, we investigate its applicability to graph matching. In particular, we show how fusi…

Cited by 16PDFcodeScholar
2020

A Primal-Dual Solver for Large-Scale Tracking-by-Assignment

AISTATS 2020poster

We propose a fast approximate solver for the combinatorial problem known as tracking-by-assignment, which we apply to cell tracking. The latter plays a key role in discovery in many life sciences, especially in cell and developmental biology. So far, in the most general setting this problem was addr…