A recursive algorithm for Markov random fields
From MaRDI portal
Publication:4455366
DOI10.1093/biomet/89.3.724zbMath1036.62098OpenAlexW2011415751MaRDI QIDQ4455366
Francesco Bartolucci, Julian Besag
Publication date: 16 March 2004
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6d5391ffd0266531e3fa742416056b431afe7141
hidden Markov chainMarkov chain Monte CarloMarkov random fieldgraphical modelfull conditionalbinary systemautologistic distributionmonotone coupling from the past
Random fields (60G60) Random fields; image analysis (62M40) Approximations to statistical distributions (nonasymptotic) (62E17) Markov processes (60J99)
Related Items (13)
Total positivity in exponential families with application to binary variables ⋮ Mixed Hidden Markov Models for Longitudinal Data: An Overview ⋮ A synthetic likelihood approach for intractable Markov random fields ⋮ Sample-based Maximum Likelihood Estimation of the Autologistic Model ⋮ Uniqueness condition for an auto-logistic model ⋮ Construction of binary multi-grid Markov random field prior models from training images ⋮ Recursions on the marginals and exact computation of the normalizing constant for Gibbs processes ⋮ Exact marginals and normalizing constant for Gibbs distributions ⋮ A note on the mixture transition distribution and hidden Markov models ⋮ An adjustment for edge effects using an augmented neighborhood model in the spatial auto-logistic model ⋮ A Novel Approach for Markov Random Field With Intractable Normalizing Constant on Large Lattices ⋮ A method for bias-reduction of sample-based MLE of the autologistic model ⋮ Maximum likelihood estimation in Gaussian models under total positivity
This page was built for publication: A recursive algorithm for Markov random fields
