research
∙
07/18/2023
Unsupervised Deep Graph Matching Based on Cycle Consistency
We contribute to the sparsely populated area of unsupervised deep graph ...
share
research
∙
01/26/2023
Relative-Interior Solution for (Incomplete) Linear Assignment Problem with Applications to Quadratic Assignment Problem
We study the set of optimal solutions of the dual linear programming for...
research
∙
07/01/2022
A Comparative Study of Graph Matching Algorithms in Computer Vision
The graph matching optimization problem is an essential component for ma...
research
∙
01/28/2021
Fusion Moves for Graph Matching
We contribute to approximate algorithms for the quadratic assignment pro...
research
∙
04/16/2020
MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models
Dense, discrete Graphical Models with pairwise potentials are a powerful...
research
∙
04/16/2020
Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization
We consider the maximum-a-posteriori inference problem in discrete graph...
research
∙
04/14/2020
A Primal-Dual Solver for Large-Scale Tracking-by-Assignment
We propose a fast approximate solver for the combinatorial problem known...
research
∙
04/14/2020
Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation
We consider the MAP-inference problem for graphical models, which is a v...
research
∙
01/24/2020
Discrete graphical models – an optimization perspective
This monograph is about discrete energy minimization for discrete graphi...
research
∙
12/16/2016
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching
We study the quadratic assignment problem, in computer vision also known...
research
∙
12/16/2016
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems
We propose a general dual ascent framework for Lagrangean decomposition ...
research
∙
12/07/2016
Global Hypothesis Generation for 6D Object Pose Estimation
This paper addresses the task of estimating the 6D pose of a known 3D ob...
research
∙
11/24/2016
InstanceCut: from Edges to Instances with MultiCut
This work addresses the task of instance-aware semantic segmentation. Ou...
research
∙
06/22/2016
Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization
We consider the problem of jointly inferring the M-best diverse labeling...
research
∙
01/09/2016
Multicuts and Perturb & MAP for Probabilistic Graph Clustering
We present a probabilistic graphical model formulation for the graph clu...
research
∙
08/31/2015
Maximum Persistency via Iterative Relaxed Inference with Graphical Models
We consider the NP-hard problem of MAP-inference for undirected discrete...
research
∙
10/24/2014
Partial Optimality by Pruning for MAP-Inference with General Graphical Models
We consider the energy minimization problem for undirected graphical mod...
research
∙
10/16/2012
Efficient MRF Energy Minimization via Adaptive Diminishing Smoothing
We consider the linear programming relaxation of an energy minimization ...
research
∙
10/15/2012