Header logo is


2019


no image
Data scarcity, robustness and extreme multi-label classification

Babbar, R., Schölkopf, B.

Machine Learning, Special Issue of the ECML PKDD 2019 Journal Track, March 2019 (article)

ei

DOI [BibTex]

2019


DOI [BibTex]


no image
Enhancing Human Learning via Spaced Repetition Optimization

Tabibian, B., Upadhyay, U., De, A., Zarezade, A., Schölkopf, B., Gomez Rodriguez, M.

Proceedings of the National Academy of Sciences, 2019, PNAS published ahead of print January 22, 2019 (article)

ei

DOI [BibTex]

DOI [BibTex]


Thumb xl screenshot 2019 03 25 at 14.29.22
Learning to Control Highly Accelerated Ballistic Movements on Muscular Robots

Büchler, D., Calandra, R., Peters, J.

2019 (article) Submitted

Abstract
High-speed and high-acceleration movements are inherently hard to control. Applying learning to the control of such motions on anthropomorphic robot arms can improve the accuracy of the control but might damage the system. The inherent exploration of learning approaches can lead to instabilities and the robot reaching joint limits at high speeds. Having hardware that enables safe exploration of high-speed and high-acceleration movements is therefore desirable. To address this issue, we propose to use robots actuated by Pneumatic Artificial Muscles (PAMs). In this paper, we present a four degrees of freedom (DoFs) robot arm that reaches high joint angle accelerations of up to 28000 °/s^2 while avoiding dangerous joint limits thanks to the antagonistic actuation and limits on the air pressure ranges. With this robot arm, we are able to tune control parameters using Bayesian optimization directly on the hardware without additional safety considerations. The achieved tracking performance on a fast trajectory exceeds previous results on comparable PAM-driven robots. We also show that our system can be controlled well on slow trajectories with PID controllers due to careful construction considerations such as minimal bending of cables, lightweight kinematics and minimal contact between PAMs and PAMs with the links. Finally, we propose a novel technique to control the the co-contraction of antagonistic muscle pairs. Experimental results illustrate that choosing the optimal co-contraction level is vital to reach better tracking performance. Through the use of PAM-driven robots and learning, we do a small step towards the future development of robots capable of more human-like motions.

ei

Arxiv Video [BibTex]


no image
Inferring causation from time series with perspectives in Earth system sciences

Runge, J., Bathiany, S., Bollt, E., Camps-Valls, G., Coumou, D., Deyle, E., Glymour, C., Kretschmer, M., Mahecha, M., van Nes, E., Peters, J., Quax, R., Reichstein, M., Scheffer, M. S. B., Spirtes, P., Sugihara, G., Sun, J., Zhang, K., Zscheischler, J.

Nature Communications, 2019 (article) In revision

ei

[BibTex]

[BibTex]

2018


no image
Parallel and functionally segregated processing of task phase and conscious content in the prefrontal cortex

Kapoor, V., Besserve, M., Logothetis, N. K., Panagiotaropoulos, T. I.

Communications Biology, 1(215):1-12, December 2018 (article)

ei

link (url) DOI [BibTex]

2018


link (url) DOI [BibTex]


Thumb xl stco paper figure11
Probabilistic Solutions To Ordinary Differential Equations As Non-Linear Bayesian Filtering: A New Perspective

Tronarp, F., Kersting, H., Särkkä, S., Hennig, P.

ArXiv preprint 2018, arXiv:1810.03440 [stat.ME], October 2018 (article)

Abstract
We formulate probabilistic numerical approximations to solutions of ordinary differential equations (ODEs) as problems in Gaussian process (GP) regression with non-linear measurement functions. This is achieved by defining the measurement sequence to consists of the observations of the difference between the derivative of the GP and the vector field evaluated at the GP---which are all identically zero at the solution of the ODE. When the GP has a state-space representation, the problem can be reduced to a Bayesian state estimation problem and all widely-used approximations to the Bayesian filtering and smoothing problems become applicable. Furthermore, all previous GP-based ODE solvers, which were formulated in terms of generating synthetic measurements of the vector field, come out as specific approximations. We derive novel solvers, both Gaussian and non-Gaussian, from the Bayesian state estimation problem posed in this paper and compare them with other probabilistic solvers in illustrative experiments.

