By Topic

An Improved Form of Linogram Algorithm for Image Reconstruction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)

The implementation of the discrete ramp filter in the filtered backprojection (FBP) algorithms has been carefully investigated by Kak and Slane in Principles of Computerized Tomographic Imaging. In the linogram algorithms, however, it was rarely used in a correct way. Instead, an oversampling (zero-padding) factor of four is usually taken to reduce the dishing artifacts. We here improve the linogram algorithm by using a new strategy of weighting instead of in its original implementation. The new weighting is produced via the Fourier transform of the discrete ramp filter similar to that in Kak and Slaney. We explicitly derive the connection between the oversampling processing and the implementation of the discrete ramp filter in the spatial domain: if projection data are zero-padded to double length, with the discrete ramp filter, the effect is theoretically equivalent to zero-padding infinitely long in the original implementation; without zero-padding, the modified algorithm can obtain almost accurate reconstruction in the central part of an image. Our theoretical analysis also gives the optimal way of implementing the linogram algorithm, leading to savings in computational time and memory space. Results of theoretical analysis are validated by numerical simulations.

Published in:

Nuclear Science, IEEE Transactions on  (Volume:55 ,  Issue: 1 )