scholarly journals Toward quantitative short-scan cone beam CT using shift-invariant filtered-backprojection with equal weighting and image domain shading correction

2019 ◽  
Author(s):  
Linxi Shi ◽  
Lei Zhu ◽  
Adam Wang
Keyword(s):  
Cone Beam Ct ◽  
Cone Beam ◽  
Filtered Backprojection ◽  
Image Domain ◽  
Equal Weighting

Regularized iterative weighted filtered backprojection for helical cone-beam CT

2008 ◽  
Vol 35 (9) ◽  
pp. 4173-4185 ◽  
Author(s):  
Johan Sunnegårdh ◽  
Per-Erik Danielsson
Keyword(s):  
Cone Beam Ct ◽  
Cone Beam ◽  
Filtered Backprojection

scholarly journals Image-domain shading correction for cone-beam CT without prior patient information

2015 ◽  
Vol 16 (6) ◽  
pp. 65-75 ◽  
Author(s):  
Qiyong Fan ◽  
Bo Lu ◽  
Justin C. Park ◽  
Tianye Niu ◽  
Jonathan G. Li ◽  
...  
Keyword(s):  
Patient Information ◽  
Cone Beam Ct ◽  
Cone Beam ◽  
Image Domain

WE-G-217BCD-10: Shading Correction in Image Domain for Cone-Beam CT Without Prior Information

2012 ◽  
Vol 39 (6Part28) ◽  
pp. 3974-3974
Author(s):  
Q Fan ◽  
T Niu ◽  
L Zhu
Keyword(s):  
Prior Information ◽  
Cone Beam Ct ◽  
Cone Beam ◽  
Image Domain

A short-scan reconstruction for cone-beam CT using shift-invariant FBP and equal weighting

2007 ◽  
Vol 34 (11) ◽  
pp. 4422-4438 ◽  
Author(s):  
Lei Zhu ◽  
Sungwon Yoon ◽  
Rebecca Fahrig
Keyword(s):  
Cone Beam Ct ◽  
Cone Beam ◽  
Equal Weighting

scholarly journals Parallel Implementation of Katsevich's FBP Algorithm

2006 ◽  
Vol 2006 ◽  
pp. 1-8 ◽  
Author(s):  
Jiansheng Yang ◽  
Xiaohu Guo ◽  
Qiang Kong ◽  
Tie Zhou ◽  
Ming Jiang
Keyword(s):  
Numerical Experiments ◽  
Parallel Implementation ◽  
Cone Beam Ct ◽  
Computation Time ◽  
Cone Beam ◽  
Filtered Backprojection ◽  
Typical Experiment ◽  
Linux Cluster ◽  
Parallel Reconstruction ◽  
Reconstruction Time

For spiral cone-beam CT, parallel computing is an effective approach to resolving the problem of heavy computation burden. It is well known that the major computation time is spent in the backprojection step for either filtered-backprojection (FBP) or backprojected-filtration (BPF) algorithms. By the cone-beam cover method [1], the backprojection procedure is driven by cone-beam projections, and every cone-beam projection can be backprojected independently. Basing on this fact, we develop a parallel implementation of Katsevich's FBP algorithm. We do all the numerical experiments on a Linux cluster. In one typical experiment, the sequential reconstruction time is 781.3 seconds, while the parallel reconstruction time is 25.7 seconds with 32 processors.

SU-GG-I-18: An Image-Domain Based Cone Beam CT Scatter Correction Method

2008 ◽  
Vol 35 (6Part3) ◽  
pp. 2646-2647
Author(s):  
X Li ◽  
T Li ◽  
Y Yang ◽  
D Heron ◽  
M Huq
Keyword(s):  
Cone Beam Ct ◽  
Scatter Correction ◽  
Correction Method ◽  
Cone Beam ◽  
Image Domain ◽  
I 18
Sign in / Sign up

Export Citation Format

Share Document