Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michael Schober

dblp:147/4977 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2019
0000-0003-3454-8472ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
3D vision · 70% Trustworthy machine learning · 15% Generative modeling · 15%
Theoretical computer science
2 papers
Mathematical optimization · 100%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › statistical estimation › regression › nonparametric regression
gaussian process regression
0.412019
GOODE: A Gaussian Off-The-Shelf Ordinary Differential Equation Solver · ICML 2019
Mathematical optimization › numerical analysis
ODE solvers
0.412019
GOODE: A Gaussian Off-The-Shelf Ordinary Differential Equation Solver · ICML 2019
Computer vision › 3D vision
depth estimation
0.312017
Dynamic Time-of-Flight · CVPR 2017
Computer vision › 3D vision › range sensing
depth sensing
0.312017
Dynamic Time-of-Flight · CVPR 2017
Computer vision › 3D vision › depth estimation › time-of-flight depth
time-of-flight depth camera
0.312017
Dynamic Time-of-Flight · CVPR 2017
Machine learning › Generative modeling
ODE solvers
0.212014
Probabilistic ODE Solvers with Runge-Kutta Means · NIPS 2014
Machine learning › Trustworthy machine learning › uncertainty estimation
probabilistic numerics
0.212014
Probabilistic ODE Solvers with Runge-Kutta Means · NIPS 2014
Mathematical optimization › numerical analysis
numerical integration
0.212014
Probabilistic ODE Solvers with Runge-Kutta Means · NIPS 2014
Mathematical optimization
convergence analysis
0.112019
GOODE: A Gaussian Off-The-Shelf Ordinary Differential Equation Solver · ICML 2019
Mathematical optimization › continuous optimization
nonlinear optimization
0.112019
GOODE: A Gaussian Off-The-Shelf Ordinary Differential Equation Solver · ICML 2019

Methods — techniques the papers use, named apart from their topics

iterated regression · 0.4gaussian process regression · 0.4gaussian process · 0.4bayesian filtering · 0.4spatiotemporal filtering · 0.3probabilistic motion model · 0.3
YearPublicationVenuePosition
2019 Fast and Robust Shortest Paths on Manifolds Learned from Data
abstract
We propose a fast, simple and robust algorithm for computing shortest paths and distances on Riemannian manifolds learned from data. This amounts to solving a system of ordinary differential equations (ODEs) subject to boundary conditions. Here standard solvers perform poorly because they require well-behaved Jacobians of the ODE, and usually, manifolds learned from data imply unstable and ill-conditioned Jacobians. Instead, we propose a fixed-point iteration scheme for solving the ODE that avoids Jacobians. This enhances the stability of the solver, while reduces the computational cost. In experiments involving both Riemannian metric learning and deep generative models we demonstrate significant improvements in speed and stability over both general-purpose state-of-the-art solvers as well as over specialized solvers.
Georgios Arvanitidis, Søren Hauberg, Philipp Hennig, Michael Schober
AISTATS4
2019 GOODE: A Gaussian Off-The-Shelf Ordinary Differential Equation Solver
abstract
There are two types of ordinary differential equations (ODEs): initial value problems (IVPs) and boundary value problems (BVPs). While many probabilistic numerical methods for the solution of IVPs have been presented to-date, there exists no efficient probabilistic general-purpose solver for nonlinear BVPs. Our method based on iterated Gaussian process (GP) regression returns a GP posterior over the solution of nonlinear ODEs, which provides a meaningful error estimation via its predictive posterior standard deviation. Our solver is fast (typically of quadratic convergence rate) and the theory of convergence can be transferred from prior non-probabilistic work. Our method performs on par with standard codes for an established benchmark of test problems.
David John, Vincent Heuveline, Michael Schober
ICML3
2017 Dynamic Time-of-Flight
abstract
Time-of-flight (TOF) depth cameras provide robust depth inference at low power requirements in a wide variety of consumer and industrial applications. These cameras reconstruct a single depth frame from a given set of infrared (IR) frames captured over a very short exposure period. Operating in this mode the camera essentially forgets all information previously captured - and performs depth inference from scratch for every frame. We challenge this practice and propose using previously captured information when inferring depth. An inherent problem we have to address is camera motion over this longer period of collecting observations. We derive a probabilistic framework combining a simple but robust model of camera and object motion, together with an observation model. This combination allows us to integrate information over multiple frames while remaining robust to rapid changes. Operating the camera in this manner has implications in terms of both computational efficiency and how information should be captured. We address these two issues and demonstrate a realtime TOF system with robust temporal integration that improves depth accuracy over strong baseline methods including adaptive spatio-temporal filters.
Michael Schober, Amit Adam, Omer Yair, Shai Mazor, Sebastian Nowozin
CVPR1
2015 A Random Riemannian Metric for Probabilistic Shortest-Path Tractography
Søren Hauberg, Michael Schober, Matthew G. Liptrot, Philipp Hennig, Aasa Feragen
MICCAI (1)2
2014 Probabilistic Shortest Path Tractography in DTI Using Gaussian Process ODE Solvers
Michael Schober, Niklas Kasenburg, Aasa Feragen, Philipp Hennig, Søren Hauberg
MICCAI (3)1
2014 Probabilistic ODE Solvers with Runge-Kutta Means
Michael Schober, David Duvenaud, Philipp Hennig
NIPS1