Header logo is


2018


no image
Direct Sparse Odometry With Rolling Shutter

Schubert, D., Usenko, V., Demmel, N., Stueckler, J., Cremers, D.

European Conference on Computer Vision (ECCV), September 2018, accepted as oral presentation (conference)

ev

[BibTex]

2018


[BibTex]


no image
Deep Virtual Stereo Odometry: Leveraging Deep Depth Prediction for Monocular Direct Sparse Odometry

Yang, N., Wang, R., Stueckler, J., Cremers, D.

European Conference on Computer Vision (ECCV), September 2018, accepted as oral presentation, arXiv 1807.02570 (conference)

ev

link (url) [BibTex]

link (url) [BibTex]


no image
Kernel Recursive ABC: Point Estimation with Intractable Likelihood

Kajihara, T., Kanagawa, M., Yamazaki, K., Fukumizu, K.

Proceedings of the 35th International Conference on Machine Learning, pages: 2405-2414, PMLR, July 2018 (conference)

Abstract
We propose a novel approach to parameter estimation for simulator-based statistical models with intractable likelihood. Our proposed method involves recursive application of kernel ABC and kernel herding to the same observed data. We provide a theoretical explanation regarding why the approach works, showing (for the population setting) that, under a certain assumption, point estimates obtained with this method converge to the true parameter, as recursion proceeds. We have conducted a variety of numerical experiments, including parameter estimation for a real-world pedestrian flow simulator, and show that in most cases our method outperforms existing approaches.

pn

Paper [BibTex]

Paper [BibTex]


no image
The TUM VI Benchmark for Evaluating Visual-Inertial Odometry

Schubert, D., Goll, T., Demmel, N., Usenko, V., Stueckler, J., Cremers, D.

In IEEE International Conference on Intelligent Robots and Systems (IROS), 2018, arXiv:1804.06120 (inproceedings)

ev

[BibTex]

[BibTex]


no image
Variational Network Quantization

Achterhold, J., Koehler, J. M., Schmeink, A., Genewein, T.

In International Conference on Learning Representations , 2018 (inproceedings)

ev

link (url) [BibTex]

link (url) [BibTex]


Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradients
Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradients

Balles, L., Hennig, P.

In Proceedings of the 35th International Conference on Machine Learning (ICML), 2018 (inproceedings) Accepted

Abstract
The ADAM optimizer is exceedingly popular in the deep learning community. Often it works very well, sometimes it doesn't. Why? We interpret ADAM as a combination of two aspects: for each weight, the update direction is determined by the sign of stochastic gradients, whereas the update magnitude is determined by an estimate of their relative variance. We disentangle these two aspects and analyze them in isolation, gaining insight into the mechanisms underlying ADAM. This analysis also extends recent results on adverse effects of ADAM on generalization, isolating the sign aspect as the problematic one. Transferring the variance adaptation to SGD gives rise to a novel method, completing the practitioner's toolbox for problems where ADAM fails.

pn

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


no image
Light field intrinsics with a deep encoder-decoder network

Alperovich, A., Johannsen, O., Strecke, M., Goldluecke, B.

In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2018 (inproceedings)

ev

link (url) [BibTex]

link (url) [BibTex]


no image
Sublabel-accurate convex relaxation with total generalized variation regularization

