The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
The expectation-maximization algorithm
Abstract
A common task in signal processing is the estimation of the parameters of a probability distribution function. Perhaps the most frequently encountered estimation problem is the estimation of the mean of a signal in noise. In many parameter estimation problems the situation is more complicated because direct access to the data necessary to estimate the parameters is impossible, or some of the data are missing. Such difficulties arise when an outcome is a result of an accumulation of simpler outcomes, or when outcomes are clumped together, for example, in a binning or histogram operation. There may also be data dropouts or clustering in such a way that the number of underlying data points is unknown (censoring and/or truncation). The EM (expectation-maximization) algorithm is ideally suited to problems of this sort, in that it produces maximum-likelihood (ML) estimates of parameters when there is a many-to-one mapping from an underlying distribution to the distribution governing the observation. The EM algorithm is presented at a level suitable for signal processing practitioners who have had some exposure to estimation theory.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Fundamentals of speech recognition
Rabiner, L. R., & Juang, B.-H. F. (1993) · Cited by 7,680
Warnes, L. A. A. (1994) · Electronic and Electrical Engineering · doi:10.1007/978-1-349-13012-2_24 · Cited by 6,512
Detection, Estimation, And Modulation Theory
Trees, H. L. V. (1968) · Cited by 5,969
(1991) · Springer eBooks · doi:10.1007/978-3-7091-2840-4 · Cited by 5,095
Maximum Likelihood from Incomplete Data via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1976) · Cited by 4,517
Maximum Likelihood Reconstruction for Emission Tomography
Shepp, L. A., & Vardi, Y. (1982) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.1982.4307558 · Cited by 4,429
Baum, L. E., Petrie, T., Soules, G., & Weiss, N. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697196 · Cited by 4,297
Pattern classification and scene analysis
Chien, Y. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100577 · Cited by 3,398
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
Mixture Densities, Maximum Likelihood and the EM Algorithm
Redner, R. A., & Walker, H. F. (1984) · SIAM Review · doi:10.1137/1026034 · Cited by 2,693
Hierarchical Mixtures of Experts and the EM Algorithm
Jordan, M. I., & Jacobs, R. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.181 · Cited by 2,673
Discrete-Time Processing of Speech Signals
Deller, J. R., Hansen, J. H. L., & Proakis, J. G. (1999) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470544402 · Cited by 2,458
Statistical signal processing : detection, estimation, and time series analysis
Scharf, L. L., & Demeure, C. J. (1991) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 2,158
(1986) · Signal Processing · doi:10.1016/0165-1684(86)90025-3 · Cited by 1,594
Computation of channel capacity and rate-distortion functions
Blahut, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054855 · Cited by 1,381
(2022) · Modern Signal Processing · doi:10.1515/9783110475562-004 · Cited by 996
Information geometry and alternating minimization procedures
Csiszár, I. (1984) · Statistics & Risk Modeling · Cited by 579
On the Convergence of the EM Algorithm
Boyles, R. A. (1983) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1983.tb01229.x · Cited by 333
Maximum likelihood training of probabilistic neural networks
Streit, R. L., & Luginbuhl, T. E. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.317728 · Cited by 208
Continuous speech recognition using hidden Markov models
Picone, J. (1990) · IEEE ASSP Magazine · doi:10.1109/53.54527 · Cited by 168
Snyder, D. L., & Politte, D. G. (1983) · IEEE Transactions on Nuclear Science · doi:10.1109/tns.1983.4332660 · Cited by 139
Efficient estimation of Class A noise parameters via the EM algorithm
Zabin, S. M., & Poor, H. V. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.61127 · Cited by 125
Iterative and sequential algorithms for multisensor signal enhancement
Weinstein, E., Oppenheim, A. V., Feder, M., & Buck, J. R. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.285648 · Cited by 105
Maximum likelihood blur identification and image restoration using the EM algorithm
Katsaggelos, A. K., & Lay, K. T. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.80894 · Cited by 99
Maximum likelihood noise cancellation using the EM algorithm
Feder, M., Oppenheim, A. V., & Weinstein, E. (1989) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/29.21683 · Cited by 77
Alternating minimization and Boltzmann machine learning
Byrne, B. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.143375 · Cited by 60
Dynamical encoding of cursive handwriting
Singer, Y., & Tishby, N. (1994) · Biological Cybernetics · doi:10.1007/bf00202762 · Cited by 57
Dynamical encoding of cursive handwriting
Singer, Y., & Tishby, N. (1994) · Biological Cybernetics · doi:10.1007/s004220050085 · Cited by 17
Bialkowski, S. E. (1991) · Journal of Chemometrics · doi:10.1002/cem.1180050309 · Cited by 8
Cited by
Classification of hyperspectral remote sensing images with support vector machines
Melgani, F., & Bruzzone, L. (2004) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2004.831865 · Cited by 4,411
On hyperparameter optimization of machine learning algorithms: Theory and practice
Yang, L., & Shami, A. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.07.061 · Cited by 3,232
Spectral Analysis of Signals: The Missing Data Case
Wang, Y., Li, J., & Stoica, P. (2005) · Synthesis Lectures on Signal Processing · doi:10.1007/978-3-031-02525-9 · Cited by 2,890
Automatic analysis of the difference image for unsupervised change detection
Bruzzone, L., & Prieto, D. F. (2000) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/36.843009 · Cited by 1,339
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
Metadata
- Authors
- Moon, T. K.
- Venue
- IEEE Signal Processing Magazine
- Published
- 1996
- Volume
- 13
- Issue
- 6
- Pages
- 47-60
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W1985690171
- Cited by
- 3,181
- References
- 32
- FWCI
- 16.82
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.