23 citations · 90 across the 22 of their papers we have counts for
15 papers · 1 filter
Online Video Depth Anything: Temporally-Consistent Depth Prediction with Low Memory Consumption
Johann-Friedrich Feiden, Tim Küchler, Denis Zavadski +2
Depth estimation from monocular video has become a key component of many real-world computer vision systems. Recently, Video Depth Anything (VDA) has demonstrated strong performanc…
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…
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…
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…
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…