activity
20172025
most citedParametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination

20 citations · 21 across the 2 of their papers we have counts for

collaborators

5 papers

cs.CV2025

Cycle-Consistent Multi-Graph Matching for Self-Supervised Annotation of C.Elegans

Christoph Karg, Sebastian Stricker, Lisa Hutschenreiter +2

In this work we present a novel approach for unsupervised multi-graph matching, which applies to problems for which a Gaussian distribution of keypoint features can be assumed. We…

cs.CV2024

Optimizing Incomplete, Large-Scale and Sparse Multi-Graph Matching in Bioimaging

Max Kahl, Sebastian Stricker, Lisa Hutschenreiter +3

Multi-graph matching is a fundamental problem in computer vision. Our work is motivated by a challenging application in bioimaging, where dozens or even hundreds of 3D microscopy i…

cs.CV2021

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…

cs.CV20201 cited

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…

cs.LO201720 cited

Parametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination

Lisa Hutschenreiter, Christel Baier, Joachim Klein

Parametric Markov chains have been introduced as a model for families of stochastic systems that rely on the same graph structure, but differ in the concrete transition probabiliti…