全变分约束迭代滤波反投影CT重建

重建算法是计算机断层成像(CT)技术的核心。在解析法CT重建过程中,结合先验信息和引入优化约束条件较为困难。通过对滤波反投影(FBP)原理及其重建图像与理想CT图像差值关系的分析,构造了以FBP为基础的迭代循环,解决了解析重建过程中先验信息的利用和优化约束条件的引入问题。为抑制迭代FBP产生的图像伪影,将全变分(TV)模型引入重建过程,建立了TV约束迭代滤波反投影CT重建方法。在数值模拟中,针对完善投影数据、稀疏投影数据、含金属投影数据和有限角投影数据等不同情况,重建出了与原始模型高度一致的CT图像,研究表明TV约束迭代滤波反投影方法是一种精度高、适应性较强的CT重建方法。     

基于物理总能量目标函数的稀疏重建模型

欠采样条件下的稀疏重建模型往往直接取稀疏约束项或保真项作为求解的目标函数, 却从未阐述其中的物理演化规律. 针对此问题, 从物理运动的角度出发, 提出了一种基于物理总能量目标函数的稀疏重建模型. 首先, 建立了微粒在黏性介质中的运动模型, 模型中粒子的重力势能函数为松弛变换后的l₂-l₁ 范数; 其次, 基于该微粒的物理总能量建立了新的稀疏重建模型, 该重建模型在保留l₂-l₁ 模型稀疏约束和保真项的基础上, 增加了对相邻两次迭代结果偏差的约束, 避免因该偏差过大引起的震荡; 第三, 提出了针对该模型的梯度投影算法, 并证明了算法的收敛性, 算法在新模型目标函数下的梯度方向总是包含上一步迭代的物理惯性, 从而达到加速收敛和避免局部最优解的目的; 最后, 将该模型应用于标准灰度图像的稀疏重建以及精密电子组装中微焦点X射线缺陷检测. 实验结果表明, 该算法不仅保证了图像的重建质量, 收敛速度还得到了大幅提升. 在精密电子组装内部缺陷检测应用中, 该算法在微焦点X射线图像的边缘细节保留方面有明显的优势, 可更准确地识别缺陷, 满足工业应用快速性和准确性要求.     

基于加权块稀疏联合非凸低秩约束的高光谱图像去条带方法

针对高光谱图像（hyperspectral images, HSI）去条带易引起影像结构细节丢失问题,提出一种基于加权块稀疏（weighted block sparsity, WBS）正则化联合最小最大非凸惩罚（minimax concave penalty, MCP）约束的HSI去条带方法。本算法采用加权?_{2, 1}范数和MCP范数对条带稀疏结构和低秩约束,?₁范数对干净图像结构保持正则化约束,构建加权块稀疏和MCP约束的条带去除模型,采用交替方向乘子（alternating direction method of multipliers, ADMM）算法迭代求解对应模型,重建获得干净的HSI图像。实验结果表明,提出方法在实际HSI的平均等效视数从28.45提高到83.47,边缘保持指数较其他算法至少增加0.056,特别是对于非周期条带噪声,采用自适应权值更新稀疏水平,增强了组稀疏性,在保持影像边缘和加强区域平滑性方面性能更佳,去噪声效果更好。     

基于加权总差分最小化的中子稀疏投影计算机断层重建方法

为提升高噪声稀疏角度投影条件下中子计算机断层扫描(CT)质量,提出同时迭代重建方法(SIRT)与加权总差分最小化(WTDM)相结合的迭代重建方法(SIRT-WTDM)。在有无噪声情况下比较代数重建算法、联合代数重建算法及同时迭代重建算法的重建图像,证明了SIRT迭代重建具有较高的图像重建精度与较强的抗噪声性能,因此将SIRT作为高噪声中子投影图像CT迭代重建算法的保真项。考虑到对图像梯度稀疏性与连续性的约束,中子CT迭代重建方法的正则化约束项采用WTDM方法。由Shepp-Logan模体与真实冷中子层析扫描数据验证可知,在极端稀疏角度投影条件下,SIRT-WTDM可获得较好的重建效果。     

由少量投影数据快速重建图像的迭代算法

针对由少最角度的投影数据重建CT图像的问题,提出了一种改进的基于图像总变差最小的迭代重建算法.该算法采用共轭梯度法求图像总变差最小,并在迭代过程中采用了多分辨迭代技术.用模拟的投影数据和实际扫描数据进行了重建数值实验.实验结果表明该算法不但提高了重建图像质量,也同时显著提高了迭代图像的收敛速度.     

用于压缩感知磁共振成像的分割字典学习算法

