HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Convergence of MCEM and Related Algorithms for Hidden Markov Random Field

Nathalie Peyrard 1
1 IS2 - Statistical Inference for Industry and Health
Inria Grenoble - Rhône-Alpes, LBBE - Laboratoire de Biométrie et Biologie Evolutive - UMR 5558
Abstract : The Monte Carlo EM (MCEM) algorithm is a stochastic version of the EM algorithm using MCMC methods to approximate the conditional distribution of the hidden data. In the context of hidden Markov field model-based image segmentation, the behavior of this algorithm has been illustrated in experimental studies but little theoretical results have been established. In this paper new results on MCEM for parameter estimation of the observed data model are presented, showing that under suitable regularity conditions the sequence of MCEM estimates converges to a maximizer of the likelihood of the model. A variant of the Monte Carlo step in the MCEM algorithm is proposed, leading to the Generalized Simulated Field (GSF) algorithm, and it is shown that the two procedures have similar properties.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:04:35 AM
Last modification on : Friday, February 4, 2022 - 3:23:58 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:09:37 PM


  • HAL Id : inria-00072479, version 1



Nathalie Peyrard. Convergence of MCEM and Related Algorithms for Hidden Markov Random Field. RR-4146, INRIA. 2001. ⟨inria-00072479⟩



Record views


Files downloads