摘要
为了加快工业CT系统的扫描速度,减小数据量,针对扇形束超短扫描问题,提出了一种带参数的基于Hilbert变换的感兴趣区域重建算法,并且在分析扇形束扫描的数据冗余基础上设计了一种适用于超短扫描的窗函数。利用Shepp-Logan头模型通过计算机模拟实验,给出了该算法和标准卷积反投影算法、F.Noo和H.Kudo算法的对比结果。实验结果表明,该方法能够准确地实现物体感兴趣区重建,并在噪声抑制能力上优于其他3种算法,因此在工业CT中具有重要的工程意义。
This paper presents an algorithm for region-of-interest (ROI) image reconstruction from fan-beam projections for rapid scanning of industrial CT. The algorithm is given relating the scanning range and the region of interest (ROI) for exact reconstructions with an analysis of the redundancy in fan-beam scanning data and the Hilbert transform. The reconstruction algorithm uses a weighting function to give results that are generally less susceptible to noise than previous F. Noo and H. Kudo algorithms using Shepp-Logan phantom. The algorithm can significantly improve the analysis of huge projection data set from large industrial CT.
出处
《清华大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2005年第6期795-798,共4页
Journal of Tsinghua University(Science and Technology)
基金
教育部博士点基金资助项目(20030003074)
关键词
超短扫描重建算法
数据冗余
HILBERT变换
卷积反投影
super-short-scan reconstruction algorithm
data redundancy
Hilbert transform
filtered back-projection (FBP)
