Generalized Algorithms for Direct Reconstruction of Parametric Images From Dynamic PET Data

Indirect and direct methods have been developed for reconstructing parametric images from dynamic positron emission tomography (PET) data. Indirect methods are simple and easy to implement because reconstruction and kinetic modeling are performed in two separate steps. Direct methods estimate parame...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on medical imaging 2009-11, Vol.28 (11), p.1717-1726
Main Authors: Wang, Guobao, Qi, Jinyi
Format: Article
Language:English
Subjects:
Algorithms
Biological system modeling
Biomedical engineering
Blood Flow Velocity - physiology
Brain - physiology
Computer Simulation
Image Processing, Computer-Assisted - methods
Image reconstruction
Iterative algorithms
Iterative methods
kinetic modeling
Kinetic theory
Kinetics
Least squares methods
Least-Squares Analysis
Models, Biological
parametric imaging
penalized maximum likelihood
Phantoms, Imaging
Pixel
Positron emission tomography
Positron-Emission Tomography - methods
Reconstruction algorithms
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Indirect and direct methods have been developed for reconstructing parametric images from dynamic positron emission tomography (PET) data. Indirect methods are simple and easy to implement because reconstruction and kinetic modeling are performed in two separate steps. Direct methods estimate parametric images directly from dynamic PET sinograms and, in theory, can be statistically more efficient, but the algorithms are often difficult to implement and are very specific to the kinetic model being used. This paper presents a class of generalized algorithms for direct reconstruction of parametric images that are relatively easy to implement and can be adapted to different kinetic models. The proposed algorithms use optimization transfer principle to convert the maximization of a penalized likelihood into a pixel-wise weighted least squares (WLS) kinetic fitting problem at each iteration. Thus, it can employ existing WLS algorithms developed for kinetic models. The proposed algorithms resemble the empirical iterative implementation of the indirect approach, but converge to a solution of the direct formulation. Computer simulations showed that the proposed direct reconstruction algorithms are flexible and achieve a better bias-variance tradeoff than indirect reconstruction methods.
ISSN:0278-0062
1558-254X
DOI:10.1109/TMI.2009.2021851