pn

link (url) Project Page [BibTex]


Thumb xl screen shot 2019 01 07 at 12.05.00
Control of Musculoskeletal Systems using Learned Dynamics Models

Büchler, D., Calandra, R., Schölkopf, B., Peters, J.

IEEE Robotics and Automation Letters, Robotics and Automation Letters, 3(4):3161-3168, IEEE, 2018 (article)

Abstract
Controlling musculoskeletal systems, especially robots actuated by pneumatic artificial muscles, is a challenging task due to nonlinearities, hysteresis effects, massive actuator de- lay and unobservable dependencies such as temperature. Despite such difficulties, muscular systems offer many beneficial prop- erties to achieve human-comparable performance in uncertain and fast-changing tasks. For example, muscles are backdrivable and provide variable stiffness while offering high forces to reach high accelerations. In addition, the embodied intelligence deriving from the compliance might reduce the control demands for specific tasks. In this paper, we address the problem of how to accurately control musculoskeletal robots. To address this issue, we propose to learn probabilistic forward dynamics models using Gaussian processes and, subsequently, to employ these models for control. However, Gaussian processes dynamics models cannot be set-up for our musculoskeletal robot as for traditional motor- driven robots because of unclear state composition etc. We hence empirically study and discuss in detail how to tune these approaches to complex musculoskeletal robots and their specific challenges. Moreover, we show that our model can be used to accurately control an antagonistic pair of pneumatic artificial muscles for a trajectory tracking task while considering only one- step-ahead predictions of the forward model and incorporating model uncertainty.

ei

RAL18final link (url) DOI [BibTex]

RAL18final link (url) DOI [BibTex]


no image
Convergence Rates of Gaussian ODE Filters

Kersting, H., Sullivan, T. J., Hennig, P.

arXiv preprint 2018, arXiv:1807.09737 [math.NA], July 2018 (article)

Abstract
A recently-introduced class of probabilistic (uncertainty-aware) solvers for ordinary differential equations (ODEs) applies Gaussian (Kalman) filtering to initial value problems. These methods model the true solution $x$ and its first $q$ derivatives a priori as a Gauss--Markov process $\boldsymbol{X}$, which is then iteratively conditioned on information about $\dot{x}$. We prove worst-case local convergence rates of order $h^{q+1}$ for a wide range of versions of this Gaussian ODE filter, as well as global convergence rates of order $h^q$ in the case of $q=1$ and an integrated Brownian motion prior, and analyse how inaccurate information on $\dot{x}$ coming from approximate evaluations of $f$ affects these rates. Moreover, we present explicit formulas for the steady states and show that the posterior confidence intervals are well calibrated in all considered cases that exhibit global convergence---in the sense that they globally contract at the same rate as the truncation error.

pn

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


no image
Infinite Factorial Finite State Machine for Blind Multiuser Channel Estimation

Ruiz, F. J. R., Valera, I., Svensson, L., Perez-Cruz, F.

IEEE Transactions on Cognitive Communications and Networking, 4(2):177-191, June 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Assisting Movement Training and Execution With Visual and Haptic Feedback

Ewerton, M., Rother, D., Weimar, J., Kollegger, G., Wiemeyer, J., Peters, J., Maeda, G.

Frontiers in Neurorobotics, 12, May 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


Thumb xl screenshot 2018 05 18 16 38 40
Learning 3D Shape Completion under Weak Supervision

Stutz, D., Geiger, A.

Arxiv, May 2018 (article)

Abstract
We address the problem of 3D shape completion from sparse and noisy point clouds, a fundamental problem in computer vision and robotics. Recent approaches are either data-driven or learning-based: Data-driven approaches rely on a shape model whose parameters are optimized to fit the observations; Learning-based approaches, in contrast, avoid the expensive optimization step by learning to directly predict complete shapes from incomplete observations in a fully-supervised setting. However, full supervision is often not available in practice. In this work, we propose a weakly-supervised learning-based approach to 3D shape completion which neither requires slow optimization nor direct supervision. While we also learn a shape prior on synthetic data, we amortize, i.e., learn, maximum likelihood fitting using deep neural networks resulting in efficient shape completion without sacrificing accuracy. On synthetic benchmarks based on ShapeNet and ModelNet as well as on real robotics data from KITTI and Kinect, we demonstrate that the proposed amortized maximum likelihood approach is able to compete with fully supervised baselines and outperforms data-driven approaches, while requiring less supervision and being significantly faster.

