Complete-data spaces and generalized EM algorithms

1 January 1993

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

Vol. 4 (15206149) , 1-4 vol.4
https://doi.org/10.1109/icassp.1993.319579

Abstract

Expectation-maximization (EM) algorithms have been applied extensively for computing maximum-likelihood and penalized-likelihood parameter estimates in signal processing applications. Intrinsic to each EM algorithm is a complete-data space (CDS)-a hypothetical set of random variables that is related to the parameters more naturally than the measurements are. The authors describe two generalizations of the EM paradigm: (i) allowing the relationship between the CDS and the measured data to be nondeterministic, and (ii) using a sequence of alternating complete-data spaces. These generalizations are motivated in part by the influence of the CDS on the convergence rate, a relationship that is formalized through a data-processing inequality for Fisher information. These concepts are applied to the problem of estimating superimposed signals in Gaussian noise, and it is shown that the new space alternating generalized EM algorithm converges significantly faster than the ordinary EM algorithm.<>

Keywords

This publication has 6 references indexed in Scilit:

On complete-data spaces for PET reconstruction algorithms
IEEE Transactions on Nuclear Science, 1993
Hidden-data spaces for maximum-likelihood PET reconstruction
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
Joint maximum likelihood estimation of emission and attenuation densities in PET
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1991
Maximum likelihood localization of multiple sources by alternating projection
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1988
Parameter estimation of superimposed signals using the EM algorithm
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1988
Theory of Point Estimation
Published by Springer Nature ,1983