O(N/sup 2/ log N) native fan-beam tomographic reconstruction

We present a new fast backprojection algorithm for CT fan-beam reconstruction. The new algorithm operates directly on fan-beam data without prior rebinning to parallel-beam projections. The algorithm reduces the computational complexity from O(N/sup 3/) for the traditional fan-beam algorithm to O(N/...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2002 IEEE International Symposium on Biomedical Imaging : proceedings : July 7-10, 2002, Ritz-Carlton Hotel, Washington, D.C., USA s. 824 - 827
Hlavní autoři: Shu Xiao, Bresler, Y., Munson, D.C.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2002
Témata:
Computational complexity
Computational efficiency
Computational modeling
Computed tomography
Degradation
Filtering
Geometry
Image quality
Image reconstruction
Interpolation
ISBN:078037584X, 9780780375840
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We present a new fast backprojection algorithm for CT fan-beam reconstruction. The new algorithm operates directly on fan-beam data without prior rebinning to parallel-beam projections. The algorithm reduces the computational complexity from O(N/sup 3/) for the traditional fan-beam algorithm to O(N/sup 2/ log N). Simulations demonstrate speedups of greater than 50-fold for a 512 /spl times/ 512 image, with no perceivable degradation in accuracy. The algorithm also applies to multi-slice helical 3D reconstruction, and extends to 3D cone-beam reconstruction.
ISBN:078037584X
9780780375840
DOI:10.1109/ISBI.2002.1029386