avg

PDF Project Page Project Page [BibTex]


no image
Mixture of Attractors: A Novel Movement Primitive Representation for Learning Motor Skills From Demonstrations

Manschitz, S., Gienger, M., Kober, J., Peters, J.

IEEE Robotics and Automation Letters, 3(2):926-933, April 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Probabilistic movement primitives under unknown system dynamics

Paraschos, A., Rueckert, E., Peters, J., Neumann, G.

Advanced Robotics, 32(6):297-310, April 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
An Algorithmic Perspective on Imitation Learning

Osa, T., Pajarinen, J., Neumann, G., Bagnell, J., Abbeel, P., Peters, J.

Foundations and Trends in Robotics, 7(1-2):1-179, March 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Using Probabilistic Movement Primitives in Robotics

Paraschos, A., Daniel, C., Peters, J., Neumann, G.

Autonomous Robots, 42(3):529-551, March 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
A kernel-based approach to learning contact distributions for robot manipulation tasks

Kroemer, O., Leischnig, S., Luettgen, S., Peters, J.

Autonomous Robots, 42(3):581-600, March 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Approximate Value Iteration Based on Numerical Quadrature

Vinogradska, J., Bischoff, B., Peters, J.

IEEE Robotics and Automation Letters, 3(2):1330-1337, January 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Biomimetic Tactile Sensors and Signal Processing with Spike Trains: A Review

Yi, Z., Zhang, Y., Peters, J.

Sensors and Actuators A: Physical, 269, pages: 41-52, January 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Gaussian Processes and Kernel Methods: A Review on Connections and Equivalences

Kanagawa, M., Hennig, P., Sejdinovic, D., Sriperumbudur, B. K.

Arxiv e-prints, arXiv:1805.08845v1 [stat.ML], 2018 (article)

Abstract
This paper is an attempt to bridge the conceptual gaps between researchers working on the two widely used approaches based on positive definite kernels: Bayesian learning or inference using Gaussian processes on the one side, and frequentist kernel methods based on reproducing kernel Hilbert spaces on the other. It is widely known in machine learning that these two formalisms are closely related; for instance, the estimator of kernel ridge regression is identical to the posterior mean of Gaussian process regression. However, they have been studied and developed almost independently by two essentially separate communities, and this makes it difficult to seamlessly transfer results between them. Our aim is to overcome this potential difficulty. To this end, we review several old and new results and concepts from either side, and juxtapose algorithmic quantities from each framework to highlight close similarities. We also provide discussions on subtle philosophical and theoretical differences between the two approaches.

pn

arXiv [BibTex]

arXiv [BibTex]


no image
Design and Analysis of the NIPS 2016 Review Process

Shah*, N., Tabibian*, B., Muandet, K., Guyon, I., von Luxburg, U.

Journal of Machine Learning Research, 19(49):1-34, 2018, *equal contribution (article)

ei slt

arXiv link (url) [BibTex]

arXiv link (url) [BibTex]


no image
Intrinsic Motivation and Mental Replay enable Efficient Online Adaptation in Stochastic Recurrent Networks

Tanneberg, D., Peters, J., Rueckert, E.

Neural Networks, 109, pages: 67-80, 2018 (article)

ei

link (url) DOI [BibTex]


no image
A Flexible Approach for Fair Classification

Zafar, M. B., Valera, I., Gomez Rodriguez, M., Gummadi, K.

Journal of Machine Learning, 2018 (article) Accepted

ei

[BibTex]

[BibTex]


no image
Adaptation and Robust Learning of Probabilistic Movement Primitives

Gomez-Gonzalez, S., Neumann, G., Schölkopf, B., Peters, J.

IEEE Transactions on Robotics, 2018 (article) In revision

ei

arXiv [BibTex]

arXiv [BibTex]


no image
Does universal controllability of physical systems prohibit thermodynamic cycles?

Janzing, D., Wocjan, P.

Open Systems and Information Dynamics, 25(3):1850016, 2018 (article)

