23 citations · 41 across the 6 of their papers we have counts for
6 papers
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…
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching
Paul Swoboda, Carsten Rother, Hassan Abu Alhaija +2
We study the quadratic assignment problem, in computer vision also known as graph matching. Two leading solvers for this problem optimize the Lagrange decomposition duals with sub-…
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems
Paul Swoboda, Jan Kuske, Bogdan Savchynskyy
We propose a general dual ascent framework for Lagrangean decomposition of combinatorial problems. Although methods of this type have shown their efficiency for a number of problem…
Global Hypothesis Generation for 6D Object Pose Estimation
Frank Michel, Alexander Kirillov, Eric Brachmann +4
This paper addresses the task of estimating the 6D pose of a known 3D object from a single RGB-D image. Most modern approaches solve this task in three steps: i) Compute local feat…
InstanceCut: from Edges to Instances with MultiCut
Alexander Kirillov, Evgeny Levinkov, Bjoern Andres +2
This work addresses the task of instance-aware semantic segmentation. Our key motivation is to design a simple method with a new modelling-paradigm, which therefore has a different…
A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems
Jörg H. Kappes, Bjoern Andres, Fred A. Hamprecht +10
Szeliski et al. published an influential study in 2006 on energy minimization methods for Markov Random Fields (MRF). This study provided valuable insights in choosing the best opt…