1973
DOI: 10.1088/0305-4470/6/3/011
|View full text |Cite
|
Sign up to set email alerts
|

Image reconstruction from finite numbers of projections

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
32
0

Year Published

1988
1988
2005
2005

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 141 publications
(32 citation statements)
references
References 20 publications
0
32
0
Order By: Relevance
“…The core of this approach is to add constraints to the unknowns so that the matrix can be solved. Various algorithms have been investigated in limited-view X-ray and CT imaging (12)(13)(14)(15)(16)(17)(18). These studies show that general constraints on characteristics including total variance, signal uniformity, and object shapes are able to reduce the ambiguity of the reconstruction.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…The core of this approach is to add constraints to the unknowns so that the matrix can be solved. Various algorithms have been investigated in limited-view X-ray and CT imaging (12)(13)(14)(15)(16)(17)(18). These studies show that general constraints on characteristics including total variance, signal uniformity, and object shapes are able to reduce the ambiguity of the reconstruction.…”
Section: Discussionmentioning
confidence: 99%
“…It has been shown in X-ray imaging that 3D data can be reconstructed from a limited number of projections (n Ͻ 10) without significant artifacts if the data are sufficiently sparse (12,13). However, assumptions about signal uniformity and/or structure connectivity are required as constraints to resolve the ambiguity problems of the reconstruction.…”
mentioning
confidence: 99%
“…Using the formalism of Bracewell and Thompson (14), Lauzon and Rutt (15) have shown that the polar PSF is given by the spin integration of $(r), where $(r) is the 1 D IFT of the discrete (as opposed to continuous) ramp filter, which is the weighting function of Eq. [6]. Thus, (r) are oscillatory and asymmetrical in the radial direction, with their peak amplitude occurring near (j/Akr).…”
Section: Aliasingmentioning
confidence: 95%
“…Also, these artifacts may depend on the reconstruction algorithm used. For uniform k-space polar sampling, i.e., equally spaced radial and azimuthal samples, the images may be reconstructed by using either the gridding algorithm (1)(2)(3)(4) or the convolution backprojection algorithm (5)(6)(7).…”
Section: Introductionmentioning
confidence: 99%
“…An inverse Fourier transform requires a continuous function and so radial interpolation is required to fill the gaps in Fourier space [37]; the quality of the reconstruction is greatly affected by the type of interpolation method used [45]. Although elegant, Fourier reconstruction methods have the disadvantage of being computationally intensive and difficult to implement for electron tomography.…”
Section: The Central Slice Theorem and Fourier Space Reconstructionmentioning
confidence: 99%