ei

PDF DOI [BibTex]

PDF DOI [BibTex]


no image
Learning Causality and Causality-Related Learning: Some Recent Progress

Zhang, K., Schölkopf, B., Spirtes, P., Glymour, C.

National Science Review, 5(1):26-29, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


Thumb xl hassan teaser paper
Augmented Reality Meets Computer Vision: Efficient Data Generation for Urban Driving Scenes

Alhaija, H., Mustikovela, S., Mescheder, L., Geiger, A., Rother, C.

International Journal of Computer Vision (IJCV), 2018, 2018 (article)

Abstract
The success of deep learning in computer vision is based on the availability of large annotated datasets. To lower the need for hand labeled images, virtually rendered 3D worlds have recently gained popularity. Unfortunately, creating realistic 3D content is challenging on its own and requires significant human effort. In this work, we propose an alternative paradigm which combines real and synthetic data for learning semantic instance segmentation and object detection models. Exploiting the fact that not all aspects of the scene are equally important for this task, we propose to augment real-world imagery with virtual objects of the target category. Capturing real-world images at large scale is easy and cheap, and directly provides real background appearances without the need for creating complex 3D models of the environment. We present an efficient procedure to augment these images with virtual objects. In contrast to modeling complete 3D environments, our data augmentation approach requires only a few user interactions in combination with 3D models of the target object category. Leveraging our approach, we introduce a novel dataset of augmented urban driving scenes with 360 degree images that are used as environment maps to create realistic lighting and reflections on rendered objects. We analyze the significance of realistic object placement by comparing manual placement by humans to automatic methods based on semantic scene analysis. This allows us to create composite images which exhibit both realistic background appearance as well as a large number of complex object arrangements. Through an extensive set of experiments, we conclude the right set of parameters to produce augmented data which can maximally enhance the performance of instance segmentation models. Further, we demonstrate the utility of the proposed approach on training standard deep models for semantic instance segmentation and object detection of cars in outdoor driving scenarios. We test the models trained on our augmented data on the KITTI 2015 dataset, which we have annotated with pixel-accurate ground truth, and on the Cityscapes dataset. Our experiments demonstrate that the models trained on augmented imagery generalize better than those trained on fully synthetic data or models trained on limited amounts of annotated real data.

avg

pdf Project Page [BibTex]

pdf Project Page [BibTex]


no image
Online optimal trajectory generation for robot table tennis

Koc, O., Maeda, G., Peters, J.

Robotics and Autonomous Systems, 105, pages: 121-137, 2018 (article)

ei

PDF link (url) DOI [BibTex]

PDF link (url) DOI [BibTex]


no image
Counterfactual Mean Embedding: A Kernel Method for Nonparametric Causal Inference

Muandet, K., Kanagawa, M., Saengkyongam, S., Marukata, S.

Arxiv e-prints, arXiv:1805.08845v1 [stat.ML], 2018 (article)

Abstract
This paper introduces a novel Hilbert space representation of a counterfactual distribution---called counterfactual mean embedding (CME)---with applications in nonparametric causal inference. Counterfactual prediction has become an ubiquitous tool in machine learning applications, such as online advertisement, recommendation systems, and medical diagnosis, whose performance relies on certain interventions. To infer the outcomes of such interventions, we propose to embed the associated counterfactual distribution into a reproducing kernel Hilbert space (RKHS) endowed with a positive definite kernel. Under appropriate assumptions, the CME allows us to perform causal inference over the entire landscape of the counterfactual distribution. The CME can be estimated consistently from observational data without requiring any parametric assumption about the underlying distributions. We also derive a rate of convergence which depends on the smoothness of the conditional mean and the Radon-Nikodym derivative of the underlying marginal distributions. Our framework can deal with not only real-valued outcome, but potentially also more complex and structured outcomes such as images, sequences, and graphs. Lastly, our experimental results on off-policy evaluation tasks demonstrate the advantages of the proposed estimator.

ei pn

arXiv [BibTex]

arXiv [BibTex]


no image
Model-based Kernel Sum Rule: Kernel Bayesian Inference with Probabilistic Models

Nishiyama, Y., Kanagawa, M., Gretton, A., Fukumizu, K.

