Sparse Interaction Neighborhood Selection for Markov Random Fields via Reversible Jump and Pseudoposteriors
Not on the map. Why?
Abstract (arXiv)
We consider the problem of estimating the interacting neighborhood of a Markov Random Field model with finite support and homogeneous pairwise interactions based on relative positions of a two-dimensional lattice. Using a Bayesian framework, we propose a Reversible Jump Monte Carlo Markov Chain algorithm that jumps across subsets of a maximal range neighborhood, allowing us to perform model selection based on a marginal pseudoposterior distribution of models. To show the strength of our proposed methodology we perform a simulation study and apply it to a real dataset from a discrete texture image analysis.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 43 references that are in the map. First posted on arXiv 12 Apr 2022.
Builds on
7 of 43 references.
References · 7
- 2019Nonparametric graphical model for countscited by 7
- 2014Marginal Pseudo-Likelihood Learning of Markov Network structurescited by 3
- 2020Inference tools for Markov Random Fields on lattices: The R package mrf2dcited by 2
- 2015Prior specification of neighbourhood and interaction structure in binary Markov random fieldscited by 1
- 2016A novel approach for Markov Random Field with intractable normalising constant on large latticescited by 1
- 2017Efficient MCMC for Gibbs Random Fields using pre-computationcited by 1
- 2017Model comparison for Gibbs random fields using noisy reversible jump Markov chain Monte Carlocited by 1
Built on by
Not cited yet.