Fully Bayesian binary Markov random field models: prior specification and posterior simulation
From MaRDI portal
Publication:3460656
Abstract: We propose a flexible prior model for the parameters of binary Markov random fields (MRF) defined on rectangular lattices and with maximal cliques defined from a template maximal clique. The prior model allows higher-order interactions to be included. We also define a reversible jump Markov chain Monte Carlo (RJMCMC) algorithm to sample from the associated posterior distribution. The number of possible parameters for an MRF with for instance k x l maximal cliques becomes high even for small values of k and l. To get a flexible model which may adapt to the structure of a particular observed image we do not put any absolute restrictions on the parametrisation. Instead we define a parametric form for the MRF where the parameters have interpretation as potentials for the various clique configurations, and limit the effective number of parameters by assigning apriori discrete probabilities for events where groups of parameter values are equal. To run our RJMCMC algorithm we have to cope with the computationally intractable normalising constant of MRFs. For this we adopt a previously defined approximation for binary MRFs, but we also briefly discuss other alternatives. We demonstrate the flexibility of our prior formulation with simulated and real data examples.
Recommendations
- Prior specification of neighbourhood and interaction structure in binary Markov random fields
- Prior specification for binary Markov mesh models
- Construction of binary multi-grid Markov random field prior models from training images
- Approximate computations for binary Markov random fields and their use in Bayesian models
- Estimation of Markov random field prior parameters using Markov chain Monte Carlo maximum likelihood
Cites work
- scientific article; zbMATH DE number 3423418 (Why is no real title available?)
- scientific article; zbMATH DE number 3986503 (Why is no real title available?)
- scientific article; zbMATH DE number 3513115 (Why is no real title available?)
- A conjugate prior for discrete hierarchical log-linear models
- An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants
- Approximate Bayesian inference for latent Gaussian models by using integrated nested Laplace approximations (with discussion)
- Approximations of pseudo-Boolean functions; applications to game theory
- Bayesian computing with INLA: new features
- Equivalent representations of set functions
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Finite exchangeable sequences
- Fully Bayesian Approach to Image Restoration with an Application in Biogeography
- Image analysis with partially ordered Markov models.
- Markov Random Fields with Higher-order Interactions
- Markov chain Monte Carlo model determination for hierarchical and graphical log-linear models
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
Cited in
(5)- Prior specification for binary Markov mesh models
- Prior specification of neighbourhood and interaction structure in binary Markov random fields
- Local structure graph models with higher‐order dependence
- Approximate computations for binary Markov random fields and their use in Bayesian models
- Construction of binary multi-grid Markov random field prior models from training images
This page was built for publication: Fully Bayesian binary Markov random field models: prior specification and posterior simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460656)