Arxiv e-prints, arXiv:1409.5178v2 [stat.ML], 2018 (article)

Abstract
Kernel Bayesian inference is a powerful nonparametric approach to performing Bayesian inference in reproducing kernel Hilbert spaces or feature spaces. In this approach, kernel means are estimated instead of probability distributions, and these estimates can be used for subsequent probabilistic operations (as for inference in graphical models) or in computing the expectations of smooth functions, for instance. Various algorithms for kernel Bayesian inference have been obtained by combining basic rules such as the kernel sum rule (KSR), kernel chain rule, kernel product rule and kernel Bayes' rule. However, the current framework only deals with fully nonparametric inference (i.e., all conditional relations are learned nonparametrically), and it does not allow for flexible combinations of nonparametric and parametric inference, which are practically important. Our contribution is in providing a novel technique to realize such combinations. We introduce a new KSR referred to as the model-based KSR (Mb-KSR), which employs the sum rule in feature spaces under a parametric setting. Incorporating the Mb-KSR into existing kernel Bayesian framework provides a richer framework for hybrid (nonparametric and parametric) kernel Bayesian inference. As a practical application, we propose a novel filtering algorithm for state space models based on the Mb-KSR, which combines the nonparametric learning of an observation process using kernel mean embedding and the additive Gaussian noise model for a state transition process. While we focus on additive Gaussian noise models in this study, the idea can be extended to other noise models, such as the Cauchy and alpha-stable noise models.

pn

arXiv [BibTex]

arXiv [BibTex]


no image
Hierarchical Reinforcement Learning of Multiple Grasping Strategies with Human Instructions

Osa, T., Peters, J., Neumann, G.

Advanced Robotics, 32(18):955-968, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


Thumb xl hp teaser
A probabilistic model for the numerical solution of initial value problems

Schober, M., Särkkä, S., Philipp Hennig,

Statistics and Computing, Springer US, 2018 (article)

Abstract
We study connections between ordinary differential equation (ODE) solvers and probabilistic regression methods in statistics. We provide a new view of probabilistic ODE solvers as active inference agents operating on stochastic differential equation models that estimate the unknown initial value problem (IVP) solution from approximate observations of the solution derivative, as provided by the ODE dynamics. Adding to this picture, we show that several multistep methods of Nordsieck form can be recast as Kalman filtering on q-times integrated Wiener processes. Doing so provides a family of IVP solvers that return a Gaussian posterior measure, rather than a point estimate. We show that some such methods have low computational overhead, nontrivial convergence order, and that the posterior has a calibrated concentration rate. Additionally, we suggest a step size adaptation algorithm which completes the proposed method to a practically useful implementation, which we experimentally evaluate using a representative set of standard codes in the DETEST benchmark set.

pn

PDF Code DOI Project Page [BibTex]


no image
Case series: Slowing alpha rhythm in late-stage ALS patients

Hohmann, M. R., Fomina, T., Jayaram, V., Emde, T., Just, J., Synofzik, M., Schölkopf, B., Schöls, L., Grosse-Wentrup, M.

Clinical Neurophysiology, 129(2):406-408, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Inverse Reinforcement Learning via Nonparametric Spatio-Temporal Subgoal Modeling

Šošić, A., Rueckert, E., Peters, J., Zoubir, A., Koeppl, H.

Journal of Machine Learning Research, 19(69):1-45, 2018 (article)

ei

link (url) [BibTex]

link (url) [BibTex]


no image
Grip Stabilization of Novel Objects using Slip Prediction

Veiga, F., Peters, J., Hermans, T.

IEEE Transactions on Haptics, 2018 (article) In press

ei

DOI [BibTex]

DOI [BibTex]


no image
Electrophysiological correlates of neurodegeneration in motor and non-motor brain regions in amyotrophic lateral sclerosis—implications for brain–computer interfacing

Kellmeyer, P., Grosse-Wentrup, M., Schulze-Bonhage, A., Ziemann, U., Ball, T.

Journal of Neural Engineering, 15(4):041003, IOP Publishing, 2018 (article)

ei

link (url) [BibTex]

link (url) [BibTex]


no image
Autofocusing-based phase correction

Loktyushin, A., Ehses, P., Schölkopf, B., Scheffler, K.

