A new algorithm for computer tomographic reconstruction from partial view projections
Creators
- 1. Istituto di Matematica e Fisica, Universita di Sassari, Via Vienna 2, 07100 Sassari (Italy)
Description
Conventional algorithms for tomographic reconstruction require the acquisition of a complete set of projections at uniform angular displacements. In many cases, however, the geometry of the sample or a loss of data can significantly reduce the range of the available projections. Several algorithms have been proposed in literature to handle such situations, but their performances are low or they require strong constraints and hypothesis about the nature of the sample or the data. Here a new method is proposed. It is based on a novel morphing technique, which affords in general terms the problem of curve matching and is here specialized to the case of tomographic reconstruction. The proposed algorithm is very fast in comparison to other approaches having similar effectiveness; furthermore, it allows one to obtain good quality images even when a significant fraction of the views is absent, without any hypothesis about the nature of the sample or the kind of measurement. The results obtained by applying this technique to the Shepp-Logan phantom and to a clinical scan are reported here and discussed
Additional details
Identifiers
- DOI
- 10.1118/1.1352577;
Publishing Information
- Journal Title
- Medical Physics
- Journal Volume
- 28
- Journal Issue
- 4
- Journal Page Range
- p. 462-468
- ISSN
- 0094-2405
- CODEN
- MPHYA6
INIS
- Country of Publication
- United States
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 35001857
- Subject category
- S62: RADIOLOGY AND NUCLEAR MEDICINE;
- Descriptors DEI
- ALGORITHMS; COMPUTERIZED TOMOGRAPHY; IMAGE PROCESSING; PHANTOMS; QUALITY ASSURANCE
- Descriptors DEC
- DIAGNOSTIC TECHNIQUES; MATHEMATICAL LOGIC; MOCKUP; PROCESSING; STRUCTURAL MODELS; TOMOGRAPHY
Optional Information
- Notes
- (c) 2001 American Association of Physicists in Medicine.