图像域增强约束卷积稀疏编码的稀疏角度CT重建算法研究

稀疏角度CT重建因其可以降低辐射剂量引起广泛关注,然而减少角度会降低重建图像质量,影响诊断结果分析.为解决上述问题,提出了图像域增强约束卷积稀疏编码的稀疏角度CT重建算法,该算法继承了卷积稀疏编码的优点,通过直接处理整幅图像提取特征,克服了字典学习因图像分块聚合引起的伪影.继而引入全变分正则项来增强图像域的约束,可以有效地进一步抑制噪声.通过几组稀疏角度的重建实验与不同算法对比,实验结果表明,所提算法在噪声抑制、伪影减少和图像细节恢复方面性能优越.     

基于字典学习和TV的能谱CT重建算法

能谱CT可以将较宽的能谱数据划分为几个单独的窄谱数据,从而同时获得多个能量通道下的投影.但由于窄谱通道内接收到的光子数较少,投影通常包含较大的噪声.针对这一问题,基于压缩感知理论提出了一种基于字典学习和全变分TV(total-variation)的迭代重建算法用于能谱CT重建,应用交替最小化方法优化相关目标函数,并采用Split-Bregman算法求解.同时,采用有序子集方法加速迭代收敛过程,提高运算速率.为了验证和评估所提出的方法,使用简单模型和实际临床小鼠模型进行了仿真实验,实验结果表明,所提出的算法有较好的去噪及细节保存能力.     

三维加权PFDK重建算法研究

基于滤波反投影的Feldkamp-Davis-Kress(FDK)算法,具有数学形式简单、容易实现和计算速度快等优点,在医疗和工业等领域得到了广泛的应用.平行重排(PF DK)算法是FDK算法的一种推广,针对PFDK算法重建出的图像受锥角的影响加大的问题,给出一种三维加权PFDK图像重建算法,并研究了重排过程中径向插值间隔对重建图像质量的影响,分别采用三种不同插值总数(插值间隔分别是1单位,0.5单位,0.25单位)重排数据.实验结果表明给出的三维加权PFDK算法可有效减少锥角的影响,且当采用2倍插值总数时重建结果较好.     

基于PICCS的非局部TGV能谱CT重建算法

能谱CT将宽谱划分为窄谱,导致通道内光子数目明显减少,加大了噪声影响,故从噪声投影中重建出高质量图像是能谱CT的一个研究热点.传统全变分(total variational,TV)容易造成重建图像中出现块状伪影等问题,总广义全变分(total generalized variation,TGV)算法可以逼近任意阶函数,再结合非局部均值算法的思想,同时考虑到不同能谱通道下重建图像的相关性,将高质量全能谱重建图像作为先验图像指导能谱CT重建,提出了基于先验图像约束压缩感知(prior image constrained compressed sensing,PICCS)的非局部TGV重建算法.实验结果表明,所提算法在抑制噪声的同时能够有效复原图像细节及边缘信息,且收敛速度快.     

基于CT图像重建的多重集合分裂可行性问题应用分析

为了较好地应用CQ算法解决稀疏角度CT 图像重建的问题,提出了一种新的实时的分块逐次混合算法．首先将稀疏角度CT 图像重建的重建问题转化成分裂可行性问题．其次,通过分析非空闭凸集C和Q的不同的定义,在N维实空间中分别针对不同的CQ算法给出了7种不同的实现方案．通过试验,分别对不同算法及其方案的重建精度和收敛速度进行了对比分析,并对多重集合分裂可行性问题算法中约束权因子的选取及其对输出的影响进行了研究,从而给出了CQ算法在稀疏角度CT图像重建问题中应用的最佳凸集定义方案．以此为基础,给出了所提出算法的最佳实现方案．试验结果表明,该算法收敛速度快,重建精度高,为多重集合分裂可行性问题及其改进算法在该重建问题上的应用提供了参考．     

基于分类学习字典全局稀疏表示模型的图像修复算法研究

