Related Experiment Video
Updated: Jul 8, 2026

A Basic Positron Emission Tomography System Constructed to Locate a Radioactive Source in a Bi-dimensional Space
Published on: February 1, 2016
On the convergence of an EM-type algorithm for penalized likelihood estimation in emission tomography
1Dept. of Appl. Math., State Univ. of Campinas.
A new convergence proof for the expectation maximization (EM) algorithm handles regularization terms. This advance applies to penalized likelihood estimation in tomography, broadening its applicability.
Area of Science:
- Statistical modeling
- Computational mathematics
- Image reconstruction
Background:
- The expectation maximization (EM) algorithm is widely used for parameter estimation in statistical models.
- Existing extensions of EM struggle with convergence proofs for certain regularization terms.
- Penalized likelihood estimation is crucial in fields like tomography for improving image quality.
Purpose of the Study:
- To present a generalized convergence result for the expectation maximization (EM) algorithm with regularization terms.
- To validate the applicability of the proposed method for penalized likelihood estimation in tomography.
- To establish a more robust theoretical foundation for EM algorithms incorporating penalty functions.
Main Methods:
- Development of a novel convergence proof for the expectation maximization (EM) algorithm.
- Analysis of the mathematical properties of continuous differentiability for penalty terms.
- Extension of the convergence result to other penalized likelihood estimation techniques.
Main Results:
- A simple convergence result is established for the expectation maximization (EM) algorithm with regularization.
- The proof requires only continuous differentiability of the penalty term, a less restrictive condition.
- The convergence result is shown to be extendable to other penalized likelihood methods in tomography.
Conclusions:
- The proposed convergence result significantly enhances the reliability of expectation maximization (EM) algorithms with regularization.
- This work provides a more broadly applicable theoretical framework for penalized likelihood estimation in complex inverse problems.
- The findings are particularly relevant for advancing image reconstruction techniques in medical imaging and other tomographic applications.
More Related Videos
14:21Creating Dynamic Images of Short-lived Dopamine Fluctuations with lp-ntPET: Dopamine Movies of Cigarette Smoking
Published on: August 6, 2013
12:24Computed Tomography-guided Time-domain Diffuse Fluorescence Tomography in Small Animals for Localization of Cancer Biomarkers
Published on: July 17, 2012
Related Concept Videos
Positron Emission Tomography
One of the main requirements of a PET scan is a positron-emitting radioisotope, which is produced in a cyclotron and then attached to a substance used by the part of the body being...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Computed Tomography
The technique was invented in the 1970s and is based on the principle that as X-rays pass through the body, they are absorbed or reflected at different levels. In the technique, a patient lies on a motorized platform while a computerized axial tomography (CAT) scanner rotates...
Imaging Studies II: Positron Emission Tomography and Scintigraphy
Fundamental Principles of PET
Imaging Studies III: Computed Tomography
Region of Convergence of Laplace Tarnsform
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This substitution...