Pre-processing for approximate Bayesian computation in image analysis

From MaRDI portal
Publication:5963548

DOI10.1007/S11222-014-9525-6zbMATH Open1331.62158arXiv1403.4359OpenAlexW2118661871WikidataQ56994086 ScholiaQ56994086MaRDI QIDQ5963548FDOQ5963548

Matthew T. Moores, C. C. Drovandi, Christian Robert, K. Mengersen

Publication date: 22 February 2016

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: Most of the existing algorithms for approximate Bayesian computation (ABC) assume that it is feasible to simulate pseudo-data from the model at each iteration. However, the computational cost of these simulations can be prohibitive for high dimensional data. An important example is the Potts model, which is commonly used in image analysis. Images encountered in real world applications can have millions of pixels, therefore scalability is a major concern. We apply ABC with a synthetic likelihood to the hidden Potts model with additive Gaussian noise. Using a pre-processing step, we fit a binding function to model the relationship between the model parameters and the synthetic likelihood parameters. Our numerical experiments demonstrate that the precomputed binding function dramatically improves the scalability of ABC, reducing the average runtime required for model fitting from 71 hours to only 7 minutes. We also illustrate the method by estimating the smoothing parameter for remotely sensed satellite imagery. Without precomputation, Bayesian inference is impractical for datasets of that scale.


Full work available at URL: https://arxiv.org/abs/1403.4359





Cites Work


Cited In (19)

Uses Software






This page was built for publication: Pre-processing for approximate Bayesian computation in image analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963548)