A recursive algorithm for computing Cramer-Rao-type bounds on estimator covariance
Authors:
- J.A. FesslerJFJ.A. Fessler
- 1 July 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (4) , 1205-1210
Abstract
We give a recursive algorithm to calculate submatrices of the Cramer-Rao (CR) matrix bound on the covariance of any unbiased estimator of a vector parameter /spl theta/_. Our algorithm computes a sequence of lower bounds that converges monotonically to the CR bound with exponential speed of convergence. The recursive algorithm uses an invertible "splitting matrix" to successively approximate the inverse Fisher information matrix. We present a statistical approach to selecting the splitting matrix based on a "complete-data-incomplete-data" formulation similar to that of the well-known EM parameter estimation algorithm. As a concrete illustration we consider image reconstruction from projections for emission computed tomography.Keywords
This publication has 9 references indexed in Scilit:
- A fast recursive algorithm for computing CR-type bounds for image reconstruction problems1992
- A Cramer-Rao Type Lower Bound for Essentially Unbiased Parameter Estimation1992
- Lower bounds for parametric estimation with constraintsIEEE Transactions on Information Theory, 1990
- Information analysis of single photon emission computed tomography with count lossesIEEE Transactions on Medical Imaging, 1990
- Matrix Analysis1985
- Maximum Likelihood Reconstruction for Emission TomographyIEEE Transactions on Medical Imaging, 1982
- Finding the Observed Information Matrix When Using the EM AlgorithmJournal of the Royal Statistical Society Series B: Statistical Methodology, 1982
- Statistical Estimation1981
- Maximum Likelihood from Incomplete Data Via the EM AlgorithmJournal of the Royal Statistical Society Series B: Statistical Methodology, 1977