MRF parameter estimation by an accelerated method

  • Authors:
  • Yihua Yu;Qiansheng Cheng

  • Affiliations:
  • Department of Information Science, Key Laboratory of Pure and Applied Mathematics, School of Mathematical Sciences, Peking University, Beijing 100871, People's Republic of China;Department of Information Science, Key Laboratory of Pure and Applied Mathematics, School of Mathematical Sciences, Peking University, Beijing 100871, People's Republic of China

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2003

Quantified Score

Hi-index 0.10

Visualization

Abstract

Markov random field (MRF) modelling is a popular method for pattern recognition and computer vision and MRF parameter estimation is of particular importance to MRF modelling. In this paper, a new approach based on Metropolis-Hastings algorithm and gradient method is presented to estimate MRF parameters. With properly chosen proposal distribution for Metropolis-Hastings algorithm, the Markov chain constructed by the method converges to stationary distribution quickly and it gives a good estimation result.