#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2005

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Dirk Gehrig, Peter Krauthausen, +4 authors Rainer Stiefelhagen
- 2011 IEEE/RSJ International Conference on…
- 2011

In this paper, a multi-level approach to intention, activity, and motion recognition for a humanoid robot is proposed. Our system processes images from a monocular camera and combines this information with domain knowledge. The recognition works on-line and in real-time, it is independent of the test person, but limited to predefined view-points. Main… (More)

- Frank Dellaert, Alexander Kipp, Peter Krauthausen
- AAAI
- 2005

QR factorization is most often used as a “black box” algorithm, but is in fact an elegant computation on a factor graph. By computing a rooted clique tree on this graph, the computation can be parallelized across subtrees, which forms the basis of so-called multifrontal QR methods. By judiciously choosing the order in which variables are eliminated in the… (More)

- SAM, Peter Krauthausen, Frank Dellaert, Alexander Kipp
- 2006

The problem of creating a map given only the erroneous odometry and feature measurements and locating the own position in this environment is known in the literature as the Simultaneous Localization and Mapping (SLAM) problem. In this paper we investigate how a Nested Dissection Ordering scheme can improve the the performance of a recently proposed Square… (More)

- Peter Krauthausen, Uwe D. Hanebeck
- MFI
- 2010

In this paper, a distance-based method for both multivariate non-parametric density and conditional density estimation is proposed. The contributions are the formulation of both density estimation problems as weight optimization problems for Gaussian mixtures centered about samples with identical parameters. Furthermore, the minimization is based on the… (More)

- Peter Krauthausen, Uwe D. Hanebeck
- 2009 12th International Conference on Information…
- 2009

In this paper, a novel probabilistic approach to intention recognition for partial-order plans is proposed. The key idea is to exploit independences between subplans to substantially reduce the state space sizes in the compiled Dynamic Bayesian Networks. This makes inference more efficient. The main contributions are the computationally exploitable… (More)

- Patrick Ruoff, Peter Krauthausen, Uwe D. Hanebeck
- 14th International Conference on Information…
- 2011

Since the advent of Monte-Carlo particle filtering, particle representations of densities have become increasingly popular due to their flexibility and implicit adaptive resolution. In this paper, an algorithm for the multiplication of a systematic Dirac mixture (DM) approximation with a continuous likelihood function is presented, which applies a… (More)

- Peter Krauthausen, Uwe D. Hanebeck
- KI
- 2010

Recognizing human intentions is part of the decision process in many technical devices. In order to achieve natural interaction, the required estimation quality and the used computation time need to be balanced. This becomes challenging, if the number of sensors is high and measurement systems are complex. In this paper, a model predictive approach to this… (More)

- Peter Krauthausen, Marco F. Huber, Uwe D. Hanebeck
- 2010 13th International Conference on Information…
- 2010

A non-parametric conditional density estimation algorithm for nonlinear stochastic dynamic systems is proposed. The contributions are a novel support vector regression for estimating conditional densities, modeled by Gaussian mixture densities, and an algorithm based on cross-validation for automatically determining hyper-parameters for the regression. The… (More)

- Peter Krauthausen, Alexander Kipp, Frank Dellaert
- Robotics: Science and Systems
- 2006

The computational complexity of SLAM is dominated by the cost of factorizing a matrix derived from the measurements into a square root form, which has cubic complexity in the worst case. However, the matrices associated with the full SLAM problem are typically very sparse, as opposed to the dense problems one obtains in a filtering context. Hence much… (More)

Many information fusion tasks involve the processing of Gaussian mixtures with simple underlying shape, but many components. This paper addresses the problem of reducing the number of components, allowing for faster density processing. The proposed approach is based on identifying components irrelevant for the overall density’s shape by means of the… (More)