Pre-processing for approximate Bayesian computation in image analysis
From MaRDI portal
(Redirected from Publication:5963548)
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.
Recommendations
- An Introduction to Approximate Bayesian Computation
- Adaptive approximate Bayesian computation for complex models
- New insights into approximate Bayesian computation
- The use of a single pseudo-sample in approximate Bayesian computation
- An adaptive sequential Monte Carlo method for approximate Bayesian computation
Cites work
- scientific article; zbMATH DE number 1870396 (Why is no real title available?)
- scientific article; zbMATH DE number 3076589 (Why is no real title available?)
- A Bayesian Reassessment of Nearest-Neighbor Classification
- A quasi likelihood approximation of posterior distributions for likelihood-intractable complex models
- ABC likelihood-free methods for model choice in Gibbs random fields
- Adaptive ABC model choice and geometric summary statistics for hidden Gibbs random fields
- Adaptive approximate Bayesian computation
- An adaptive sequential Monte Carlo method for approximate Bayesian computation
- Auxiliary Variable Methods for Markov Chain Monte Carlo with Applications
- Bayesian indirect inference using a parametric auxiliary model
- Encompassing and indirect inference
- Estimation of parameters for macroparasite population evolution using approximate Bayesian computation
- Filtering via approximate Bayesian computation
- Monte Carlo strategies in scientific computing
- RcppArmadillo: accelerating R with high-performance C++ linear algebra
- Sequential Monte Carlo without likelihoods
Cited in
(21)- Adaptive ABC model choice and geometric summary statistics for hidden Gibbs random fields
- Introduction to ``Pre-processing for approximate Bayesian computation in image analysis by M. Moores, C. Drovandi, K. Mengersen, C. Robert
- Bayesian indirect inference for models with intractable normalizing functions
- Scalable Bayesian inference for the inverse temperature of a hidden Potts model
- Variational Bayes with synthetic likelihood
- Likelihood-free inference in high dimensions with synthetic likelihood
- An approximate likelihood perspective on ABC methods
- Approximation of Bayesian predictive \(p\)-values with regression ABC
- A synthetic likelihood approach for intractable Markov random fields
- Bayesian computational methods for spatial analysis of images. (Abstract of thesis)
- A Function Emulation Approach for Doubly Intractable Distributions
- Bayesian inference of multiple Ising models for heterogeneous public opinion survey networks
- Lazy ABC
- Bayesian Synthetic Likelihood
- Accuracy of the Bethe approximation for hyperparameter estimation in probabilistic image processing
- Approximate Bayesian inference in a model for self-generated gradient collective cell movement
- scientific article; zbMATH DE number 7625191 (Why is no real title available?)
- Spectral density-based and measure-preserving ABC for partially observed diffusion processes. An illustration on Hamiltonian SDEs
- Efficient MCMC for Gibbs random fields using pre-computation
- On Russian roulette estimates for Bayesian inference with doubly-intractable likelihoods
- Scalable approximate Bayesian computation for growing network models via extrapolated and sampled summaries
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)
