Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
Comparative Study
. 2000 Apr;19(4):286-94.
doi: 10.1109/42.848180.

Fast maximum entropy approximation in SPECT using the RBI-MAP algorithm

Affiliations
Comparative Study

Fast maximum entropy approximation in SPECT using the RBI-MAP algorithm

D S Lalush et al. IEEE Trans Med Imaging. 2000 Apr.

Abstract

In this work, we present a method for approximating constrained maximum entropy (ME) reconstructions of SPECT data with modifications to a block-iterative maximum a posteriori (MAP) algorithm. Maximum likelihood (ML)-based reconstruction algorithms require some form of noise smoothing. Constrained ME provides a more formal method of noise smoothing without requiring the user to select parameters. In the context of SPECT, constrained ME seeks the minimum-information image estimate among those whose projections are a given distance from the noisy measured data, with that distance determined by the magnitude of the Poisson noise. Images that meet the distance criterion are referred to as feasible images. We find that modeling of all principal degrading factors (attenuation, detector response, and scatter) in the reconstruction is critical because feasibility is not meaningful unless the projection model is as accurate as possible. Because the constrained ME solution is the same as a MAP solution for a particular value of the MAP weighting parameter, beta, the constrained ME solution can be found with a MAP algorithm if the correct value of beta is found. We show that the RBI-MAP algorithm, if used with a dynamic scheme for estimating beta, can approximate constrained ME solutions in 20 or fewer iterations. We compare results for various methods of achieving feasible images on a simulation of Tl-201 cardiac SPECT data. Results show that the RBI-MAP ME approximation provides images and quantitative estimates close to those from a slower algorithm that gives the true ME solution. Also, we find that the ME results have higher spatial resolution and greater high-frequency noise content than a feasibility-based stopping rule, feasibility-based low-pass filtering, and a quadratic Gibbs prior with beta selected according to the feasibility criterion. We conclude that fast ME approximation is possible using either RBI-MAP with the dynamic procedure or a feasibility-based stopping rule, and that such reconstructions may be particularly useful in applications where resolution is critical.

PubMed Disclaimer

Comment in

Similar articles

Cited by

Publication types

LinkOut - more resources