Abstract
We develop a relatively unexplored algorithm for reconstructing a two-dimensional image from a finite set of its sampled projections. The algorithm, which we refer to as the Hankel-transform reconstruction (HTR) algorithm, is polar-coordinate based. The algorithm expands the polar-form Fourier transform F(r, θ) of an image into a Fourier series in θ; calculates the appropriately ordered Hankel transform of the coefficients of this series, giving the coefficients for the Fourier series of the polar-form image f(p, Φ); resolves this series, giving a polar-form reconstruction; and finally, if desired, interpolates this reconstruction to a rectilinear grid. We outline the HTR algorithm and show that its performance can compare favorably to the popular convolution-backprojection algorithm.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 59-72 |
| Number of pages | 14 |
| Journal | IEEE transactions on medical imaging |
| Volume | 7 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 1988 |
All Science Journal Classification (ASJC) codes
- Software
- Radiological and Ultrasound Technology
- Computer Science Applications
- Electrical and Electronic Engineering
Fingerprint
Dive into the research topics of 'A Hankel Transform Approach to Tomographic Image Reconstruction'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver