Fast parallel algorithm for three-dimensional distance-driven model in iterative computed tomography reconstruction

The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterative computed tomographic reconstruction.The distance-driven model(DDM) is a state-of-the-art technology that simulates forward and back projections.This model has a low computational complexity and a relatively high spatial resolution;however,it includes only a few methods in a parallel operation with a matched model scheme.This study introduces a fast and parallelizable algorithm to improve the traditional DDM for computing the parallel projection and backprojection operations.Our proposed model has been implemented on a GPU(graphic processing unit) platform and has achieved satisfactory computational efficiency with no approximation.The runtime for the projection and backprojection operations with our model is approximately 4.5 s and 10.5 s per loop,respectively,with an image size of 256×256×256 and 360 projections with a size of 512×512.We compare several general algorithms that have been proposed for maximizing GPU efficiency by using the unmatched projection/backprojection models in a parallel computation.The imaging resolution is not sacrificed and remains accurate during computed tomographic reconstruction.     

A Compton scattering image reconstruction algorithm based on total variation minimization

Compton scattering imaging is a novel radiation imaging method using scattered photons.Its main characteristics are detectors that do not have to be on the opposite side of the source,so avoiding the rotation process.The reconstruction problem of Compton scattering imaging is the inverse problem to solve electron densities from nonlinear equations,which is ill-posed.This means the solution exhibits instability and sensitivity to noise or erroneous measurements.Using the theory for reconstruction of sparse images,a reconstruction algorithm based on total variation minimization is proposed.The reconstruction problem is described as an optimization problem with nonlinear data-consistency constraint.The simulated results show that the proposed algorithm could reduce reconstruction error and improve image quality,especially when there are not enough measurements.     

非精确交替方向总变分最小化重建算法

CT (computed tomography)系统实际应用当中, 经常会出现扫描数据不满足数据完备性条件的情况. 针对不完全角度重建问题的研究, 是目前迭代型算法研究中的一个热点. 一系列基于带有约束的总变分最小化的重建算法近年来在不完全角度重建中取得了较好的效果, 这其中基于交替方向法 (alternating direction method, ADM) 的重建算法表现出更好的性能. 然而, ADM方法在求解过程中对矩阵求逆的处理效率不高, 导致极大的计算开销. 本文针对该问题, 使用非精确ADM方法, 利用线性近似的方式替换掉计算开销较大的项, 使得矩阵求逆问题可以通过快速傅里叶变换加速实现. 实验结果表明, 本文提出的非精确交替方向总变分最小化重建算法与精确ADM重建算法相比, 没有明显的精度损失, 计算时间缩减30%左右. 关键词： 不完全角度重建 总变分最小化 非精确交替方向法     

An algorithm for computed tomography image reconstruction from limited-view projections

<正>With the development of the compressive sensing theory,the image reconstruction from the projections viewed in limited angles is one of the hot problems in the research of computed tomography technology.This paper develops an iterative algorithm for image reconstruction,which can fit most cases.This method gives an image reconstruction flow with the difference image vector,which is based on the concept that the difference image vector between the reconstructed and the reference image is sparse enough.Then the l_2-norm minimization method is used to reconstruct the difference vector to recover the image for flat subjects in limited angles.The algorithm has been tested with a thin planar phantom and a real object in limited-view projection data.Moreover,all the studies showed the satisfactory results in accuracy at a rather high reconstruction speed.     

基于稀疏优化的计算机断层成像图像不完全角度重建综述

计算机断层成像(computed tomography,CT)技术在医学和工业无损检测中都具有非常广泛的应用,CT重建算法是其中的核心,而不完全角度重建问题则是实际应用中重建算法研究领域的一个热点和难点问题.近年来,随着稀疏优化理论与算法的飞速发展,基于稀疏优化的重建算法已经在不完全角度重建问题中得到了较广泛的应用,且表现出了良好的精度与速度性能.本文首先对稀疏优化的基本理论结论与常用算法进行了介绍;而后对稀疏优化理论在CT图像不完全角度重建中的应用进行归纳,分类介绍了其主要研究成果及稀疏优化所发挥的作用;最后对基于稀疏优化的不完全角度重建研究进行了展望.     

Optimization-based image reconstruction in x-ray computed tomography by sparsity exploitation of local continuity and nonlocal spatial self-similarity

