Maximum likelihood from spatial random effects models via the stochastic approximation expectation maximization algorithm

Hongtu Zhu, Minggao Gu, Bradley Peterson

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

We introduce a class of spatial random effects models that have Markov random fields (MRF) as latent processes. Calculating the maximum likelihood estimates of unknown parameters in SREs is extremely difficult, because the normalizing factors of MRFs and additional integrations from unobserved random effects are computationally prohibitive. We propose a stochastic approximation expectation-maximization (SAEM) algorithm to maximize the likelihood functions of spatial random effects models. The SAEM algorithm integrates recent improvements in stochastic approximation algorithms; it also includes components of the Newton-Raphson algorithm and the expectation-maximization (EM) gradient algorithm. The convergence of the SAEM algorithm is guaranteed under some mild conditions. We apply the SAEM algorithm to three examples that are representative of real-world applications: a state space model, a noisy Ising model, and segmenting magnetic resonance images (MRI) of the human brain. The SAEM algorithm gives satisfactory results in finding the maximum likelihood estimate of spatial random effects models in each of these instances.

Original languageEnglish (US)
Pages (from-to)163-177
Number of pages15
JournalStatistics and Computing
Volume17
Issue number2
DOIs
StatePublished - Jun 2007

Keywords

  • Expectation maximization
  • Markov chain Monte Carlo
  • Markov random fields
  • Spatial random effects models
  • Stochastic approximation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Maximum likelihood from spatial random effects models via the stochastic approximation expectation maximization algorithm'. Together they form a unique fingerprint.

Cite this