ISIT 2005 Expectation Maximization as Message Passing
by
Justin Dauwels
,
Sascha Korl
,
Hans-andrea Loeliger
BibTeX
@MISC{Dauwels_isit2005,
author = {Justin Dauwels and Sascha Korl and Hans-andrea Loeliger},
title = {ISIT 2005 Expectation Maximization as Message Passing},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract — Based on prior work by Eckford, it is shown how expectation maximization (EM) may be viewed, and used, as a message passing algorithm in factor graphs. I.
Citations
| 6234 | Maximum likelihood from incomplete data via the EM algorithm - Dempster, Laird, et al. - 1977 |
| 767 | Factor graphs and the sum-product algorithm - Kschischang, Frey, et al. - 2001 |
| 178 | The EM algorithm for graphical association models with missing data - Lauritzen - 1995 |
| 67 | An introduction to factor graphs - Loeliger - 2004 |
| 5 | Signal processing with factor graphs: examples - Loeliger, Dauwels, et al. |
| 4 | Cyclic minimizers, majorization techniques, and the expectation-maximization algorithm: a refresher - Stoica, Selen - 2004 |
| 3 | Channel estimation in block fading channels using the factor graph EM algorithm - Eckford - 2004 |
| 2 | Iterative multiuser detection with graphical modeling - Eckford, Pasupathy - 2000 |
