Some properties of adding a smoothing step to the EM algorithm (Q583872): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Douglas W. Nychka / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Sotirios Loukas / rank | |||
Normal rank | |||
Revision as of 05:58, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some properties of adding a smoothing step to the EM algorithm |
scientific article |
Statements
Some properties of adding a smoothing step to the EM algorithm (English)
0 references
1990
0 references
The EM algorithm is an iterative statistical and numerical method that in many cases is useful for finding the maximum of a likelihood. Adding a smoothing step after the usual expectation and maximization steps of the EM algorithm results in a useful method for solving statistical problems in image analysis and integral equations. The author gives some connections between this algorithm, known as EMS, and maximizing a penalized likelihood and derives an upper bound on the convergence rate.
0 references
EM algorithm
0 references
smoothing step
0 references
image analysis
0 references
penalized likelihood
0 references
convergence rate
0 references
