Approximate Bayesian Computation for Source Term Estimation

Bayesian inference is a vital tool for consistent manipulation of the uncertainty that is present in many military scenarios. However, in some highly complex environments, it is hard to write down an analy tic form for the likelihood function that underlies Bayesian inference. Approximate Bayesian computation (ABC) algorithms address this difficulty by enabling one to proceed without analytically specifying or evaluating the likelihood distribution. This is achieved through the use of computer simulation models that stochastically simulate measurements for a given set of parameter values. This paper gives an overview of standard ABC methods such as rejection and Markov chain Monte Carlo (MCMC) sampling. It then goes on to discuss ABC versions of sequential Monte Carlo (SMC) samplers, which are the recently-developed next-generation particle filters for Bayesian sampling. SMC Samplers have properties that make them highly suitable for complex estimation and inference problems in the presence of uncertainty. This includes an ability to effic iently explore multi-modal distributions. One application of SMC -ABC algorithms is source term estimation for chemical, biological, radiological and nuclear (CBRN) defence when the number of releases is unknown. A proof -of-principle study has been conducted using a bar -sensor model and a Gaussian dispersion model for agent behaviour, including the effect of wind. The outcome is that the algorithms are able to estimate model parameters to a reasonable degree of accuracy, but there is some ambiguity between the location and time of releases due to wind effects.

[1]  Christian P. Robert,et al.  Monte Carlo Statistical Methods , 2005, Springer Texts in Statistics.

[2]  P. Green Reversible jump Markov chain Monte Carlo computation and Bayesian model determination , 1995 .

[3]  Yuguo Chen Another look at rejection sampling through importance sampling , 2005 .

[4]  David Welch,et al.  Approximate Bayesian computation scheme for parameter inference and model selection in dynamical systems , 2009, Journal of The Royal Society Interface.

[5]  S. Chib,et al.  Understanding the Metropolis-Hastings Algorithm , 1995 .

[6]  S. Coles,et al.  Inference for Stereological Extremes , 2007 .

[7]  G. Peters,et al.  A Note on Target Distribution Ambiguity for Likelihood-Free Samplers (ABC) , 2010 .

[8]  Jean-Michel Marin,et al.  ABC methods for model choice in Gibbs random fields , 2008 .

[9]  P. Moral,et al.  Sequential Monte Carlo samplers , 2002, cond-mat/0212648.

[10]  Paul Marjoram,et al.  Markov chain Monte Carlo without likelihoods , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[11]  P. Robins,et al.  Non-linear Bayesian CBRN source term estimation , 2005, 2005 7th International Conference on Information Fusion.

[12]  P. Robins,et al.  Realtime sequential inference of static parameters with expensive likelihood calculations , 2009 .

[13]  Zhiqiang Zheng,et al.  PERFORMANCE ANALYSIS OF KALMAN-BASED FILTERS AND PARTICLE FILTERS FOR NON-LINEAR/NON-GAUSSIAN BAYESIAN TRACKING , 2005 .

[14]  Neil J. Gordon,et al.  A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking , 2002, IEEE Trans. Signal Process..

[15]  D. Balding,et al.  Approximate Bayesian computation in population genetics. , 2002, Genetics.

[16]  J. Marin,et al.  Adaptivity for ABC algorithms: the ABC-PMC scheme , 2008 .

[17]  Neil J. Gordon,et al.  A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking , 2002, IEEE Trans. Signal Process..