Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Expectation–maximization algorithm
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Filtering and smoothing EM algorithms == A [[Kalman filter]] is typically used for on-line state estimation and a minimum-variance smoother may be employed for off-line or batch state estimation. However, these minimum-variance solutions require estimates of the state-space model parameters. EM algorithms can be used for solving joint state and parameter estimation problems. Filtering and smoothing EM algorithms arise by repeating this two-step procedure: ;E-step : Operate a Kalman filter or a minimum-variance smoother designed with current parameter estimates to obtain updated state estimates. ;M-step : Use the filtered or smoothed state estimates within maximum-likelihood calculations to obtain updated parameter estimates. Suppose that a [[Kalman filter]] or minimum-variance smoother operates on measurements of a single-input-single-output system that possess additive white noise. An updated measurement noise variance estimate can be obtained from the [[maximum likelihood]] calculation : <math>\widehat{\sigma}^2_v = \frac{1}{N} \sum_{k=1}^N {(z_k-\widehat{x}_k)}^2,</math> where <math>\widehat{x}_k</math> are scalar output estimates calculated by a filter or a smoother from N scalar measurements <math>z_k</math>. The above update can also be applied to updating a Poisson measurement noise intensity. Similarly, for a first-order auto-regressive process, an updated process noise variance estimate can be calculated by : <math>\widehat{\sigma}^2_w = \frac{1}{N} \sum_{k=1}^N {(\widehat{x}_{k+1}-\widehat{F}\widehat{{x}}_k)}^2,</math> where <math>\widehat{x}_k</math> and <math>\widehat{x}_{k+1}</math> are scalar state estimates calculated by a filter or a smoother. The updated model coefficient estimate is obtained via : <math>\widehat{F} = \frac{\sum_{k=1}^N {(\widehat{x}_{k+1}-\widehat{F} \widehat{x}_k)}^2}{\sum_{k=1}^N \widehat{x}_k^2}.</math> The convergence of parameter estimates such as those above are well studied.<ref>{{Cite journal |last1 = Einicke |first1 = G. A. |last2 = Malos |first2 = J. T. |last3 = Reid |first3 = D. C. |last4 = Hainsworth |first4 = D. W. |title = Riccati Equation and EM Algorithm Convergence for Inertial Navigation Alignment |journal = IEEE Trans. Signal Process. |volume = 57 |issue = 1 |pages = 370–375 |date=January 2009 |doi = 10.1109/TSP.2008.2007090 |bibcode = 2009ITSP...57..370E |s2cid = 1930004 }}</ref><ref>{{Cite journal |last1 = Einicke |first1 = G. A. |last2 = Falco |first2 = G. |last3 = Malos |first3 = J. T. |title = EM Algorithm State Matrix Estimation for Navigation |journal = IEEE Signal Processing Letters |volume = 17 |issue = 5 |pages = 437–440 |date=May 2010 |doi = 10.1109/LSP.2010.2043151 |bibcode = 2010ISPL...17..437E |s2cid = 14114266 }}</ref><ref>{{Cite journal |last1 = Einicke |first1 = G. A. |last2 = Falco |first2 = G. |last3 = Dunn |first3 = M. T. |last4 = Reid |first4 = D. C. |title = Iterative Smoother-Based Variance Estimation |journal = IEEE Signal Processing Letters |volume = 19 |issue = 5 |pages = 275–278 |date=May 2012 |bibcode = 2012ISPL...19..275E |doi = 10.1109/LSP.2012.2190278 |s2cid = 17476971 }}</ref><ref>{{Cite journal |last = Einicke |first = G. A. |title = Iterative Filtering and Smoothing of Measurements Possessing Poisson Noise |journal = IEEE Transactions on Aerospace and Electronic Systems |volume = 51 |issue = 3 |pages = 2205–2011 |date=Sep 2015 |doi = 10.1109/TAES.2015.140843 |bibcode = 2015ITAES..51.2205E |s2cid = 32667132 }}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)