In these notes, we introduce particle filtering as a recursive importance sampling method that approximates the minimum-mean-square-error (MMSE) estimate of a sequence of hidden state vectors in scenarios where the joint probability distribution of the states and the observations is non-Gaussian and, therefore, closed-form analytical expressions for the MMSE estimate are generally unavailable. We begin the notes with a review of Bayesian approaches to static (i.e., time-invariant) parameter estimation. In the sequel, we describe the solution to the problem of sequential state estimation in linear, Gaussian dynamic models, which corresponds to the well-known Kalman (or Kalman-Bucy) filter. Finally, we move to the general nonlinear, non-Gaussian stochastic filtering problem and present particle filtering as a sequential Monte Carlo approach to solve that problem in a statistically optimal way. We review several techniques to improve the performance of particle filters, including importance function optimization, particle resampling, Markov Chain Monte Carlo move steps, auxiliary particle filtering, and regularized particle filtering. We also discuss Rao-Blackwellized particle filtering as a technique that is particularly well-suited for many relevant applications such as fault detection and inertial navigation. Finally, we conclude the notes with a discussion on the emerging topic of distributed particle filtering using multiple processors located at remote nodes in a sensor network. Throughout the notes, we often assume a more general framework than in most introductory textbooks by allowing either the observation model or the hidden state dynamic model to include unknown parameters. In a fully Bayesian fashion, we treat those unknown parameters also as random variables. Using suitable dynamic conjugate priors, that approach can be applied then to perform joint state and parameter estimation. Table of Contents: Introduction / Bayesian Estimation of Static Vectors / The Stochastic Filtering Problem / Sequential Monte Carlo Methods / Sampling/Importance Resampling (SIR) Filter / Importance Function Selection / Markov Chain Monte Carlo Move Step / Rao-Blackwellized Particle Filters / Auxiliary Particle Filter / Regularized Particle Filters / Cooperative Filtering with Multiple Observers / Application Examples / Summary

In these notes, we introduce particle filtering as a recursive importance sampling method that approximates the minimum-mean-square-error (MMSE) estimate of a sequence of hidden state vectors in scenarios where the joint probability distribution of the states and the observations is non-Gaussian and, therefore, closed-form analytical expressions for the MMSE estimate are generally unavailable. We begin the notes with a review of Bayesian approaches to static (i.e., time-invariant) parameter estimation. In the sequel, we describe the solution to the problem of sequential state estimation in linear, Gaussian dynamic models, which corresponds to the well-known Kalman (or Kalman-Bucy) filter. Finally, we move to the general nonlinear, non-Gaussian stochastic filtering problem and present particle filtering as a sequential Monte Carlo approach to solve that problem in a statistically optimal way. We review several techniques to improve the performance of particle filters, including importance function optimization, particle resampling, Markov Chain Monte Carlo move steps, auxiliary particle filtering, and regularized particle filtering. We also discuss Rao-Blackwellized particle filtering as a technique that is particularly well-suited for many relevant applications such as fault detection and inertial navigation. Finally, we conclude the notes with a discussion on the emerging topic of distributed particle filtering using multiple processors located at remote nodes in a sensor network. Throughout the notes, we often assume a more general framework than in most introductory textbooks by allowing either the observation model or the hidden state dynamic model to include unknown parameters. In a fully Bayesian fashion, we treat those unknown parameters also as random variables. Using suitable dynamic conjugate priors, that approach can be applied then to perform joint state and parameter estimation.

Monte Carlo methods are revolutionizing the on-line analysis of data in many fileds. They have made it possible to solve numerically many complex, non-standard problems that were previously intractable. This book presents the first comprehensive treatment of these techniques.

