Get our free extension to see links to code for papers anywhere online!

Add to Chrome

Add to Firefox

Picture for Bogdan Savchynskyy

Bogdan Savchynskyy

Relative-Interior Solution for (Incomplete) Linear Assignment Problem with Applications to Quadratic Assignment Problem

Jan 26, 2023
Tomáš Dlask, Bogdan Savchynskyy

Figure 1 for Relative-Interior Solution for (Incomplete) Linear Assignment Problem with Applications to Quadratic Assignment Problem

Figure 2 for Relative-Interior Solution for (Incomplete) Linear Assignment Problem with Applications to Quadratic Assignment Problem

Figure 3 for Relative-Interior Solution for (Incomplete) Linear Assignment Problem with Applications to Quadratic Assignment Problem

Figure 4 for Relative-Interior Solution for (Incomplete) Linear Assignment Problem with Applications to Quadratic Assignment Problem

Access Paper or Ask Questions

Fusion Moves for Graph Matching

Feb 05, 2021
Lisa Hutschenreiter, Stefan Haller, Lorenz Feineis, Carsten Rother, Dagmar Kainmüller, Bogdan Savchynskyy

Figure 1 for Fusion Moves for Graph Matching

Figure 2 for Fusion Moves for Graph Matching

Figure 3 for Fusion Moves for Graph Matching

Figure 4 for Fusion Moves for Graph Matching

* 173 pages (including appendix)

Access Paper or Ask Questions

MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models

Apr 16, 2020
Siddharth Tourani, Alexander Shekhovtsov, Carsten Rother, Bogdan Savchynskyy

Figure 1 for MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models

Figure 2 for MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models

Figure 3 for MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models

Figure 4 for MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models

* Accepted in ECCV-2018

Access Paper or Ask Questions

Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization

Apr 16, 2020
Siddharth Tourani, Alexander Shekhovtsov, Carsten Rother, Bogdan Savchynskyy

Figure 1 for Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization

Figure 2 for Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization

Figure 3 for Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization

Figure 4 for Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization

* Accepted in AISTATS 2020

Access Paper or Ask Questions

A Primal-Dual Solver for Large-Scale Tracking-by-Assignment

Apr 14, 2020
Stefan Haller, Mangal Prakash, Lisa Hutschenreiter, Tobias Pietzsch, Carsten Rother, Florian Jug, Paul Swoboda, Bogdan Savchynskyy

Figure 1 for A Primal-Dual Solver for Large-Scale Tracking-by-Assignment

Figure 2 for A Primal-Dual Solver for Large-Scale Tracking-by-Assignment

Figure 3 for A Primal-Dual Solver for Large-Scale Tracking-by-Assignment

Figure 4 for A Primal-Dual Solver for Large-Scale Tracking-by-Assignment

* 23rd International Conference on Artificial Intelligence and Statistics (AISTATS), 2020

Access Paper or Ask Questions

Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation

Apr 14, 2020
Stefan Haller, Paul Swoboda, Bogdan Savchynskyy

Figure 1 for Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation

Figure 2 for Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation

Figure 3 for Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation

Figure 4 for Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation

* 32nd AAAI Conference on Artificial Intelligence, 2018

Access Paper or Ask Questions

Discrete graphical models -- an optimization perspective

Jan 24, 2020
Bogdan Savchynskyy

Figure 1 for Discrete graphical models -- an optimization perspective

Figure 2 for Discrete graphical models -- an optimization perspective

Figure 3 for Discrete graphical models -- an optimization perspective

Figure 4 for Discrete graphical models -- an optimization perspective

* Foundations and Trends in Computer Graphics and Vision: Vol. 11: No. 3-4, pp 160-429 (2019)
* 270 pages

Access Paper or Ask Questions

Maximum Persistency via Iterative Relaxed Inference with Graphical Models

Feb 03, 2017
Alexander Shekhovtsov, Paul Swoboda, Bogdan Savchynskyy

Figure 1 for Maximum Persistency via Iterative Relaxed Inference with Graphical Models

Figure 2 for Maximum Persistency via Iterative Relaxed Inference with Graphical Models

Figure 3 for Maximum Persistency via Iterative Relaxed Inference with Graphical Models

Figure 4 for Maximum Persistency via Iterative Relaxed Inference with Graphical Models

* Reworked version, submitted to PAMI

Access Paper or Ask Questions