The Approximate Bayesian Computation methods in the localization of the atmospheric contamination source

In many areas of application, a central problem is a solution to the inverse problem, especially estimation of the unknown model parameters to model the underlying dynamics of a physical system precisely. In this situation, the Bayesian inference is a powerful tool to combine observed data with prio...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 633; no. 1; pp. 12118 - 12121
Main Authors Kopka, P, Wawrzynczak, A, Borysiewicz, M
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 21.09.2015
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In many areas of application, a central problem is a solution to the inverse problem, especially estimation of the unknown model parameters to model the underlying dynamics of a physical system precisely. In this situation, the Bayesian inference is a powerful tool to combine observed data with prior knowledge to gain the probability distribution of searched parameters. We have applied the modern methodology named Sequential Approximate Bayesian Computation (S-ABC) to the problem of tracing the atmospheric contaminant source. The ABC is technique commonly used in the Bayesian analysis of complex models and dynamic system. Sequential methods can significantly increase the efficiency of the ABC. In the presented algorithm, the input data are the on-line arriving concentrations of released substance registered by distributed sensor network from OVER-LAND ATMOSPHERIC DISPERSION (OLAD) experiment. The algorithm output are the probability distributions of a contamination source parameters i.e. its particular location, release rate, speed and direction of the movement, start time and duration. The stochastic approach presented in this paper is completely general and can be used in other fields where the parameters of the model bet fitted to the observable data should be found.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/633/1/012118