The EM/MPM algorithm for segmentation of textured images: analysis and further experimental results

  • Authors:
  • M. L. Comer;E. J. Delp

  • Affiliations:
  • Thomson Consumer Electron., Indianapolis, IN;-

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 2000

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper we present new results relative to the “expectation-maximization/maximization of the posterior marginals” (EM/MPM) algorithm for simultaneous parameter estimation and segmentation of textured images. The EM/MPM algorithm uses a Markov random field model for the pixel class labels and alternately approximates the MPM estimate of the pixel class labels and estimates parameters of the observed image model. The goal of the EM/MPM algorithm is to minimize the expected value of the number of misclassified pixels. We present new theoretical results in this paper which show that the algorithm can be expected to achieve this goal, to the extent that the EM estimates of the model parameters are close to the true values of the model parameters. We also present new experimental results demonstrating the performance of the EM/MPM algorithm