Results 1  10
of
39,997
The Noisy Expectation Maximization Algorithm
"... � We present a noiseinjected version of the ExpectationMaximization (EM) algorithm: the Noisy Expectation Maximization (NEM) algorithm. � The NEM theorem shows that additive noise speeds up the average convergence of the EM algorithm to a local maximum of the likelihood surface if a positivity con ..."
Abstract
 Add to MetaCart
� We present a noiseinjected version of the ExpectationMaximization (EM) algorithm: the Noisy Expectation Maximization (NEM) algorithm. � The NEM theorem shows that additive noise speeds up the average convergence of the EM algorithm to a local maximum of the likelihood surface if a positivity
The Expectation Maximization Algorithm
, 2002
"... This note represents my attempt at explaining the EM algorithm (Hartley, 1958; Dempster et al., 1977; McLachlan and Krishnan, 1997). This is just a slight variation on Tom Minka's tutorial (Minka, 1998), perhaps a little easier (or perhaps not). It includes a graphical example to provide some i ..."
Abstract
 Add to MetaCart
This note represents my attempt at explaining the EM algorithm (Hartley, 1958; Dempster et al., 1977; McLachlan and Krishnan, 1997). This is just a slight variation on Tom Minka's tutorial (Minka, 1998), perhaps a little easier (or perhaps not). It includes a graphical example to provide some
Inductive Programming by Expectation Maximization Algorithm
"... This paper proposes an algorithm which can write programs automatically to solve problems. We model the sequence of instructions as a ngram language model and the sequence is represented by some hidden variables. Expectation maximization algorithm is applied to train the ngram model and perform pr ..."
Abstract
 Add to MetaCart
This paper proposes an algorithm which can write programs automatically to solve problems. We model the sequence of instructions as a ngram language model and the sequence is represented by some hidden variables. Expectation maximization algorithm is applied to train the ngram model and perform
ExpectationMaximization Algorithm with Local Adaptivity ∗
"... Abstract. We develop an expectationmaximization algorithm with local adaptivity for image segmentation and classification. The key idea of our approach is to combine global statistics extracted from the Gaussian mixture model or other proper statistical models with local statistics and geometrical ..."
Abstract
 Add to MetaCart
Abstract. We develop an expectationmaximization algorithm with local adaptivity for image segmentation and classification. The key idea of our approach is to combine global statistics extracted from the Gaussian mixture model or other proper statistical models with local statistics and geometrical
SpaceAlternating Generalized ExpectationMaximization Algorithm
 IEEE Trans. Signal Processing
, 1994
"... The expectationmaximization (EM) method can facilitate maximizing likelihood functions that arise in statistical estimation problems. In the classical EM paradigm, one iteratively maximizes the conditional loglikelihood of a single unobservable complete data space, rather than maximizing the intra ..."
Abstract

Cited by 193 (28 self)
 Add to MetaCart
The expectationmaximization (EM) method can facilitate maximizing likelihood functions that arise in statistical estimation problems. In the classical EM paradigm, one iteratively maximizes the conditional loglikelihood of a single unobservable complete data space, rather than maximizing
Expectation Maximization Algorithms for Conditional Likelihoods
 Proceedings of the 22nd International Conference on Machine Learning (ICML2005
, 2005
"... We introduce an expectation maximizationtype (EM) algorithm for maximum likelihood optimization of conditional densities. It is applicable to hidden variable models where the distributions are from the exponential family. The algorithm can alternatively be viewed as automatic step size selection for ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
We introduce an expectation maximizationtype (EM) algorithm for maximum likelihood optimization of conditional densities. It is applicable to hidden variable models where the distributions are from the exponential family. The algorithm can alternatively be viewed as automatic step size selection
Segmentation of brain MR images through a hidden Markov random field model and the expectationmaximization algorithm
 IEEE TRANSACTIONS ON MEDICAL. IMAGING
, 2001
"... The finite mixture (FM) model is the most commonly used model for statistical segmentation of brain magnetic resonance (MR) images because of its simple mathematical form and the piecewise constant nature of ideal brain MR images. However, being a histogrambased model, the FM has an intrinsic limi ..."
Abstract

Cited by 639 (15 self)
 Add to MetaCart
methods are limited to using MRF as a general prior in an FM modelbased approach. To fit the HMRF model, an EM algorithm is used. We show that by incorporating both the HMRF model and the EM algorithm into a HMRFEM framework, an accurate and robust segmentation can be achieved. More importantly
Word Alignment and the ExpectationMaximization Algorithm
"... The purpose of this tutorial is to give you an example of how to take a simple discrete probabilistic model and derive the expectation maximization updates for it and then turn them into code. We give some examples and identify the key ideas that make the algorithms work. These are meant to be as in ..."
Abstract
 Add to MetaCart
The purpose of this tutorial is to give you an example of how to take a simple discrete probabilistic model and derive the expectation maximization updates for it and then turn them into code. We give some examples and identify the key ideas that make the algorithms work. These are meant
ExpectationMaximization Algorithm and Image Segmentation
"... In computer vision, image segmentation problem is to partition a digital image into multiple parts. The goal is to change the representation of the image and make it more meaningful and easier to analyze [11]. In this assignment, we will show how an image segmentation algorithm works in a real appli ..."
Abstract
 Add to MetaCart
In computer vision, image segmentation problem is to partition a digital image into multiple parts. The goal is to change the representation of the image and make it more meaningful and easier to analyze [11]. In this assignment, we will show how an image segmentation algorithm works in a real
Results 1  10
of
39,997