2,326 research outputs found
Recommended from our members
Monte Carlo Methods in Practice and Efficiency Enhancements via Parallel Computation
Monte Carlo methods are crucial when dealing with advanced problems in Bayesian inference. Indeed, common approaches such as Markov chain Monte Carlo (MCMC) and sequential Monte Carlo (SMC) can be endlessly adapted to tackle the most complex problems. What is important then is to construct efficient algorithms, and significant attention in the literature is devoted to developing algorithms that mix well, have low computational complexity and can scale up to large datasets. One of the most commonly used and straightforward approaches is to speed up Monte Carlo algorithms by running them in parallel computing environments. The compute time of Monte Carlo algorithms is random and can vary depending on the current state of the Markov chain. Other computing-infrastructure related factors, such as competing jobs on the same processor, or memory bandwidth, which are prevalent in shared computing architectures such as cloud computing, can also affect this compute time. However, many algorithms running in parallel require the processors to communicate every so often, and for that we must ensure that they are simultaneously ready and any idle wait time is minimised. This can be done by employing a framework known as Anytime Monte Carlo, which imposes a real-time deadline on parallel computations.
The contributions in this thesis include novel applications of the Anytime framework to construct efficient Anytime MCMC and SMC algorithms which make use of parallel computing in order to perform inference for advanced problems. Examples of such problems investigated include models in which the likelihood cannot be evaluated analytically, and changepoint models, which are often used to model the heterogeneity of sequential data, but tricky to infer upon due to the unknown number and locations of the changepoints. This thesis also focuses on the difficult task of performing parameter inference in single-molecule microscopy, a category of models in which the arrival rate of observations is not uniformly distributed and measurement models have complex forms. These issues are exacerbated when molecules have trajectories described by stochastic differential equations.
The original contributions of this thesis are organised in Chapters 4-6. Chapter 4 shows the development of a novel Anytime parallel tempering algorithm and demonstrates the performance enhancements the Anytime framework brings to parallel tempering, an algorithm, which runs multiple interacting MCMC chains in order to more efficiently explore the state space. In Chapter 5, a general Anytime SMC sampler is developed for performing changepoint inference using reversible jump MCMC (RJ-MCMC), an algorithm that takes into account the unknown number of changepoints by including transdimensional MCMC updates. The workings of the algorithm are illustrated on a particularly complex changepoint model, and once again the improvements in performance brought by employing the Anytime framework are demonstrated. Chapter 6 moves away from the Anytime framework, and presents a novel and general SMC approach to performing parameter inference for molecules with stochastic trajectories
A Tractable Forward-Backward CPHD Smoother
To circumvent the intractability of the usual Cardinalized Probability Hypothesis Density (CPHD) smoother, we present an approximate scheme where the population of targets born until and after the starting time of the smoothing are estimated separately and where smoothing is only applied to the estimate of the former population. The approach is illustrated through the implementation of a tractable approximation of the usual CPHD smoother
Sequential bayesian filtering for spatial arrival time estimation
Locating and tracking a source in an ocean environment as well as estimating environmental parameters of a sound propagation medium is of utmost importance in underwater acoustics. Matched field processing is often the method of choice for the estimation of such parameters. This approach, based on full field calculations, is computationally intensive and sensitive to assumptions on the structure of the environment. As an alternative, methods that use only select features of the acoustic field for source localization and environmental inversion have been proposed. The focus here is on inversion using arrival times of identified paths within recorded time-series. After a short study of a linearization techniques employing such features and numerical issues on their implementation, we turn our attention to the need for accurate extraction of arrival times for accurate estimation. We develop a particle filtering approach that treats arrival times as targets , dynamically modeling their location at arrays of spatially separated receivers. Using Monte Carlo simulations, we perform an evaluation of our method and compare it to conventional Maximum Likelihood (ML) estimation. The comparison demonstrates an advantage in using the proposed approach, which can be employed as a pre-inversion tool for minimization and quantification of uncertainty in arrival time estimation
Random finite sets in multi-target tracking - efficient sequential MCMC implementation
Over the last few decades multi-target tracking (MTT) has proved to be a challenging and attractive research topic. MTT applications span a wide variety of disciplines, including robotics, radar/sonar surveillance, computer vision and biomedical research. The primary focus of this dissertation is to develop an effective and efficient multi-target tracking algorithm dealing with an unknown and time-varying number of targets. The emerging and promising Random Finite Set (RFS) framework provides a rigorous foundation for optimal Bayes multi-target tracking. In contrast to traditional approaches, the collection of individual targets is treated as a set-valued state. The intent of this dissertation is two-fold; first to assert that the RFS framework not only is a natural, elegant and rigorous foundation, but also leads to practical, efficient and reliable algorithms for Bayesian multi-target tracking, and second to provide several novel RFS based tracking algorithms suitable for the specific Track-Before-Detect (TBD) surveillance application. One main contribution of this dissertation is a rigorous derivation and practical implementation of a novel algorithm well suited to deal with multi-target tracking problems for a given cardinality. The proposed Interacting Population-based MCMC-PF algorithm makes use of several Metropolis-Hastings samplers running in parallel, which interact through genetic variation. Another key contribution concerns the design and implementation of two novel algorithms to handle a varying number of targets. The first approach exploits Reversible Jumps. The second approach is built upon the concepts of labeled RFSs and multiple cardinality hypotheses. The performance of the proposed algorithms is also demonstrated in practical scenarios, and shown to significantly outperform conventional multi-target PF in terms of track accuracy and consistency. The final contribution seeks to exploit external information to increase the performance of the surveillance system. In multi-target scenarios, kinematic constraints from the interaction of targets with their environment or other targets can restrict target motion. Such motion constraint information is integrated by using a fixed-lag smoothing procedure, named Knowledge-Based Fixed-Lag Smoother (KB-Smoother). The proposed combination IP-MCMC-PF/KB-Smoother yields enhanced tracking
Recommended from our members
Bayesian Approaches to Tracking, Sensor Fusion and Intent Prediction
This thesis presents work on the development of model-based Bayesian approaches to object tracking and intent prediction. Successful navigation/positioning applications rely fundamentally on the choice of appropriate dynamic model and the design of effective tracking algorithms capable of maximising the use of the structure of the dynamic system and the information from sensors. While the tracking problem with frequent and accurate position data has been well studied, we push back the frontiers of current technology where an object can undergo fast manoeuvres and position fixes are limited. On the other hand, intent prediction techniques which extract higher level information such as the intended destination of a moving object can be designed, given the ability to perform successful tracking. Such techniques can play important roles in various application areas, including traffic monitoring, intelligent human computer interaction systems and autonomous route planning.
In the first part of this thesis Bayesian tracking methods are designed based on a standard fix-rate setting in which the dynamic system is formulated into a Markovian state space form. We show that the combination of an intrinsic coordinate dynamic model and sensors in the object's body frame leads to novel state space models according to which efficient proposal kernels can be designed and implemented by the sequential Monte Carlo (SMC) methods. Also, sequential Markov chain Monte Carlo schemes are considered for the first time to tackle the sequential batch inference problems due to the presence of infrequent position data. Performance evaluation on both synthetic and real-world data shows that the proposed algorithms are superior to simpler particle filters, implying that they can be favourable alternatives to tracking problems with inertial sensors.
The modelling assumption that leads to Markovian state space models can be restrictive for real-world systems as it stipulates that the state sequence has to be synchronised with the observations. In the second major part of this thesis we relax this assumption and work with a more natural class of models, termed variable rate models. We generalise the existing variable rate intrinsic model to incorporate acceleration, speed, distance and position data and introduce new variable rate particle filtering methods tailored to the derived model to accommodate multi-sensor multi-rate tracking scenarios. The proposed algorithms can achieve substantial improvements in terms of tracking accuracy and robustness over a bootstrap variable rate particle filter. Moreover, full Bayesian inference schemes for the learning of both the hidden state and system parameters are presented, with numerical results illustrating their effectiveness.
The last part of the thesis is about designing efficient intent prediction algorithms within a Bayesian framework. A pseudo-observation based approach to the incorporation of destination knowledge is introduced, making the mathematics of the dynamical model and the observation process consistent with the Markov state process. Based on the new interpretation, two algorithms are proposed to sequentially estimate the probability of all possible endpoints. Whilst the synthetic maritime surveillance data demonstrate that the proposed methods can achieve comparable prediction performance with reduced computational cost in comparison to the existing bridging distribution based methods, the results on an extensive freehand pointing database, which contains 95 three-dimensional pointing trajectories, show that the new algorithms can outperform other state-of-the-art techniques. Some sensitivity tests are also performed, confirming the good robustness of the introduced methods against model mismatches
- …