(DAGM Best Master's Thesis Award)

Strecke, M., Goldluecke, B.

In German Conference on Pattern Recognition (Proc. GCPR), 2018 (inproceedings)

ev

link (url) [BibTex]

link (url) [BibTex]

2017


On the Design of {LQR} Kernels for Efficient Controller Learning
On the Design of LQR Kernels for Efficient Controller Learning

Marco, A., Hennig, P., Schaal, S., Trimpe, S.

Proceedings of the 56th IEEE Annual Conference on Decision and Control (CDC), pages: 5193-5200, IEEE, IEEE Conference on Decision and Control, December 2017 (conference)

Abstract
Finding optimal feedback controllers for nonlinear dynamic systems from data is hard. Recently, Bayesian optimization (BO) has been proposed as a powerful framework for direct controller tuning from experimental trials. For selecting the next query point and finding the global optimum, BO relies on a probabilistic description of the latent objective function, typically a Gaussian process (GP). As is shown herein, GPs with a common kernel choice can, however, lead to poor learning outcomes on standard quadratic control problems. For a first-order system, we construct two kernels that specifically leverage the structure of the well-known Linear Quadratic Regulator (LQR), yet retain the flexibility of Bayesian nonparametric learning. Simulations of uncertain linear and nonlinear systems demonstrate that the LQR kernels yield superior learning performance.

am ics pn

arXiv PDF On the Design of LQR Kernels for Efficient Controller Learning - CDC presentation DOI Project Page [BibTex]

2017


arXiv PDF On the Design of LQR Kernels for Efficient Controller Learning - CDC presentation DOI Project Page [BibTex]


no image
From Monocular SLAM to Autonomous Drone Exploration

von Stumberg, L., Usenko, V., Engel, J., Stueckler, J., Cremers, D.

In European Conference on Mobile Robots (ECMR), September 2017 (inproceedings)

ev

[BibTex]

[BibTex]


Coupling Adaptive Batch Sizes with Learning Rates
Coupling Adaptive Batch Sizes with Learning Rates

Balles, L., Romero, J., Hennig, P.

In Proceedings Conference on Uncertainty in Artificial Intelligence (UAI) 2017, pages: 410-419, (Editors: Gal Elidan and Kristian Kersting), Association for Uncertainty in Artificial Intelligence (AUAI), Conference on Uncertainty in Artificial Intelligence (UAI), August 2017 (inproceedings)

Abstract
Mini-batch stochastic gradient descent and variants thereof have become standard for large-scale empirical risk minimization like the training of neural networks. These methods are usually used with a constant batch size chosen by simple empirical inspection. The batch size significantly influences the behavior of the stochastic optimization algorithm, though, since it determines the variance of the gradient estimates. This variance also changes over the optimization process; when using a constant batch size, stability and convergence is thus often enforced by means of a (manually tuned) decreasing learning rate schedule. We propose a practical method for dynamic batch size adaptation. It estimates the variance of the stochastic gradients and adapts the batch size to decrease the variance proportionally to the value of the objective function, removing the need for the aforementioned learning rate decrease. In contrast to recent related work, our algorithm couples the batch size to the learning rate, directly reflecting the known relationship between the two. On three image classification benchmarks, our batch size adaptation yields faster optimization convergence, while simultaneously simplifying learning rate tuning. A TensorFlow implementation is available.

ps pn

Code link (url) Project Page [BibTex]

Code link (url) Project Page [BibTex]


no image
Dynamic Time-of-Flight

Schober, M., Adam, A., Yair, O., Mazor, S., Nowozin, S.

Proceedings IEEE Conference on Computer Vision and Pattern Recognition (CVPR) 2017, pages: 170-179, IEEE, Piscataway, NJ, USA, IEEE Conference on Computer Vision and Pattern Recognition (CVPR), July 2017 (conference)

ei pn

DOI [BibTex]

DOI [BibTex]


Virtual vs. {R}eal: Trading Off Simulations and Physical Experiments in Reinforcement Learning with {B}ayesian Optimization
Virtual vs. Real: Trading Off Simulations and Physical Experiments in Reinforcement Learning with Bayesian Optimization

Marco, A., Berkenkamp, F., Hennig, P., Schoellig, A. P., Krause, A., Schaal, S., Trimpe, S.

In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pages: 1557-1563, IEEE, Piscataway, NJ, USA, IEEE International Conference on Robotics and Automation (ICRA), May 2017 (inproceedings)

am ics pn

PDF arXiv ICRA 2017 Spotlight presentation Virtual vs. Real - Video explanation DOI Project Page [BibTex]

PDF arXiv ICRA 2017 Spotlight presentation Virtual vs. Real - Video explanation DOI Project Page [BibTex]


Fast Bayesian Optimization of Machine Learning Hyperparameters on Large Datasets
Fast Bayesian Optimization of Machine Learning Hyperparameters on Large Datasets

Klein, A., Falkner, S., Bartels, S., Hennig, P., Hutter, F.

Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS 2017), 54, pages: 528-536, Proceedings of Machine Learning Research, (Editors: Sign, Aarti and Zhu, Jerry), PMLR, April 2017 (conference)

pn

pdf link (url) Project Page [BibTex]

pdf link (url) Project Page [BibTex]


no image
Multi-View Deep Learning for Consistent Semantic Mapping with RGB-D Cameras

Ma, L., Stueckler, J., Kerl, C., Cremers, D.

In IEEE International Conference on Intelligent Robots and Systems (IROS), Vancouver, Canada, 2017 (inproceedings)

ev

[BibTex]

[BibTex]


no image
Accurate depth and normal maps from occlusion-aware focal stack symmetry

Strecke, M., Alperovich, A., Goldluecke, B.