This book provides a general introduction to Sequential Monte Carlo (SMC) methods, also known as particle filters. These methods have become a staple for the sequential analysis of data in such diverse fields as signal processing, epidemiology, machine learning, population ecology, quantitative finance, and robotics. The coverage is comprehensive, ranging from the underlying theory to computational implementation, methodology, and diverse applications in various areas of science. This is achieved by describing SMC algorithms as particular cases of a general framework, which involves concepts such as Feynman-Kac distributions, and tools such as importance sampling and resampling. This general framework is used consistently throughout the book. Extensive coverage is provided on sequential learning (filtering, smoothing) of state-space (hidden Markov) models, as this remains an important application of SMC methods. More recent applications, such as parameter estimation of these models (through e.g. particle Markov chain Monte Carlo techniques) and the simulation of challenging probability distributions (in e.g. Bayesian inference or rare-event problems), are also discussed. The book may be used either as a graduate text on Sequential Monte Carlo methods and state-space modeling, or as a general reference work on the area. Each chapter includes a set of exercises for self-study, a comprehensive bibliography, and a “Python corner,” which discusses the practical implementation of the methods covered. In addition, the book comes with an open source Python library, which implements all the algorithms described in the book, and contains all the programs that were used to perform the numerical experiments.

Discrete-Time Systems comprehend an important and broad research field. The consolidation of digital-based computational means in the present, pushes a technological tool into the field with a tremendous impact in areas like Control, Signal Processing, Communications, System Modelling and related Applications. This book attempts to give a scope in the wide area of Discrete-Time Systems. Their contents are grouped conveniently in sections according to significant areas, namely Filtering, Fixed and Adaptive Control Systems, Stability Problems and Miscellaneous Applications. We think that the contribution of the book enlarges the field of the Discrete-Time Systems with signification in the present state-of-the-art. Despite the vertiginous advance in the field, we also believe that the topics described here allow us also to look through some main tendencies in the next years in the research area.

This is the proceedings of the "8th IMACS Seminar on Monte Carlo Methods" held from August 29 to September 2, 2011 in Borovets, Bulgaria, and organized by the Institute of Information and Communication Technologies of the Bulgarian Academy of Sciences in cooperation with the International Association for Mathematics and Computers in Simulation (IMACS). Included are 24 papers which cover all topics presented in the sessions of the seminar: stochastic computation and complexity of high dimensional problems, sensitivity analysis, high-performance computations for Monte Carlo applications, stochastic metaheuristics for optimization problems, sequential Monte Carlo methods for large-scale problems, semiconductor devices and nanostructures. The history of the IMACS Seminar on Monte Carlo Methods goes back to April 1997 when the first MCM Seminar was organized in Brussels: 1st IMACS Seminar, 1997, Brussels, Belgium 2nd IMACS Seminar, 1999, Varna, Bulgaria 3rd IMACS Seminar, 2001, Salzburg, Austria 4th IMACS Seminar, 2003, Berlin, Germany 5th IMACS Seminar, 2005, Tallahassee, USA 6th IMACS Seminar, 2007, Reading, UK 7th IMACS Seminar, 2009, Brussels, Belgium 8th IMACS Seminar, 2011, Borovets, Bulgaria

Signals and Images: Advances and Results in Speech, Estimation, Compression, Recognition, Filtering, and Processing cohesively combines contributions from field experts to deliver a comprehensive account of the latest developments in signal processing. These experts detail the results of their research related to audio and speech enhancement, acoustic image estimation, video compression, biometric recognition, hyperspectral image analysis, tensor decomposition with applications in communications, adaptive sparse-interpolated filtering, signal processing for power line communications, bio-inspired signal processing, seismic data processing, arithmetic transforms for spectrum computation, particle filtering in cooperative networks, three-dimensional television, and more. This book not only shows how signal processing theory is applied in current and emerging technologies, but also demonstrates how to tackle key problems such as how to enhance speech in the time domain, improve audio quality, and meet the desired electrical consumption target for controlling carbon emissions. Signals and Images: Advances and Results in Speech, Estimation, Compression, Recognition, Filtering, and Processing serves as a guide to the next generation of signal processing solutions for speech and video coding, hearing aid devices, big data processing, smartphones, smart digital communications, acoustic sensors, and beyond.