Bogdan Savchynskyy
19 papers · 2008–2026 · 8 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
π Academic Marathon (18) π Interdisciplinary Bridge π£ Hot Topic Early Bird π Conference Polyglot (8) π Cross-Pollinator (13)
π
Conference Polyglot
(8)
π
Academic Marathon
(18)
π£
Hot Topic Early Bird
π€
Dynamic Duo
(13)
ποΈ
Keyword Collector
(67)
π
Conference Pioneer
π
Century Club
(19)
π₯
Unstoppable
(6)
π
Trend Setter
Conferences
CVPR (7)
NIPS (3)
AISTATS (2)
ECCV (2)
ICCV (2)
AAAI (1)
JMLR (1)
WACV (1)
Top co-authors
Keywords
graphical model
(7)
combinatorial optimization
(7)
graph matching
(5)
map inference
(5)
energy minimization
(4)
markov random field
(4)
structured prediction
(2)
lagrangean decomposition
(2)
convex relaxation
(2)
quadratic assignment problem
(2)
cycle consistency
(2)
unsupervised learning
(2)
multi-graph matching
(2)
diverse labeling
(2)
linear programming relaxation
(2)
message passing
(2)
dual ascent
(2)
gaussian process
(1)
deep learning
(1)
instance segmentation
(1)
Papers
Cycle-Consistent Multi-Graph Matching for Self-Supervised Annotation of C. Elegans
WACV 2026
Towards Optimizing Large-Scale Multi-Graph Matching in Bioimaging
CVPR 2025
Discrete Cycle-Consistency Based Unsupervised Deep Graph Matching
AAAI 2024
A Comparative Study of Graph Matching Algorithms in Computer Vision
ECCV 2022
Fusion Moves for Graph Matching
ICCV 2021
A Primal-Dual Solver for Large-Scale Tracking-by-Assignment
AISTATS 2020
Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization
AISTATS 2020
MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models
ECCV 2018
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems
CVPR 2017
Global Hypothesis Generation for 6D Object Pose Estimation
CVPR 2017
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching
CVPR 2017
InstanceCut: From Edges to Instances With MultiCut
CVPR 2017
Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization
NIPS 2016
Maximum Persistency via Iterative Relaxed Inference With Graphical Models
CVPR 2015
Inferring M-Best Diverse Labelings in a Single One
ICCV 2015
M-Best-Diverse Labelings for Submodular Energies and Beyond
NIPS 2015
Partial Optimality by Pruning for MAP-inference with General Graphical Models
CVPR 2014
Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation
NIPS 2013
Discriminative Learning of Max-Sum Classifiers
JMLR 2008