基于稀疏重构的图像修复依赖于图像全局自相似性信息的利用和稀疏分解字典的选择,为此提出了基于分类学习字典全局稀疏表示模型的图像修复思路.该算法首先将图像未丢失信息聚类为具有相似几何结构的多个子区域,并分别对各个子区域用K-SVD字典学习方法得到与各子区域结构特征相适应的学习字典.然后根据图像自相似性特点构建能够描述图像块空间组织结构关系的全局稀疏最大期望值表示模型,迭代地使用该模型交替更新图像块的组织结构关系和损坏图像的估计直到修复结果趋于稳定.实验结果表明,方法对于图像的纹理细节、结构信息都能起到好的修复作用.     

X射线CT成像的数学模型及其有关问题

介绍了X射线CT系统和有关物理基础,综述了理想假设下的CT成像的连续数学模型和离散数学模型,以及相应的图像反演公式（重建算法）,并对其基本思想及优缺点进行了分析。最后,分类阐述了实际X射线CT系统研制和应用需要研究的若干问题。 关键词：计算机断层成像;数学模型;Radon变换;投影变换;图像重建算法     

基于线性插值方法的ART重建算法研究

在断层成像的实际应用中,CT图像重建常用于重建欠采样及不完全数据的投影.在此,主要从不完全投影进行考虑:用线性插值法对不完全投影数据进行估计补全,再运用ART算法对补全后的投影图像进行重建.仿真实验表明,在投影数据缺失较少时,这种思路是可行的,且得到的重建效果也较好.     

凸集图像重建问题的加速下松弛平行投影算法

平行投影算法是求解凸集图像重建问题的常用工具之一,它包括迭代复杂度O (1/k)收敛性的上松弛和下松弛两种形式.本文受Nesterov加速方法的启发,首先针对凸集图像重建问题提出一种加速的下松弛并行投影算法,并在某些合适的条件下证明了其迭代复杂度O(1/k2)的收敛性.然后又提出了一种基于Arimijo技术的自适应加速...     

能谱CT投影域降噪算法的比较研究

能谱CT的光子计数探测器可以将较宽的能谱按照选定的能量段进行计数,得到物体在不同能段的成像信息.由于能谱CT需要确定能量通道,且单个窄谱通道探测的光子数为总光子数的一部分,数目减少,导致窄谱投影数据的噪声增大.为降低低能噪声对成像结果的影响,将传统MAP降噪算法,基于各向异性模型的改进MAP算法及SB(Split Bregman)算法引入能谱CT投影域去噪中.首先通过选定一个能量来验证三种算法对能谱CT的适用性.然后分别对三个确定的能量通道添加高斯噪声,使用上述算法分别去噪,并对去噪后投影使用FBP,OS-SART算法重建,结果表明三种算法均可以有效去噪,且改进的MAP算法优于传统MAP算法,SB算法去噪效果最佳.     

A variational proximal alternating linearized minimization in a given metric for limited-angle CT image reconstruction

Due to the restriction of computed tomography (CT) scanning environment, the acquired projection data may be incomplete for exact CT reconstruction. Though some convex optimization methods, such as total variation minimization based method, can be used for incomplete data reconstruction, the edge of reconstruction image may be partly distorted for limited-angle CT reconstruction. To promote the quality of reconstruction image for limited-angle CT imaging, in this paper, a nonconvex and nonsmooth optimization model was investigated. To solve the model, a variational proximal alternating linearized minimization (VPALM) method based on proximal mapping in a given metric was proposed. The proposed method can avoid computing the inverse of a huge system matrix thus can be used to deal with the larger-scale inverse problems. What’s more, we show that each bounded sequence generated by VPALM globally converges to a critical point based on the Kurdyka–Lojasiewicz property. Real data experiments are used to demonstrate the viability and effectiveness of VPALM method, and the results show that the proposed method outperforms two classical CT reconstruction methods.     

Inversion algorithm based on the generalized objective functional for compressed sensing

Owing to providing a novel insight for signal and image processing, compressed sensing (CS) has attracted increasing attention. The accuracy of the reconstruction algorithms plays an important role in real applications of the CS theory. In this paper, a generalized reconstruction model that simultaneously considers the inaccuracies on the measurement matrix and the measurement data is proposed for CS reconstruction. A generalized objective functional, which integrates the advantages of the least squares (LSs) estimation and the combinational M-estimation, is proposed. An iterative scheme that integrates the merits of the homotopy method and the artificial physics optimization (APO) algorithm is developed for solving the proposed objective functional. Numerical simulations are implemented to evaluate the feasibility and effectiveness of the proposed algorithm. For the cases simulated in this paper, the reconstruction accuracy is improved, which indicates that the proposed algorithm is successful in solving CS inverse problems.     

