49 citations · 253 across the 30 of their papers we have counts for
31 papers
A Bregman-Sinkhorn Algorithm for the Maximum Weight Independent Set Problem
Stefan Haller, Bogdan Savchynskyy
We propose a scalable approximate algorithm for the NP-hard maximum-weight independent set problem, based on dual coordinate descent applied to a smoothed clique-cover LP relaxatio…
Weighted nonlinear flag manifolds as coadjoint orbits
Stefan Haller, Cornelia Vizman
A weighted nonlinear flag is a nested set of closed submanifolds, each submanifold endowed with a volume density. We study the geometry of Frechet manifolds of weighted nonlinear f…
A Comparative Study of Graph Matching Algorithms in Computer Vision
Stefan Haller, Lorenz Feineis, Lisa Hutschenreiter +5
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 ra…
Analytic torsion of generic rank two distributions in dimension five
Stefan Haller
We propose an analytic torsion for the Rumin complex associated with generic rank two distributions on closed 5-manifolds. This torsion behaves as expected with respect to Poincare…
Fusion Moves for Graph Matching
Lisa Hutschenreiter, Stefan Haller, Lorenz Feineis +3
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 multi…
A Primal-Dual Solver for Large-Scale Tracking-by-Assignment
Stefan Haller, Mangal Prakash, Lisa Hutschenreiter +5
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 man…