FOURIER RECONSTRUCTION OF A HEAD SECTION
FOURIER RECONSTRUCTION OF A HEAD SECTION
复制标题
DOI：
10.1109/tns.1974.6499235
复制
发表时间：
1974-01-01
影响因子：
1.8
通讯作者：
LOGAN, BF
中科院分区：
文献类型：
--
作者：
SHEPP, LA;LOGAN, BF
傅里叶重建可以在空间域中简单地视为每条线积分之和乘以从线到重建点的距离的加权函数（待选择）。拉马钱德兰的线性插值被认为是一种近似，只是特定权重函数的选择。修改后的加权函数同时实现了准确性、简单性、低计算时间以及对噪声的低敏感性。使用模拟体模，我们比较了傅里叶算法和搜索算法，与 Hounsfield4 在他的条件下描述的算法非常相似但不完全相同。搜索算法需要 12 次迭代才能获得与傅里叶重建相当的精度和分辨率的重建，并且对噪声更敏感。为了通过使用更少的迭代来加速搜索算法，会降低颅骨内部区域的分辨率，这可能会掩盖硬膜下血肿。
The Fourier reconstruction may be viewed simply in the spatial domain as the sum of each line integral times a weighting function (to be chosen) of the distance from the line to the point of reconstruction. Ramachandran's linear interpolation, thought to be an approximation, is merely the choice of a particular weighting function. A modified weighting function simultaneously achieves accuracy, simplicity, low computation time, as well as low sensitivity to noise. Using a simulated phantom, we compare the Fourier algorithm and a search algorithm, very similar but not identical to one described by Hounsfield4under his conditions, The search algorithm required 12 iterations to obtain a reconstruction of accuracy and resolution comparable to that of the Fourier reconstruction, and was more sensitive to noise. To speed the search algorithm by using fewer iterations leaves decreased resolution in the region just inside the skull which could mask a subdural hematoma.