The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Space-alternating generalized expectation-maximization algorithm
Open accessAbstract
The expectation-maximization (EM) method can facilitate maximizing likelihood functions that arise in statistical estimation problems. In the classical EM paradigm, one iteratively maximizes the conditional log-likelihood of a single unobservable complete data space, rather than maximizing the intractable likelihood function for the measured or incomplete data. EM algorithms update all parameters simultaneously, which has two drawbacks: 1) slow convergence, and 2) difficult maximization steps due to coupling when smoothness penalties are used. The paper describes the space-alternating generalized EM (SAGE) method, which updates the parameters sequentially by alternating between several small hidden-data spaces defined by the algorithm designer. The authors prove that the sequence of estimates monotonically increases the penalized-likelihood objective, derive asymptotic convergence rates, and provide sufficient conditions for monotone convergence in norm. Two signal processing applications illustrate the method: estimation of superimposed signals in Gaussian noise, and image reconstruction from Poisson measurements. In both applications, the SAGE algorithms easily accommodate smoothness penalties and converge faster than the EM algorithms.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
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
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
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
Finding the Observed Information Matrix When Using the EM Algorithm
Louis, T. A. (1982) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1982.tb01203.x · Cited by 2,229
EM reconstruction algorithms for emission and transmission tomography.
Lange, K. L., & Carson, R. E. (1984) · PubMed · Cited by 1,769
Iterative Solution of Large Linear Systems
(1971) · Elsevier eBooks · doi:10.1016/c2013-0-11733-3 · Cited by 1,734
Cited by
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Sun, Y., Babu, P., & Palomar, D. P. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601299 · Cited by 1,820
From RSSI to CSI: Indoor localization via channel response
Yang, Z., Zhou, Z., & Liu, Y. (2013) · ACM Computing Surveys · doi:10.1145/2543581.2543592 · Cited by 1,229
Ollinger, J. M., & Fessler, J. A. (1997) · IEEE Signal Processing Magazine · doi:10.1109/79.560323 · Cited by 1,167
Self-citationFévotte, C., Bertin, N., & Durrieu, J.-L. (2009) · Neural Computation · doi:10.1162/neco.2008.04-08-771 · Cited by 1,119
Channel parameter estimation in mobile radio environments using the SAGE algorithm
Fleury, B. H., Tschudin, M., Heddergott, R., Dahlhaus, D., & Ingeman Pedersen, K. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.753729 · Cited by 1,079
van Dyk, D. A., & Meng, X.-L. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/10618600152418584 · Cited by 1,052
The EM Algorithm—an Old Folk-song Sung to a Fast New Tune
Meng, X.-L., & Van Dyk, D. (1997) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00082 · Cited by 802
Morelli, M., Kuo, C.-C. J., & Pun, M.-O. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.897979 · Cited by 751
Pan, X., Sidky, E. Y., & Vannier, M. (2009) · Inverse Problems · doi:10.1088/0266-5611/25/12/123009 · Cited by 572
Ordered subsets algorithms for transmission tomography
Erdogan, H., & Fessler, J. A. (1999) · Physics in Medicine and Biology · doi:10.1088/0031-9155/44/11/311 · Cited by 556
Self-citationWidar2.0: Passive Human Tracking with a Single Wi-Fi Link
Qian, K., Wu, C., Zhang, Y., Zhang, G., Yang, Z., & Liu, Y. (2018) · Proceedings of the 16th Annual International Conference on Mobile Systems, Applications, and Services · doi:10.1145/3210240.3210314 · Cited by 438
Parameter expansion to accelerate EM: the PX-EM algorithm
Liu, C. (1998) · Biometrika · doi:10.1093/biomet/85.4.755 · Cited by 433
A row-action alternative to the EM algorithm for maximizing likelihood in emission tomography
Browne, J., & de Pierro, A. B. (1996) · IEEE Transactions on Medical Imaging · doi:10.1109/42.538946 · Cited by 424
An outlook on x‐ray CT research and development
Wang, G., Yu, H., & De Man, B. (2008) · Medical Physics · doi:10.1118/1.2836950 · Cited by 341
mD-Track: Leveraging Multi-Dimensionality for Passive Indoor Wi-Fi Tracking
Xie, Y., Xiong, J., Li, M., & Jamieson, K. (2019) · The 25th Annual International Conference on Mobile Computing and Networking · doi:10.1145/3300061.3300133 · Cited by 320
Metadata
- Authors
- Fessler, J. A., & Hero, A. O.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1994
- Volume
- 42
- Issue
- 10
- Pages
- 2664-2677
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2161623414
- Cited by
- 1,063
- References
- 33
- FWCI
- 11.71
- Type
- journal article
- Language
- en
- Open access
- green
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.