Magnetic Resonance in Medicine, 80(3):958-968, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Prediction of Glucose Tolerance without an Oral Glucose Tolerance Test

Babbar, R., Heni, M., Peter, A., Hrabě de Angelis, M., Häring, H., Fritsche, A., Preissl, H., Schölkopf, B., Wagner, R.

Frontiers in Endocrinology, 9, pages: 82, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Invariant Models for Causal Transfer Learning

Rojas-Carulla, M., Schölkopf, B., Turner, R., Peters, J.

Journal of Machine Learning Research, 19(36):1-34, 2018 (article)

ei

link (url) [BibTex]

link (url) [BibTex]


no image
MOABB: Trustworthy algorithm benchmarking for BCIs

Jayaram, V., Barachant, A.

Journal of Neural Engineering, 15(6):066011, 2018 (article)

ei

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
f-Divergence constrained policy improvement

Belousov, B., Peters, J.

Journal of Machine Learning Research, 2018 (article) Submitted

ei

[BibTex]

[BibTex]


no image
Phylogenetic convolutional neural networks in metagenomics

Fioravanti*, D., Giarratano*, Y., Maggio*, V., Agostinelli, C., Chierici, M., Jurman, G., Furlanello, C.

BMC Bioinformatics, 19(2):49 pages, 2018, *equal contribution (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Food specific inhibitory control under negative mood in binge-eating disorder: Evidence from a multimethod approach

Leehr, E. J., Schag, K., Dresler, T., Grosse-Wentrup, M., Hautzinger, M., Fallgatter, A. J., Zipfel, S., Giel, K. E., Ehlis, A.

International Journal of Eating Disorders, 51(2):112-123, Wiley Online Library, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Linking imaging to omics utilizing image-guided tissue extraction

Disselhorst, J. A., Krueger, M. A., Ud-Dean, S. M. M., Bezrukov, I., Jarboui, M. A., Trautwein, C., Traube, A., Spindler, C., Cotton, J. M., Leibfritz, D., Pichler, B. J.

Proceedings of the National Academy of Sciences, 115(13):E2980-E2987, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Kernel-based tests for joint independence

Pfister, N., Bühlmann, P., Schölkopf, B., Peters, J.

Journal of the Royal Statistical Society: Series B (Statistical Methodology), 80(1):5-31, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


Thumb xl stutz
Learning 3D Shape Completion under Weak Supervision

Stutz, D., Geiger, A.

International Journal of Computer Vision (IJCV), 2018, 2018 (article)

Abstract
We address the problem of 3D shape completion from sparse and noisy point clouds, a fundamental problem in computer vision and robotics. Recent approaches are either data-driven or learning-based: Data-driven approaches rely on a shape model whose parameters are optimized to fit the observations; Learning-based approaches, in contrast, avoid the expensive optimization step by learning to directly predict complete shapes from incomplete observations in a fully-supervised setting. However, full supervision is often not available in practice. In this work, we propose a weakly-supervised learning-based approach to 3D shape completion which neither requires slow optimization nor direct supervision. While we also learn a shape prior on synthetic data, we amortize, i.e., learn, maximum likelihood fitting using deep neural networks resulting in efficient shape completion without sacrificing accuracy. On synthetic benchmarks based on ShapeNet and ModelNet as well as on real robotics data from KITTI and Kinect, we demonstrate that the proposed amortized maximum likelihood approach is able to compete with a fully supervised baseline and outperforms the data-driven approach of Engelmann et al., while requiring less supervision and being significantly faster.

avg

pdf Project Page [BibTex]

pdf Project Page [BibTex]


no image
Discriminative Transfer Learning for General Image Restoration

Xiao, L., Heide, F., Heidrich, W., Schölkopf, B., Hirsch, M.

IEEE Transactions on Image Processing, 27(8):4091-4104, 2018 (article)

ei

DOI [BibTex]

DOI [BibTex]


no image
Dissecting the synapse- and frequency-dependent network mechanisms of in vivo hippocampal sharp wave-ripples

Ramirez-Villegas, J. F., Willeke, K. F., Logothetis, N. K., Besserve, M.

Neuron, 100(5):1224-1240, 2018 (article)

ei

link (url) DOI [BibTex]

link (url) DOI [BibTex]