Bogdan Savchynskyy

According to our database1, Bogdan Savchynskyy authored at least 37 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Unlocking the Potential of Operations Research for Multi-Graph Matching.
CoRR, 2024

Discrete Cycle-Consistency Based Unsupervised Deep Graph Matching.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Unsupervised Deep Graph Matching Based on Cycle Consistency.
CoRR, 2023

Relative-Interior Solution for (Incomplete) Linear Assignment Problem with Applications to Quadratic Assignment Problem.
CoRR, 2023

2022
Structured Prediction Problem Archive.
CoRR, 2022

A Comparative Study of Graph Matching Algorithms in Computer Vision.
Proceedings of the Computer Vision - ECCV 2022, 2022

2021
Fusion Moves for Graph Matching.
Proceedings of the 2021 IEEE/CVF International Conference on Computer Vision, 2021

2020
Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

A Primal-Dual Solver for Large-Scale Tracking-by-Assignment.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Discrete Graphical Models - An Optimization Perspective.
Found. Trends Comput. Graph. Vis., 2019

2018
Conditional Random Fields Meet Deep Neural Networks for Semantic Segmentation: Combining Probabilistic Graphical Models with Deep Learning for Structured Prediction.
IEEE Signal Process. Mag., 2018

Maximum Persistency via Iterative Relaxed Inference in Graphical Models.
IEEE Trans. Pattern Anal. Mach. Intell., 2018

MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models.
Proceedings of the Computer Vision - ECCV 2018, 2018

Exact MAP-Inference by Confining Combinatorial Search With LP Relaxation.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Towards Globally Optimal Normal Orientations for Large Point Clouds.
Comput. Graph. Forum, 2017

A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching.
Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017

A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems.
Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017

Global Hypothesis Generation for 6D Object Pose Estimation.
Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017

InstanceCut: From Edges to Instances with MultiCut.
Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017

2016
Partial Optimality by Pruning for MAP-Inference with General Graphical Models.
IEEE Trans. Pattern Anal. Mach. Intell., 2016

Multicuts and Perturb & MAP for Probabilistic Graph Clustering.
J. Math. Imaging Vis., 2016

Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Joint Training of Generic CNN-CRF Models with Stochastic Optimization.
Proceedings of the Computer Vision - ACCV 2016, 2016

2015
A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems.
Int. J. Comput. Vis., 2015

Probabilistic Correlation Clustering and Image Partitioning Using Perturbed Multicuts.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2015

M-Best-Diverse Labelings for Submodular Energies and Beyond.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Inferring M-Best Diverse Labelings in a Single One.
Proceedings of the 2015 IEEE International Conference on Computer Vision, 2015

2014
Partial Optimality by Pruning for MAP-Inference with General Graphical Models.
Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014

2013
Partial Optimality via Iterative Pruning for the Potts Model.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2013

Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Getting Feasible Variable Estimates from Infeasible Ones: MRF Local Polytope Study.
Proceedings of the 2013 IEEE International Conference on Computer Vision Workshops, 2013

2012
Efficient MRF Energy Minimization via Adaptive Diminishing Smoothing.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

A bundle approach to efficient MAP-inference by Lagrangian relaxation.
Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012

2011
Evaluation of a First-Order Primal-Dual Algorithm for MRF Energy Minimization.
Proceedings of the Energy Minimazation Methods in Computer Vision and Pattern Recognition, 2011

A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling.
Proceedings of the 24th IEEE Conference on Computer Vision and Pattern Recognition, 2011

2008
Discriminative Learning of Max-Sum Classifiers.
J. Mach. Learn. Res., 2008

2006
Character templates learning for textual images recognition as an example of learning in structural recognition.
Proceedings of the Second International Workshop on Document Image Analysis for Libraries (DIAL 2006), 2006


  Loading...