Learn More
— This paper addresses the problem of large scale terrain modeling for a mobile robot. Building a model of large scale terrain data that can adequately handle uncertainty and incompleteness in a statistically sound way is a very challenging problem. This work proposes the use of Gaussian Processes as models of large scale terrain. The proposed model(More)
— Generating rich representations of environments can significantly improve the autonomy of mobile robotics. In this paper we introduce a novel approach to building object-type maps of outdoor environments. Our approach uses conditional random fields (CRF) to jointly classify laser returns in a 2D scan map into seven object types (car, wall, tree trunk,(More)
Bayesian Optimisation has received considerable attention in recent years as a general methodology to find the maximum of costly-to-evaluate objective functions. Most existing BO work fo-cuses on where to gather a set of samples without giving special consideration to the sampling sequence, or the costs or constraints associated with that sequence. However,(More)
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples. The introduction of constraints on induced width leads to realistic networks but requires new techniques. A tool that generates random networks is presented and applications are(More)
— Place recognition is a challenging task in any SLAM system. Algorithms based on visual appearance are becoming popular to detect locations already visited, also known as loop closures, because cameras are easily available and provide rich scene detail. These algorithms typically result in pairs of images considered depicting the same location. To avoid(More)
This paper investigates the possibility of recognising individual persons from their walking gait using three-dimensional 'skeleton' data from an inexpensive consumer-level sensor, the Microsoft 'Kinect'. In an experimental pilot study it is shown that the K-means algorithm - as a candidate unsupervised clustering algorithm - is able to cluster gait samples(More)
(2005) A statistical framework for natural feature representation. (c) 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or(More)
1 2 u 2) + ∂ 2 x u + ∂ 4 x u = 0 is a " normal form " for many processes which lead to complex dynamics in space and time (one example is the roughening of the crystal surface in epitaxial growth). Numerical simulations show that after an initial layer, the statistical properties of the solution are independent of the initial data and the system size L(More)
This paper presents a supervised learning algorithm for image feature matching. The algorithm is based on Conditional Random Fields which provides a mechanism for globally reason about the associations. The novelty of this work is twofold: (i) the use of Delaunay triangulation as the graph structure for a probabilis-tic network to reason about image feature(More)