The additional sparse prior of images has been the subject of much research in problems of sparse-view computed tomography(CT) reconstruction. A method employing the image gradient sparsity is often used to reduce the sampling rate and is shown to remove the unwanted artifacts while preserve sharp edges, but may cause blocky or patchy artifacts.To eliminate this drawback, we propose a novel sparsity exploitation-based model for CT image reconstruction. In the presented model, the sparse representation and sparsity exploitation of both gradient and nonlocal gradient are investigated.The new model is shown to offer the potential for better results by introducing a similarity prior information of the image structure. Then, an effective alternating direction minimization algorithm is developed to optimize the objective function with a robust convergence result. Qualitative and quantitative evaluations have been carried out both on the simulation and real data in terms of accuracy and resolution properties. The results indicate that the proposed method can be applied for achieving better image-quality potential with the theoretically expected detailed feature preservation.     

基于总变分最小化模型的异步并行GPU加速算法

相比于传统同步并行计算策略,在异步并行计算框架下,针对最常用的总变分(TV)最小化重建模型,通过将其转化为不动点迭代问题,并利用异步交替方向法(ADM)进行求解,推导出基于TV最小化模型的异步ADM迭代重建算法,即异步交替方向总变分最小化算法(Async-ADTVM)。利用消息传递接口技术将该算法在图形处理器(GPU)集群上进行测试,进一步提高了原始基于TV最小化模型的迭代重建算法的计算效率。实验表明,该算法在计算求解精度上略优于ADTVM算法,同时在GPU性能存在差异的条件下相比传统多GPU加速策略可获得更高的加速比。     

Image reconstruction based on total-variation minimization and alternating direction method in linear scan computed tomography

Linear scan computed tomography (LCT) is of great benefit to online industrial scanning and security inspection due to its characteristics of straight-line source trajectory and high scanning speed. However, in practical applications of LCT, there are challenges to image reconstruction due to limited-angle and insufficient data. In this paper, a new reconstruction algorithm based on total-variation (TV) minimization is developed to reconstruct images from limited-angle and insufficient data in LCT. The main idea of our approach is to reformulate a TV problem as a linear equality constrained problem where the objective function is separable, and then minimize its augmented Lagrangian function by using alternating direction method (ADM) to solve subproblems. The proposed method is robust and efficient in the task of reconstruction by showing the convergence of ADM. The numerical simulations and real data reconstructions show that the proposed reconstruction method brings reasonable performance and outperforms some previous ones when applied to an LCT imaging problem.     

Novel Fourier-based iterative reconstruction for sparse fan projection using alternating direction total variation minimization

Sparse-view x-ray computed tomography(CT) imaging is an interesting topic in CT field and can efficiently decrease radiation dose. Compared with spatial reconstruction, a Fourier-based algorithm has advantages in reconstruction speed and memory usage. A novel Fourier-based iterative reconstruction technique that utilizes non-uniform fast Fourier transform(NUFFT) is presented in this work along with advanced total variation(TV) regularization for a fan sparse-view CT. The proposition of a selective matrix contributes to improve reconstruction quality. The new method employs the NUFFT and its adjoin to iterate back and forth between the Fourier and image space. The performance of the proposed algorithm is demonstrated through a series of digital simulations and experimental phantom studies. Results of the proposed algorithm are compared with those of existing TV-regularized techniques based on compressed sensing method, as well as basic algebraic reconstruction technique. Compared with the existing TV-regularized techniques, the proposed Fourier-based technique significantly improves convergence rate and reduces memory allocation, respectively.     

基于加权TV正则化的X射线CT系统能谱估计方法

在CT硬化伪影校正、双能CT图像重建以及CT辐射剂量计算等实际应用中,X射线的能谱信息具有重要的作用。然而,由于透射测量方程组系数矩阵的病态性、X光子的统计涨落和噪声的干扰,使得EM等能谱估计方法难以获得较精细的能谱刻画。针对该问题,提出一种基于加权TV正则化的X射线CT系统能谱估计方法。首先采用能谱能量范围内带有不同K-edge的材料作为体模以降低投影测量方程之间的相关性。然后,利用CT成像系统的几何参数来获取投影测量数据所对应的准确透射长度信息来减小投影方程的测量误差。最后,综合利用透射衰减测量数据的保真性、轫致辐射能谱部分的连续性、特征辐射能谱部分的离散性、能谱的非负性和归一性以及平均有效衰减系数等信息,使用加权TV正则化方法建立目标函数,利用正则化理论中的L曲线准则通过黄金分割参数搜索策略求得最优正则化参数及对应的能谱估计结果。分别通过不同统计波动模型下的仿真能谱和实际测量数据对算法性能进行了验证,结果表明该方法与EM等方法相比,不受初始能谱的影响,有效提高了能谱估计结果的稳定性和准确性。