字典学习算法可以根据数据本身的特点构建稀疏域中的基,从而使数据的表示更加稀疏.该文在传统的字典学习算法基础上提出了分割字典学习算法,由于部分磁共振图像组织结构简单、可以进行图像分割,因此可根据此特点来优化字典中基函数的构建,使磁共振图像的表达更为稀疏,从而获得更高的重建图像质量.该文利用模拟数据和真实数据进行了重建实验,结果表明与传统的字典学习算法相比,分割字典学习算法能进一步改善重建图像质量.     

稀疏张量约束的低剂量CT图像重建

提出了一种稀疏张量约束重建算法,该方法利用非局部相似的先验信息,将CT图像分割成一系列图像块组;采用张量的多维低秩分解方法,将这一先验信息引入低剂量CT重建中,构造目标函数;通过重建图像更新和图像块组张量稀疏编码两个步骤,交替迭代求解目标函数。基于仿真数据和临床数据的实验结果验证了该算法的有效性,实验结果表明:与经典重建算法相比,所提算法在抑制噪声的同时,能更好地保持重建图像的细节,获得更高质量的图像。     

改进的约束共轭梯度闪光照相图像重建算法

 针对闪光照相图像信噪比低的特点,提出了一种改进的约束共轭梯度闪光照相图像重建算法。该算法在约束共轭梯度迭代重建的基础上,提出了新的预优矩阵选取方案,减小了重建图像的轴线噪声,利用松弛迭代步长代替共轭梯度法中的最优迭代步长,并采用了新的收敛准则,在保证算法收敛的同时,减少了重建算法的计算量。数值试验表明,与传统约束共轭梯度重建算法相比,改进算法稳定收敛,迭代速度更快,并能有效提高重建质量。     

双树小波变换与小波树稀疏联合的低场CS-MRI算法

压缩感知理论常用在磁共振快速成像上,仅采样少量的K空间数据即可重建出高质量的磁共振图像.压缩感知磁共振成像技术的原理是将磁共振图像重建问题建模成一个包含数据保真项、稀疏先验项和全变分项的线性组合最小化问题,显著减少磁共振扫描时间.稀疏表示是压缩感知理论的一个关键假设,重建结果很大程度上依赖于稀疏变换.本文将双树复小波变换和小波树稀疏联合作为压缩感知磁共振成像中的稀疏变换,提出了基于双树小波变换和小波树稀疏的压缩感知低场磁共振图像重建算法.实验表明,本文所提算法可以在某些磁共振图像客观评价指标中表现出一定的优势.     

基于超限化的吸收层析反演算法研究

针对吸收光谱层析（tomographic absorption spectroscopy，TAS）中的反问题，利用超限化（superiorization）在重建中引入平滑性、稀疏性等先验条件，对现有的层析反演算法提出了改进.通过计算机仿真，对代数重建（algebraic reconstruction technique，ART）算法、最大似然期望最大化（maximum likelihod expectation maximization，MLEM）算法的超限化在TAS反演中的应用进行了研究.在仿真中，对比了不同二维火焰场、不同目标约束函数下超限化算法的效果，研究了噪声对重建的影响以及超限化算法在不同条件下的计算效率.研究结果证实了超限化对于层析反演算法在计算精度、收敛速度等方面的提升效果.      

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.     

Compressed sensing MR image reconstruction using a motion-compensated reference

Compressed sensing (CS)-based methods have been proposed for image reconstruction from undersampled magnetic resonance data. Recently, CS-based schemes using reference images have also been proposed to further reduce the sampling requirement. In this study, we propose a new reference-constrained CS reconstruction method that accounts for the misalignment between the reference and the target image to be reconstructed. The proposed method uses a new image model that represents the target image as a linear combination of a motion-dependent reference image and a sparse difference image. We then use an efficient iterative algorithm to jointly estimate the motion parameters and the difference image from sparsely sampled data. Simulation results from a numerical phantom data set and an in vivo data set show that the proposed method can accurately compensate the motion effects between the reference and the target images and improve reconstruction quality. The proposed method should prove useful for several applications such as interventional imaging, longitudinal imaging studies and dynamic contrast-enhanced imaging.     

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.     

Iterative image reconstruction algorithms using wave-front intensity and phase variation

Iterative algorithms that reconstruct images from far-field x-ray diffraction data are plagued with convergence difficulties. An iterative image reconstruction algorithm is described that ameliorates these convergence difficulties through the use of diffraction data obtained with illumination modulated in both intensity and phase.     

Fast multi-contrast MRI reconstruction