A splitting primal-dual proximity algorithm for solving composite optimization problems

Our work considers the optimization of the sum of a non-smooth convex function and a finite family of composite convex functions, each one of which is composed of a convex function and a bounded linear operator. This type of problem is associated with many interesting challenges encountered in the image restoration and image reconstruction fields. We developed a splitting primal-dual proximity algorithm to solve this problem. Furthermore, we propose a preconditioned method, of which the iterative parameters are obtained without the need to know some particular operator norm in advance. Theoretical convergence theorems are presented. We then apply the proposed methods to solve a total variation regularization model, in which the L2 data error function is added to the L1 data error function. The main advantageous feature of this model is its capability to combine different loss functions. The numerical results obtained for computed tomography (CT) image reconstruction demonstrated the ability of the proposed algorithm to reconstruct an image with few and sparse projection views while maintaining the image quality.     

Low-dose spectral CT reconstruction using image gradient ℓ0–norm and tensor dictionary

Spectral computed tomography (CT) has a great superiority in lesion detection, tissue characterization and material decomposition. To further extend its potential clinical applications, in this work, we propose an improved tensor dictionary learning method for low-dose spectral CT reconstruction with a constraint of image gradient ℓ₀-norm, which is named as ℓ₀TDL. The ℓ₀TDL method inherits the advantages of tensor dictionary learning (TDL) by employing the similarity of spectral CT images. On the other hand, by introducing the ℓ₀-norm constraint in gradient image domain, the proposed method emphasizes the spatial sparsity to overcome the weakness of TDL on preserving edge information. The split-bregman method is employed to solve the proposed method. Both numerical simulations and real mouse studies are perform to evaluate the proposed method. The results show that the proposed ℓ₀TDL method outperforms other competing methods, such as total variation (TV) minimization, TV with low rank (TV+LR), and TDL methods.     

Image decoding optimization based on compressive sensing

Transform-based image codec follows the basic principle: the reconstructed quality is decided by the quantization level. Compressive sensing (CS) breaks the limit and states that sparse signals can be perfectly recovered from incomplete or even corrupted information by solving convex optimization. Under the same acquisition of images, if images are represented sparsely enough, they can be reconstructed more accurately by CS recovery than inverse transform. So, in this paper, we utilize a modified TV operator to enhance image sparse representation and reconstruction accuracy, and we acquire image information from transform coefficients corrupted by quantization noise. We can reconstruct the images by CS recovery instead of inverse transform. A CS-based JPEG decoding scheme is obtained and experimental results demonstrate that the proposed methods significantly improve the PSNR and visual quality of reconstructed images compared with original JPEG decoder.     

Image decoding optimization based on compressive sensing

Transform-based image codec follows the basic principle: the reconstructed quality is decided by the quantization level. Compressive sensing (CS) breaks the limit and states that sparse signals can be perfectly recovered from incomplete or even corrupted information by solving convex optimization. Under the same acquisition of images, if images are represented sparsely enough, they can be reconstructed more accurately by CS recovery than inverse transform. So, in this paper, we utilize a modified TV operator to enhance image sparse representation and reconstruction accuracy, and we acquire image information from transform coefficients corrupted by quantization noise. We can reconstruct the images by CS recovery instead of inverse transform. A CS-based JPEG decoding scheme is obtained and experimental results demonstrate that the proposed methods significantly improve the PSNR and visual quality of reconstructed images compared with original JPEG decoder.     

Constraining by a family of strictly nonexpansive idempotent functions with applications in image reconstruction

When solving an image reconstruction problem a previous knowledge concerning the original image may lead to various constraining strategies. A convergence result has been previously proved for a constrained version of the Kaczmarz projection algorithm with a single strictly nonexpansive idempotent function with a closed image. In this paper we consider a more general projection based iterative method and a family of such constraining functions with some additional hypotheses in order to better use the a priori information for every approximation calculated. We present a particular family of box-constraining functions which satisfies our assumptions and we design an adaptive algorithm that uses an iteration-dependent family of constraining functions for some numerical experiments of image reconstruction on Tomographic Particle Image Velocimetry.