Bernhard Schmitzer

Orcid: 0000-0002-6146-8833

According to our database1, Bernhard Schmitzer authored at least 33 papers between 2011 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Linearized Optimal Transport on Manifolds.
SIAM J. Math. Anal., 2024

A Bayesian Model for Dynamic Mass Reconstruction from PET Listmode Data.
SIAM J. Math. Anal., 2024

Flow updates for domain decomposition of entropic optimal transport.
CoRR, 2024

Transfer Operators from Batches of Unpaired Points via Entropic Transport Kernels.
CoRR, 2024

2023
Asymptotic analysis of domain decomposition for optimal transport.
Numerische Mathematik, March, 2023

Manifold learning in Wasserstein space.
CoRR, 2023

Sliced Optimal Partial Transport.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

2022
The Linearized Hellinger-Kantorovich Distance.
SIAM J. Imaging Sci., 2022

Hellinger-Kantorovich barycenter between Dirac measures.
CoRR, 2022

Entropic transfer operators.
CoRR, 2022

2021
Barycenters for the Hellinger-Kantorovich Distance Over ℝ<sup>d</sup>.
SIAM J. Math. Anal., 2021

Domain decomposition for entropy regularized optimal transport.
Numerische Mathematik, 2021

2020
Dynamic Cell Imaging in PET With Optimal Transport Regularization.
IEEE Trans. Medical Imaging, 2020

Computation of optimal transport on discrete metric measure spaces.
Numerische Mathematik, 2020

2019
Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems.
SIAM J. Sci. Comput., 2019

2018
Scaling algorithms for unbalanced optimal transport problems.
Math. Comput., 2018

An Interpolating Distance Between Optimal Transport and Fisher-Rao Metrics.
Found. Comput. Math., 2018

Multi-Scale Algorithms for Optimal Transport.
Proceedings of the 2018 IEEE Data Science Workshop, 2018

2017
Convergence of Entropic Schemes for Optimal Transport and Gradient Flows.
SIAM J. Math. Anal., 2017

Image Labeling by Assignment.
J. Math. Imaging Vis., 2017

A Framework for Wasserstein-1-Type Metrics.
CoRR, 2017

Optimal Transport for Manifold-Valued Images.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2017

2016
A Sparse Multiscale Algorithm for Dense Optimal Transport.
J. Math. Imaging Vis., 2016

A Geometric Approach to Image Labeling.
Proceedings of the Computer Vision - ECCV 2016, 2016

The Assignment Manifold: A Smooth Model for Image Labeling.
Proceedings of the 2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2016

2015
Globally Optimal Joint Image Segmentation and Shape Matching Based on Wasserstein Modes.
J. Math. Imaging Vis., 2015

A sparse algorithm for dense optimal transport.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2015

2014
Isometry invariant shape priors for variational image segmentation.
PhD thesis, 2014

2013
Modelling Convex Shape Priors and Matching Based on the Gromov-Wasserstein Distance.
J. Math. Imaging Vis., 2013

Contour Manifolds and Optimal Transport.
CoRR, 2013

A Hierarchical Approach to Optimal Transport.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2013

Object Segmentation by Shape Matching with Wasserstein Modes.
Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2013

2011
Weakly Convex Coupling Continuous Cuts and Shape Priors.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2011


  Loading...