In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017 (inproceedings)

ev

link (url) [BibTex]

link (url) [BibTex]


no image
Semi-Supervised Deep Learning for Monocular Depth Map Prediction

Kuznietsov, Y., Stueckler, J., Leibe, B.

In IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 2017 (inproceedings)

ev

[BibTex]

[BibTex]


no image
Shadow and Specularity Priors for Intrinsic Light Field Decomposition

Alperovich, A., Johannsen, O., Strecke, M., Goldluecke, B.

In Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), 2017 (inproceedings)

ev

link (url) [BibTex]

link (url) [BibTex]


no image
Keyframe-Based Visual-Inertial Online SLAM with Relocalization

Kasyanov, A., Engelmann, F., Stueckler, J., Leibe, B.

In IEEE/RSJ Int. Conference on Intelligent Robots and Systems, IROS, 2017 (inproceedings)

ev

[BibTex]

[BibTex]


no image
SAMP: Shape and Motion Priors for 4D Vehicle Reconstruction

Engelmann, F., Stueckler, J., Leibe, B.

In IEEE Winter Conference on Applications of Computer Vision, WACV, 2017 (inproceedings)

ev

[BibTex]

[BibTex]

2012


Quasi-Newton Methods: A New Direction
Quasi-Newton Methods: A New Direction

Hennig, P., Kiefel, M.

In Proceedings of the 29th International Conference on Machine Learning, pages: 25-32, ICML ’12, (Editors: John Langford and Joelle Pineau), Omnipress, New York, NY, USA, ICML, July 2012 (inproceedings)

Abstract
Four decades after their invention, quasi- Newton methods are still state of the art in unconstrained numerical optimization. Although not usually interpreted thus, these are learning algorithms that fit a local quadratic approximation to the objective function. We show that many, including the most popular, quasi-Newton methods can be interpreted as approximations of Bayesian linear regression under varying prior assumptions. This new notion elucidates some shortcomings of classical algorithms, and lights the way to a novel nonparametric quasi-Newton method, which is able to make more efficient use of available information at computational cost similar to its predecessors.

ei ps pn

website+code pdf link (url) [BibTex]

2012


website+code pdf link (url) [BibTex]


no image
Learning Tracking Control with Forward Models

Bócsi, B., Hennig, P., Csató, L., Peters, J.

In pages: 259 -264, IEEE International Conference on Robotics and Automation (ICRA), May 2012 (inproceedings)

Abstract
Performing task-space tracking control on redundant robot manipulators is a difficult problem. When the physical model of the robot is too complex or not available, standard methods fail and machine learning algorithms can have advantages. We propose an adaptive learning algorithm for tracking control of underactuated or non-rigid robots where the physical model of the robot is unavailable. The control method is based on the fact that forward models are relatively straightforward to learn and local inversions can be obtained via local optimization. We use sparse online Gaussian process inference to obtain a flexible probabilistic forward model and second order optimization to find the inverse mapping. Physical experiments indicate that this approach can outperform state-of-the-art tracking control algorithms in this context.

ei pn

PDF Web DOI [BibTex]

PDF Web DOI [BibTex]


no image
Approximate Gaussian Integration using Expectation Propagation

Cunningham, J., Hennig, P., Lacoste-Julien, S.

In pages: 1-11, -, January 2012 (inproceedings) Submitted

Abstract
While Gaussian probability densities are omnipresent in applied mathematics, Gaussian cumulative probabilities are hard to calculate in any but the univariate case. We offer here an empirical study of the utility of Expectation Propagation (EP) as an approximate integration method for this problem. For rectangular integration regions, the approximation is highly accurate. We also extend the derivations to the more general case of polyhedral integration regions. However, we find that in this polyhedral case, EP's answer, though often accurate, can be almost arbitrarily wrong. These unexpected results elucidate an interesting and non-obvious feature of EP not yet studied in detail, both for the problem of Gaussian probabilities and for EP more generally.

ei pn

Web [BibTex]

Web [BibTex]


no image
Kernel Topic Models

Hennig, P., Stern, D., Herbrich, R., Graepel, T.

In Fifteenth International Conference on Artificial Intelligence and Statistics, 22, pages: 511-519, JMLR Proceedings, (Editors: Lawrence, N. D. and Girolami, M.), JMLR.org, AISTATS , 2012 (inproceedings)

