Hidden-data spaces for maximum-likelihood PET reconstruction
The author shows that expectation-maximization (EM) algorithms based on smaller complete data spaces will typically converge faster. As an example, he compares the two maximum-likelihood (ML) image reconstruction algorithms of D. G. Politte and D. L. Snyder (1991) which are based on measurement models that account for attenuation and accidental coincidences in positron-emission tomography (PET).<<ETX>>