
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers
Building on recent progress at the intersection of combinatorial optimiz...
read it

A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching
We study the quadratic assignment problem, in computer vision also known...
read it

A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems
We propose a general dual ascent framework for Lagrangean decomposition ...
read it

A Message Passing Algorithm for the Minimum Cost Multicut Problem
We propose a dual decomposition and linear program relaxation of the NP ...
read it

Partial Optimality by Pruning for MAPInference with General Graphical Models
We consider the energy minimization problem for undirected graphical mod...
read it

Multicuts and Perturb & MAP for Probabilistic Graph Clustering
We present a probabilistic graphical model formulation for the graph clu...
read it

Maximum Persistency via Iterative Relaxed Inference with Graphical Models
We consider the NPhard problem of MAPinference for undirected discrete...
read it

Convex Variational Image Restoration with Histogram Priors
We present a novel variational approach to image restoration (e.g., deno...
read it

MAP inference via BlockCoordinate FrankWolfe Algorithm
We present a new proximal bundle method for MaximumAPosteriori (MAP) i...
read it

Higherorder Projected Power Iterations for Scalable MultiMatching
The matching of multiple objects (e.g. shapes or images) is a fundamenta...
read it

Bottleneck potentials in Markov Random Fields
We consider general discrete Markov Random Fields(MRFs) with additional ...
read it

A PrimalDual Solver for LargeScale TrackingbyAssignment
We propose a fast approximate solver for the combinatorial problem known...
read it

Exact MAPInference by Confining Combinatorial Search with LP Relaxation
We consider the MAPinference problem for graphical models, which is a v...
read it
Paul Swoboda
is this you? claim profile