Abstract
Latent Dirichlet Allocation models discrete data as a mixture of discrete distributions, using Dirichlet beliefs over the mixture weights. We study a variation of this concept, in which the documents' mixture weight beliefs are replaced with squashed Gaussian distributions. This allows documents to be associated with elements of a Hilbert space, admitting kernel topic models (KTM), modelling temporal, spatial, hierarchical, social and other structure between documents. The main challenge is efficient approximate inference on the latent Gaussian. We present an approximate algorithm cast around a Laplace approximation in a transformed basis. The KTM can also be interpreted as a type of Gaussian process latent variable model, or as a topic model conditional on document features, uncovering links between earlier work in these areas.

ei pn

PDF Web [BibTex]

PDF Web [BibTex]


no image
Model Learning and Real-Time Tracking Using Multi-Resolution Surfel Maps

Stueckler, J., Behnke, S.

Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2012 (conference)

ev

link (url) [BibTex]

link (url) [BibTex]


no image
Bayesian calibration of the hand-eye kinematics of an anthropomorphic robot

Hubert, U., Stueckler, J., Behnke, S.

In Proc. of the 12th IEEE-RAS Int. Conf. on Humanoid Robots (Humanoids), pages: 618-624, November 2012 (inproceedings)

ev

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Shape-Primitive Based Object Recognition and Grasping

Nieuwenhuisen, M., Stueckler, J., Berner, A., Klein, R., Behnke, S.

In Proc. of ROBOTIK, VDE-Verlag, 2012 (inproceedings)

ev

link (url) [BibTex]

link (url) [BibTex]


no image
Semantic mapping using object-class segmentation of RGB-D images

Stueckler, J., Biresev, N., Behnke, S.

In Proc. of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (IROS), pages: 3005-3010, October 2012 (inproceedings)

ev

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Efficient Mobile Robot Navigation using 3D Surfel Grid Maps

Kläß, J., Stueckler, J., Behnke, S.

In Proc. of ROBOTIK, VDE-Verlag, 2012 (inproceedings)

ev

link (url) [BibTex]

link (url) [BibTex]


no image
Integrating depth and color cues for dense multi-resolution scene mapping using RGB-D cameras

Stueckler, J., Behnke, S.

In Proc. of the IEEE Int. Conf. on Multisensor Fusion and Integration for Intelligent Systems (MFI), pages: 162-167, sep 2012 (inproceedings)

ev

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
SURE: Surface Entropy for Distinctive 3D Features

Fiolka, T., Stueckler, J., Klein, D. A., Schulz, D., Behnke, S.

In Proc. of Spatial Cognition, 2012 (inproceedings)

ev

link (url) [BibTex]

link (url) [BibTex]


no image
Robust Real-Time Registration of RGB-D Images using Multi-Resolution Surfel Representations

Stueckler, J., Behnke, S.

In Proc. of ROBOTIK, VDE-Verlag, 2012 (inproceedings)

ev

link (url) [BibTex]

link (url) [BibTex]


no image
Adjustable autonomy for mobile teleoperation of personal service robots

Muszynski, S., Stueckler, J., Behnke, S.

In Proc. of the IEEE Int. Symp. on Robot and Human Interactive Communication, pages: 933-940, sep 2012 (inproceedings)

ev

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Adaptive Multi-cue 3D Tracking of Arbitrary Objects

Garcia, G. M., Klein, D. A., Stueckler, J., Frintrop, S., Cremers, A. B.

In DAGM/OAGM Symposium, 7476, pages: 357-366, Lecture Notes in Computer Science, Springer, 2012 (inproceedings)

ev

[BibTex]

[BibTex]

2009


no image
Bayesian Quadratic Reinforcement Learning

Hennig, P., Stern, D., Graepel, T.

NIPS Workshop on Probabilistic Approaches for Robotics and Control, December 2009 (poster)

ei pn

PDF Web [BibTex]

2009


PDF Web [BibTex]


no image
Integrating indoor mobility, object manipulation, and intuitive interaction for domestic service tasks

Stueckler, J., Behnke, S.

In Proc. of the IEEE-RAS Int. Conf. on Humanoid Robots (Humanoids), pages: 506-513, December 2009 (inproceedings)

ev

link (url) DOI [BibTex]

link (url) DOI [BibTex]


no image
Dynamaid, an Anthropomorphic Robot for Research on Domestic Service Applications

Stueckler, J., Schreiber, M., Behnke, S.

In Proc. of the European Conference on Mobile Robots (ECMR), pages: 87-92, 2009 (inproceedings)

ev

link (url) [BibTex]

link (url) [BibTex]