default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBogdan Savchynskyy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Siddharth Tourani, Muhammad Haris Khan, Carsten Rother, Bogdan Savchynskyy:
Discrete Cycle-Consistency Based Unsupervised Deep Graph Matching. AAAI 2024: 5252-5260- [i22]Max Kahl, Sebastian Stricker, Lisa Hutschenreiter, Florian Bernard, Bogdan Savchynskyy:
Unlocking the Potential of Operations Research for Multi-Graph Matching. CoRR abs/2406.18215 (2024) - 2023
- [i21]Tomás Dlask, Bogdan Savchynskyy:
Relative-Interior Solution for (Incomplete) Linear Assignment Problem with Applications to Quadratic Assignment Problem. CoRR abs/2301.11201 (2023) - [i20]Siddharth Tourani, Carsten Rother, Muhammad Haris Khan, Bogdan Savchynskyy:
Unsupervised Deep Graph Matching Based on Cycle Consistency. CoRR abs/2307.08930 (2023) - 2022
- [c25]Stefan Haller
, Lorenz Feineis, Lisa Hutschenreiter, Florian Bernard, Carsten Rother, Dagmar Kainmüller, Paul Swoboda, Bogdan Savchynskyy:
A Comparative Study of Graph Matching Algorithms in Computer Vision. ECCV (23) 2022: 636-653 - [i19]Paul Swoboda, Andrea Hornáková, Paul Roetzer, Bogdan Savchynskyy, Ahmed Abbas:
Structured Prediction Problem Archive. CoRR abs/2202.03574 (2022) - [i18]Stefan Haller, Lorenz Feineis, Lisa Hutschenreiter, Florian Bernard, Carsten Rother, Dagmar Kainmüller, Paul Swoboda, Bogdan Savchynskyy:
A Comparative Study of Graph Matching Algorithms in Computer Vision. CoRR abs/2207.00291 (2022) - 2021
- [c24]Lisa Hutschenreiter, Stefan Haller, Lorenz Feineis, Carsten Rother, Dagmar Kainmüller, Bogdan Savchynskyy:
Fusion Moves for Graph Matching. ICCV 2021: 6250-6259 - [i17]Lisa Hutschenreiter, Stefan Haller, Lorenz Feineis, Carsten Rother, Dagmar Kainmüller, Bogdan Savchynskyy:
Fusion Moves for Graph Matching. CoRR abs/2101.12085 (2021) - 2020
- [c23]Stefan Haller, Mangal Prakash, Lisa Hutschenreiter, Tobias Pietzsch, Carsten Rother, Florian Jug, Paul Swoboda, Bogdan Savchynskyy:
A Primal-Dual Solver for Large-Scale Tracking-by-Assignment. AISTATS 2020: 2539-2549 - [c22]Siddharth Tourani, Alexander Shekhovtsov, Carsten Rother, Bogdan Savchynskyy:
Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization. AISTATS 2020: 2775-2785 - [i16]Bogdan Savchynskyy:
Discrete graphical models - an optimization perspective. CoRR abs/2001.09017 (2020) - [i15]Stefan Haller, Paul Swoboda, Bogdan Savchynskyy:
Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation. CoRR abs/2004.06370 (2020) - [i14]Stefan Haller, Mangal Prakash, Lisa Hutschenreiter, Tobias Pietzsch, Carsten Rother, Florian Jug, Paul Swoboda, Bogdan Savchynskyy:
A Primal-Dual Solver for Large-Scale Tracking-by-Assignment. CoRR abs/2004.06375 (2020) - [i13]Siddharth Tourani, Alexander Shekhovtsov, Carsten Rother, Bogdan Savchynskyy:
Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization. CoRR abs/2004.07715 (2020) - [i12]Siddharth Tourani, Alexander Shekhovtsov, Carsten Rother, Bogdan Savchynskyy:
MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models. CoRR abs/2004.08227 (2020)
2010 – 2019
- 2019
- [j8]Bogdan Savchynskyy:
Discrete Graphical Models - An Optimization Perspective. Found. Trends Comput. Graph. Vis. 11(3-4): 160-429 (2019) - 2018
- [j7]Alexander Shekhovtsov, Paul Swoboda, Bogdan Savchynskyy:
Maximum Persistency via Iterative Relaxed Inference in Graphical Models. IEEE Trans. Pattern Anal. Mach. Intell. 40(7): 1668-1682 (2018) - [j6]Anurag Arnab, Shuai Zheng, Sadeep Jayasumana, Bernardino Romera-Paredes, Måns Larsson, Alexander Kirillov, Bogdan Savchynskyy, Carsten Rother, Fredrik Kahl, Philip H. S. Torr:
Conditional Random Fields Meet Deep Neural Networks for Semantic Segmentation: Combining Probabilistic Graphical Models with Deep Learning for Structured Prediction. IEEE Signal Process. Mag. 35(1): 37-52 (2018) - [c21]Stefan Haller, Paul Swoboda, Bogdan Savchynskyy:
Exact MAP-Inference by Confining Combinatorial Search With LP Relaxation. AAAI 2018: 6581-6588 - [c20]Siddharth Tourani, Alexander Shekhovtsov, Carsten Rother, Bogdan Savchynskyy:
MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models. ECCV (4) 2018: 264-281 - 2017
- [j5]Nico Schertler, Bogdan Savchynskyy, Stefan Gumhold:
Towards Globally Optimal Normal Orientations for Large Point Clouds. Comput. Graph. Forum 36(1): 197-208 (2017) - [c19]Frank Michel, Alexander Kirillov, Eric Brachmann, Alexander Krull, Stefan Gumhold, Bogdan Savchynskyy, Carsten Rother:
Global Hypothesis Generation for 6D Object Pose Estimation. CVPR 2017: 115-124 - [c18]Paul Swoboda, Jan Kuske, Bogdan Savchynskyy:
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems. CVPR 2017: 4950-4960 - [c17]Paul Swoboda, Carsten Rother, Hassan Abu Alhaija, Dagmar Kainmüller, Bogdan Savchynskyy:
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching. CVPR 2017: 7062-7071 - [c16]Alexander Kirillov, Evgeny Levinkov, Bjoern Andres, Bogdan Savchynskyy, Carsten Rother:
InstanceCut: From Edges to Instances with MultiCut. CVPR 2017: 7322-7331 - 2016
- [j4]Jörg Hendrik Kappes, Paul Swoboda, Bogdan Savchynskyy, Tamir Hazan, Christoph Schnörr:
Multicuts and Perturb & MAP for Probabilistic Graph Clustering. J. Math. Imaging Vis. 56(2): 221-237 (2016) - [j3]Paul Swoboda, Alexander Shekhovtsov, Jörg Hendrik Kappes, Christoph Schnörr, Bogdan Savchynskyy:
Partial Optimality by Pruning for MAP-Inference with General Graphical Models. IEEE Trans. Pattern Anal. Mach. Intell. 38(7): 1370-1382 (2016) - [c15]Alexander Kirillov, Dmitrij Schlesinger, Shuai Zheng, Bogdan Savchynskyy, Philip H. S. Torr, Carsten Rother:
Joint Training of Generic CNN-CRF Models with Stochastic Optimization. ACCV (2) 2016: 221-236 - [c14]Alexander Kirillov, Alexander Shekhovtsov, Carsten Rother, Bogdan Savchynskyy:
Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization. NIPS 2016: 334-342 - [i11]Jörg Hendrik Kappes, Paul Swoboda, Bogdan Savchynskyy, Tamir Hazan, Christoph Schnörr:
Multicuts and Perturb & MAP for Probabilistic Graph Clustering. CoRR abs/1601.02088 (2016) - [i10]Alexander Kirillov, Alexander Shekhovtsov, Carsten Rother, Bogdan Savchynskyy:
Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization. CoRR abs/1606.07015 (2016) - [i9]Alexander Kirillov, Evgeny Levinkov, Bjoern Andres, Bogdan Savchynskyy, Carsten Rother:
InstanceCut: from Edges to Instances with MultiCut. CoRR abs/1611.08272 (2016) - [i8]Frank Michel, Alexander Kirillov, Eric Brachmann, Alexander Krull, Stefan Gumhold, Bogdan Savchynskyy, Carsten Rother:
Global Hypothesis Generation for 6D Object Pose Estimation. CoRR abs/1612.02287 (2016) - [i7]Paul Swoboda, Jan Kuske, Bogdan Savchynskyy:
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems. CoRR abs/1612.05460 (2016) - [i6]Paul Swoboda, Carsten Rother, Hassan Abu Alhaija, Dagmar Kainmueller, Bogdan Savchynskyy:
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching. CoRR abs/1612.05476 (2016) - 2015
- [j2]Jörg H. Kappes, Björn Andres, Fred A. Hamprecht, Christoph Schnörr, Sebastian Nowozin, Dhruv Batra, Sungwoong Kim, Bernhard X. Kausler, Thorben Kröger, Jan Lellmann, Nikos Komodakis, Bogdan Savchynskyy, Carsten Rother:
A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems. Int. J. Comput. Vis. 115(2): 155-184 (2015) - [c13]Alexander Shekhovtsov, Paul Swoboda, Bogdan Savchynskyy:
Maximum persistency via iterative relaxed inference with graphical models. CVPR 2015: 521-529 - [c12]Alexander Kirillov, Bogdan Savchynskyy, Dmitrij Schlesinger, Dmitry P. Vetrov, Carsten Rother:
Inferring M-Best Diverse Labelings in a Single One. ICCV 2015: 1814-1822 - [c11]Alexander Kirillov, Dmytro Shlezinger, Dmitry P. Vetrov, Carsten Rother, Bogdan Savchynskyy:
M-Best-Diverse Labelings for Submodular Energies and Beyond. NIPS 2015: 613-621 - [c10]Jörg Hendrik Kappes, Paul Swoboda, Bogdan Savchynskyy, Tamir Hazan, Christoph Schnörr:
Probabilistic Correlation Clustering and Image Partitioning Using Perturbed Multicuts. SSVM 2015: 231-242 - [i5]Alexander Shekhovtsov, Paul Swoboda, Bogdan Savchynskyy:
Maximum Persistency via Iterative Relaxed Inference with Graphical Models. CoRR abs/1508.07902 (2015) - 2014
- [c9]Paul Swoboda, Bogdan Savchynskyy, Jörg H. Kappes, Christoph Schnörr:
Partial Optimality by Pruning for MAP-Inference with General Graphical Models. CVPR 2014: 1170-1177 - [i4]Jörg H. Kappes, Björn Andres, Fred A. Hamprecht, Christoph Schnörr, Sebastian Nowozin, Dhruv Batra, Sungwoong Kim, Bernhard X. Kausler, Thorben Kröger, Jan Lellmann, Nikos Komodakis, Bogdan Savchynskyy, Carsten Rother:
A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems. CoRR abs/1404.0533 (2014) - [i3]Paul Swoboda, Alexander Shekhovtsov, Jörg Hendrik Kappes, Christoph Schnörr, Bogdan Savchynskyy:
Partial Optimality by Pruning for MAP-Inference with General Graphical Models. CoRR abs/1410.6641 (2014) - 2013
- [c8]Bogdan Savchynskyy, Stefan Schmidt:
Getting Feasible Variable Estimates from Infeasible Ones: MRF Local Polytope Study. ICCV Workshops 2013: 267-274 - [c7]Bogdan Savchynskyy, Jörg Hendrik Kappes, Paul Swoboda, Christoph Schnörr:
Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation. NIPS 2013: 1950-1958 - [c6]Paul Swoboda, Bogdan Savchynskyy, Jörg H. Kappes, Christoph Schnörr:
Partial Optimality via Iterative Pruning for the Potts Model. SSVM 2013: 477-488 - 2012
- [c5]Jörg Hendrik Kappes, Bogdan Savchynskyy, Christoph Schnörr:
A bundle approach to efficient MAP-inference by Lagrangian relaxation. CVPR 2012: 1688-1695 - [c4]Bogdan Savchynskyy, Stefan Schmidt, Jörg H. Kappes, Christoph Schnörr:
Efficient MRF Energy Minimization via Adaptive Diminishing Smoothing. UAI 2012: 746-755 - [i2]Bogdan Savchynskyy, Stefan Schmidt:
Getting Feasible Variable Estimates From Infeasible Ones: MRF Local Polytope Study. CoRR abs/1210.4081 (2012) - [i1]Bogdan Savchynskyy, Stefan Schmidt, Jörg Hendrik Kappes, Christoph Schnörr:
Efficient MRF Energy Minimization via Adaptive Diminishing Smoothing. CoRR abs/1210.4906 (2012) - 2011
- [c3]Bogdan Savchynskyy, Jörg H. Kappes, Stefan Schmidt, Christoph Schnörr:
A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling. CVPR 2011: 1817-1823 - [c2]Stefan Schmidt, Bogdan Savchynskyy, Jörg H. Kappes, Christoph Schnörr:
Evaluation of a First-Order Primal-Dual Algorithm for MRF Energy Minimization. EMMCVPR 2011: 89-103
2000 – 2009
- 2008
- [j1]Vojtech Franc, Bogdan Savchynskyy:
Discriminative Learning of Max-Sum Classifiers. J. Mach. Learn. Res. 9: 67-104 (2008) - 2006
- [c1]Bogdan Savchynskyy, Olexander Kamotskyy:
Character templates learning for textual images recognition as an example of learning in structural recognition. DIAL 2006: 88-95
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
