1987
DOI: 10.1109/tmi.1987.4307847
|View full text |Cite
|
Sign up to set email alerts
|

Linograms in Image Reconstruction from Projections

Abstract: The notion of a linogram is introduced. It corresponds to the notion of a sinogram in the conventional representation of projection data in image reconstruction. In the sinogram, points which correspond to rays which go through a fixed point in the cross section to be reconstructed all fall on a sinusoidal curve. In the linogram, however, these points fall on a straight line. Thus, backprojection corresponds to integration along straight lines in the linogram. A theorem is proved expressing the backprojection … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
55
1

Year Published

1992
1992
2022
2022

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 115 publications
(56 citation statements)
references
References 4 publications
0
55
1
Order By: Relevance
“…The relations (3,4,6) were first shown by Defrise et al in an unpublished note [9]. Also note that from (4) with y = −V 0 /U 0 we have that (10) This relationship is known as the frequency-distance relationship.…”
Section: Then We Have Thatmentioning
confidence: 84%
See 1 more Smart Citation
“…The relations (3,4,6) were first shown by Defrise et al in an unpublished note [9]. Also note that from (4) with y = −V 0 /U 0 we have that (10) This relationship is known as the frequency-distance relationship.…”
Section: Then We Have Thatmentioning
confidence: 84%
“…We name our rebinning algorithm the planogram frequency-distance rebinning algorithm (PFDR). The PFDR algorithm is derived in the planogram coordinate system [2] which is the native data format for PET systems with panel detectors and is the 3-D extension of the 2-D linogram transform developed by Edholm [3].…”
Section: Introductionmentioning
confidence: 99%
“…Fourier reconstruction algorithms for standard sampled Radon transforms have recently attained new attention in connection with fast Fourier transform algorithms for nonequispaced data [10,32,11,26]. These new algorithms improve known Fourier reconstruction algorithms as the UFR/gridding algorithm [17,18,23,27] or the linogram algorithm [7,28] with respect to the reconstruction speed and image quality. In contrast to the convenient filtered backprojection which ensures a good quality of the image at the expense of O(N 3 ) arithmetic operations, Fourier reconstruction methods require only O(N 2 log N) arithmetic operations.…”
Section: Theorem 2 [21 Theorem Iii31]mentioning
confidence: 99%
“…7 , compared to the 2DFT images, is a result of the number of views used in the reconstruction. To reconstruct a 256 x 256 image, as was done here, requires about 402 views for PR and about 512 views for LR to prevent any blurring (see (4)). The number of views used is substantially less than the ideally required number; this accounts for the blurring noticed.…”
mentioning
confidence: 99%