Multi-contrast magnetic resonance imaging (MRI) is a useful technique to aid clinical diagnosis. This paper proposes an efficient algorithm to jointly reconstruct multiple T1/T2-weighted images of the same anatomical cross section from partially sampled k-space data. The joint reconstruction problem is formulated as minimizing a linear combination of three terms, corresponding to a least squares data fitting, joint total variation (TV) and group wavelet-sparsity regularization. It is rooted in two observations: 1) the variance of image gradients should be similar for the same spatial position across multiple contrasts; 2) the wavelet coefficients of all images from the same anatomical cross section should have similar sparse modes. To efficiently solve this problem, we decompose it into joint TV regularization and group sparsity subproblems, respectively. Finally, the reconstructed image is obtained from the weighted average of solutions from the two subproblems, in an iterative framework. Experiments demonstrate the efficiency and effectiveness of the proposed method compared to existing multi-contrast MRI methods.     

Noise-Robust Image Reconstruction Based on Minimizing Extended Class of Power-Divergence Measures

The problem of tomographic image reconstruction can be reduced to an optimization problem of finding unknown pixel values subject to minimizing the difference between the measured and forward projections. Iterative image reconstruction algorithms provide significant improvements over transform methods in computed tomography. In this paper, we present an extended class of power-divergence measures (PDMs), which includes a large set of distance and relative entropy measures, and propose an iterative reconstruction algorithm based on the extended PDM (EPDM) as an objective function for the optimization strategy. For this purpose, we introduce a system of nonlinear differential equations whose Lyapunov function is equivalent to the EPDM. Then, we derive an iterative formula by multiplicative discretization of the continuous-time system. Since the parameterized EPDM family includes the Kullback–Leibler divergence, the resulting iterative algorithm is a natural extension of the maximum-likelihood expectation-maximization (MLEM) method. We conducted image reconstruction experiments using noisy projection data and found that the proposed algorithm outperformed MLEM and could reconstruct high-quality images that were robust to measured noise by properly selecting parameters.     

基于成像差分吸收光谱技术和压缩感知理论的烟囱烟羽断层重建研究

烟羽断层重建质量受两方面条件限制：其中一个限制条件是遥感设备的时间分辨率。以往的研究多使用多轴差分吸收光谱仪（MAX-DOAS）进行CT重建,受采集数据速度的限制,重建图像的时间分辨率较低。另一个限制条件是,采集到的数据量有限,是典型的不完全角度重建。过去多使用代数迭代重建算法或统计迭代重建算法,重建图像受测量误差的影响比较大,分辨率较低且伪影较多。构造了基于成像差分吸收光谱技术（IDOAS）的光谱数据采集系统,与多轴差分吸收光谱仪构造的系统相比,数据采集的时间分辨率提高了160多倍,基本解决了时间分辨率的问题。提出了一种基于压缩感知理论和低三阶导数模型的烟羽断层重建算法--投影凸函数集低三阶导数法,简称为POCS-LTD。在投影的过程中,使用代数重建算法使重建图像符合投影方程;在全变分迭代的过程中使用了优化算法,将低三阶导数模型的全变分归一化值作为优化算法的迭代方向,前次迭代运算结果与本次投影运算的差值的模作为迭代步长。对重建算法进行了数值模拟,并以重建图像的接近度和一致性相关因子为指标,对重建结果进行了分析。数值模拟表明,算法具有良好的抗误差能力,与传统的低三阶导数法相比,本文提出的算法将重建接近度减小了80%以上。使用烟羽数据采集系统进行了外场实验,用POCS-LTD算法对外场实验的数据进行了烟羽重建,重建图像显示烟羽图像清晰,伪影得到了较好的抑制。介绍的烟羽断层数据采集系统和烟羽断层重建算法,提高了烟羽断层重建图像的时间分辨率,减少了重建图像的伪影,扩大了光谱测量技术的应用范围。     

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.     

稀疏阈值的超分辨率图像重建

为了解决基于字典学习的超分辨重构算法耗时过长的问题,提出了基于稀疏阈值模型的图像超分辨率重建方法。首先,将联合字典理论与图像块稀疏阈值方法相结合,训练得到高、低分辨率过完备图像字典对。接着,通过稀疏阈值OMP算法对图像特征块进行稀疏表示。然后,通过高分辨率字典重构出初始的超分辨图像。最后,通过改进迭代反投影算法对初始的超分辨图像进行全局优化,从而进一步提高图像重构质量。实验结果表明,超分辨图像重构平均峰值信噪比(PSNR)为30.1 d B,平均结构自相似度(SSIM)为0.937 9,平均计算时间为10.2 s。有效提高了超分辨重构的速度,改善了重构高分辨图像的质量。