Iterative reconstruction
This article needs additional citations for verification. (July 2007) |
Iterative reconstruction refers to
techniques. For example, inBasic concepts
The reconstruction of an image from the acquired data is an inverse problem. Often, it is not possible to exactly solve the inverse problem directly. In this case, a direct algorithm has to approximate the solution, which might cause visible reconstruction artifacts in the image. Iterative algorithms approach the correct solution using multiple iteration steps, which allows to obtain a better reconstruction at the cost of a higher computation time.
There are a large variety of algorithms, but each starts with an assumed image, computes projections from the image, compares the original projection data and updates the image based upon the difference between the calculated and the actual projections.
Algebraic reconstruction
The Algebraic Reconstruction Technique (ART) was the first iterative reconstruction technique used for
iterative Sparse Asymptotic Minimum Variance
The iterative Sparse Asymptotic Minimum Variance algorithm is an iterative, parameter-free superresolution tomographic reconstruction method inspired by compressed sensing, with applications in synthetic-aperture radar, computed tomography scan, and magnetic resonance imaging (MRI).
Statistical reconstruction
There are typically five components to statistical iterative image reconstruction algorithms, e.g.[3]
- An object model that expresses the unknown continuous-space function that is to be reconstructed in terms of a finite series with unknown coefficients that must be estimated from the data.
- A system model that relates the unknown object to the "ideal" measurements that would be recorded in the absence of measurement noise. Often this is a linear model of the form , where represents the noise.
- A Poisson statisticsare closer to reality, it is more widely used.
- A Markov random fields.
- An algorithm, usually iterative, for minimizing the cost function, including some initial estimate of the image and some stopping criterion for terminating the iterations.
Learned Iterative Reconstruction
In learned iterative reconstruction, the updating algorithm is learned from training data using techniques from
Advantages
The advantages of the iterative approach include improved insensitivity to
Statistical, likelihood-based approaches: Statistical, likelihood-based iterative
are now the preferred method of reconstruction. Such algorithms compute estimates of the likely distribution of annihilation events that led to the measured data, based on statistical principle, often providing better noise profiles and resistance to the streak artifacts common with FBP. Since the density of radioactive tracer is a function in a function space, therefore of extremely high-dimensions, methods which regularize the maximum-likelihood solution turning it towards penalized or maximum a-posteriori methods can have significant advantages for low counts. Examples such as Ulf Grenander's Sieve estimator[9][10] or Bayes penalty methods, may yield superior performance to expectation-maximization-based methods which involve a Poisson likelihood function only.As another example, it is considered superior when one does not have a large set of projections available, when the projections are not distributed uniformly in angle, or when the projections are sparse or missing at certain orientations. These scenarios may occur in
require the exclusion of some portions of the projection data.In
In
Here is an example that illustrates the benefits of iterative image reconstruction for cardiac MRI.[21]
See also
- Tomographic reconstruction
- Positron Emission Tomography
- Tomogram
- Computed Tomography
- Magnetic Resonance Imaging
- Inverse problem
- Osem
- Deconvolution
- Inpainting
- Algebraic Reconstruction Technique
- iterative Sparse Asymptotic Minimum Variance
References
- ^ Herman, G. T., Fundamentals of computerized tomography: Image reconstruction from projection, 2nd edition, Springer, 2009
- S2CID 16569156.
- PMID 18218505.
- S2CID 26897002.
- PMID 29115689.
- ^ S2CID 8268489.
- PMID 6608535.
- .
- S2CID 2112617.
- S2CID 30033603.
- ^ Geman, Stuart; McClure, Donald E. (1985). "Bayesian image analysis: An application to single photon emission tomography" (PDF). Proceedings Amererican Statistical Computing: 12–18.
- PMID 18222753.
- S2CID 23733140.
- PMID 2014243.
- PMID 18215947.
- PMID 21357521. Archived from the originalon 2011-12-01.
- PMID 11590639.)
{{cite journal}}
: CS1 maint: multiple names: authors list (link - S2CID 16396739.)
{{cite journal}}
: CS1 maint: multiple names: authors list (link - PMID 21135916.
- ISBN 978-3-319-18430-2.
- ^ I Uyanik, P Lindner, D Shah, N Tsekos I Pavlidis (2013) Applying a Level Set Method for Resolving Physiologic Motions in Free-Breathing and Non-gated Cardiac MRI. FIMH, 2013, "Computational Physiology Lab" (PDF). Archived from the original (PDF) on 2018-07-22. Retrieved 2013-10-01.
- PMID 12368373.
- ^ Grishentcev A. Jr (2012). "Effective compression of images on the basis of differential analysis" (PDF). Journal of Radio Electronics. 11: 1–42.