By Topic

A CramÉr-Rao Bound Characterization of the EM-Algorithm Mean Speed of Convergence

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
CÉdric Herzet ; INRIA/IRISA, Univ. de Beaulieu, Rennes ; ValÉry Ramon ; Alexandre Renaux ; Luc Vandendorpe

This paper deals with the mean speed of convergence of the expectation-maximization (EM) algorithm. We show that the asymptotic behavior (in terms of the number of observations) of the EM algorithm can be characterized as a function of the Cramer-Rao bounds (CRBs) associated to the so-called incomplete and complete data sets defined within the EM-algorithm framework. We particularize our result to the case of a complete data set defined as the concatenation of the observation vector and a vector of nuisance parameters, independent of the parameter of interest. In this particular case, we show that the CRB associated to the complete data set is nothing but the well-known modified CRB. Finally, we show by simulation that the proposed expression enables to properly characterize the EM-algorithm mean speed of convergence from the CRB behavior when the size of the observation set is large enough.

Published in:

IEEE Transactions on Signal Processing  (Volume:56 ,  Issue: 6 )