{'fraction_non_alphanumeric': 0.017699115044247787, 'fraction_numerical': 0.0050568900126422255, 'mean_word_length': 5.711864406779661, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Unified approach to regularized maximum-likelihood estimation in computed tomography

Since 1982, when it was first proposed by Shepp and Vardi, the Expectation Maximization (EM) algorithm has become very popular among researchers in image reconstruction. Recently, a natural extension of the EM algorithm was proposed in order to handle regularization terms containing `a priori' information for emission computed tomography problems. This new idea was further applied to other regularized maximum likelihood problems in transmission and emission tomography. We present in this article a unified approach to more general regularized ML problems. Our convergence proofs also extend those given in the previous papers allowing more general regularizations. We report on numerical simulations.