Fast local reconstruction by selective backprojection for low dose in dental computed tomography

The high radiation dose in computed tomography （CT） scans increases the lifetime risk of cancer, which becomes a major clinical concern. The backprojection-filtration （BPF） algorithm could reduce the radiation dose by reconstructing the images from truncated data in a short scan. In a dental CT, it could reduce the radiation dose for the teeth by using the projection acquired in a short scan, and could avoid irradiation to the other part by using truncated projection. However, the limit of integration for backprojection varies per PI-line, resulting in low calculation efficiency and poor parallel performance. Recently, a tent BPF has been proposed to improve the calculation efficiency by rearranging the projection. However, the memory-consuming data rebinning process is included. Accordingly, the selective BPF （S-BPF） algorithm is proposed in this paper. In this algorithm, the derivative of the projection is backprojected to the points whose x coordinate is less than that of the source focal spot to obtain the differentiated backprojection. The finite Hilbert inverse is then applied to each PI-line segment. S-BPF avoids the influence of the variable limit of integration by selective backprojection without additional time cost or memory cost. The simulation experiment and the real experiment demonstrated the higher reconstruction efficiency of S-BPF.     

半覆盖锥束CT中扁平物体的高效反投影滤波重建

全覆盖圆轨迹扫描的成像视野受探测器宽度限制, 对于大物体的成像效率较低.半覆盖扫描可以将成像视野扩展近1倍, 图像重建首推使用反投影滤波型算法. 反投影滤波型算法按PI线重建, 各PI线积分区间的不一致性导致通信和计算消耗大, 影响重建效率. 针对半覆盖成像中扁平形状物体的重建问题, 提出了一种改进的反投影滤波型算法, 且证明了当扁平物体的厚度小于2Rsin(2π/N_p) (R为扫描半径, N_p 为圆扫描一周均匀采集的投影数量)时, PI线积分区间的不一致性在数值计算过程中的误差是可以忽略的. 改进后的算法相比原半覆盖反投影滤波算法具有两个明显的优势: 一是数值计算过程中角度循环移至PI线循环之外, 算法的通信需求显著降低; 二是投影数据求导、反投影和沿PI线滤波三个步骤均能够并行计算, 算法的并行性得到增强.数值仿真与实际数据的实验结果表明, 本文算法与原半覆盖反投影滤波算法的重建精度相当, 但计算效率提高了4.6倍. 关键词： 锥束CT 半覆盖成像 反投影滤波 PI线     

一种圆轨迹锥束CT中截断投影数据的高效重建算法

本文基于数据重排方法, 提出了T-BPF (Tent-BPF)算法, 该算法先将锥束投影数据重排成平行投影数据, 然后使用一种推导的BPF型算法重建重排后的平行投影数据. T-BPF算法将原BPF算法反投影中变化的角度积分限变成固定的, 反投影中各层循环之间没有了相关性, 这意味着T-BPF算法较原BPF算法具有更好的可并行性. 实验结果显示: 使用GPU对256³的Shepp-Logan体模的图像重建进行并行加速, T-BPF算法在保证重建质量的前提下, 加速比达到了1036, 较原BPF算法有很大提升. T-BPF算法为截断投影数据的3D图像快速重建提供了方法. 关键词： X射线光学 CT 图像重建 GPU     

基于欧姆加热模型的一类非局部双曲方程解的渐近性态

In this paper,the asymptotic behavior of a non-local hyperbolic problem modelling Ohmic heating is studied.It is found that the behavior of the solution of the hyperbolic problem only has three cases:the solution is globally bounded and the unique steady state is globally asymptotically stable;the solution is infinite when t→∞;the solution blows up.If the solution blows up,the blow-up is uniform on any compact subsets of(0,1] and the blow-up rate is lim t → T*-u(x,t)(T*-t)1/α+βp-1=(α+βp-1/1-α)1/1-α-βp,where T* is the blow-up time.     

Fast local reconstruction by selective backprojection for low dose in dental computed tomography

The high radiation dose in computed tomography (CT) scans increases the lifetime risk of cancer, which becomes a major clinical concern. The backprojection-filtration (BPF) algorithm could reduce the radiation dose by reconstructing the images from truncated data in a short scan. In a dental CT, it could reduce the radiation dose for the teeth by using the projection acquired in a short scan, and could avoid irradiation to the other part by using truncated projection. However, the limit of integration for backprojection varies per PI-line, resulting in low calculation efficiency and poor parallel performance. Recently, a tent BPF has been proposed to improve the calculation efficiency by rearranging the projection. However, the memory-consuming data rebinning process is included. Accordingly, the selective BPF (S-BPF) algorithm is proposed in this paper. In this algorithm, the derivative of the projection is backprojected to the points whose x coordinate is less than that of the source focal spot to obtain the differentiated backprojection. The finite Hilbert inverse is then applied to each PI-line segment. S-BPF avoids the influence of the variable limit of integration by selective backprojection without additional time cost or memory cost. The simulation experiment and the real experiment demonstrated the higher reconstruction efficiency of S-BPF.     

Cone-beam local reconstruction based on a Radon inversion transformation

The local reconstruction from truncated projection data is one area of interest in image reconstruction for computed tomography(CT),which creates the possibility for dose reduction.In this paper,a filtered-backprojection(FBP) algorithm based on the Radon inversion transform is presented to deal with the three-dimensional(3D) local reconstruction in the circular geometry.The algorithm achieves the data filtering in two steps.The first step is the derivative of projections,which acts locally on the data and can thus be carried out accurately even in the presence of data truncation.The second step is the nonlocal Hilbert filtering.The numerical simulations and the real data reconstructions have been conducted to validate the new reconstruction algorithm.Compared with the approximate truncation resistant algorithm for computed tomography(ATRACT),not only it has a comparable ability to restrain truncation artifacts,but also its reconstruction efficiency is improved.It is about twice as fast as that of the ATRACT.Therefore,this work provides a simple and efficient approach for the approximate reconstruction from truncated projections in the circular cone-beam CT.