基于有限角图像重建的两种迭代算法研究

针对有限角度投影数据的CT图像重建问题,本文介绍了两种迭代算法,其中主要介绍了基于最小化图像总变差的优化准则的迭代重建算法--TV算法,以及简单介绍了改进后的ART算法,该算法的基本思想是运用已知角度的投影数据来补全未知角度的投影数据,再用ART算法进行图像重建.最后用模拟的有限角度投影数据分别对这两种迭代算法进行了图...     

超分辨率重建算法综述

随着高分辨率移动设备和超高清电视的发展,对已有的低分辨率视频进行超分辨率上采样成为最近的一个研究热点.对已有的超分辨率重建算法根据输入输出方式的不同,分为多图像超分辨率重建、单图像超分辨率重建、视频超分辨率重建三大类,综述了其中每类算法的发展情况及常用算法,并对不同算法的特点分析比较.随后讨论了多图像超分辨率重建和单图像超分辨率重建方法对视频超分辨率重建方法的影响,最后展望了超分辨率重建算法的进一步发展.     

变分框架下的多尺度图像恢复与重建

变分图像分解,通过极小化能量泛函将图像分解为不同的特征分量,可以被应用到图像的恢复和重建.提出了变分框架下的多尺度图像恢复和重建的思想.基于这种思想,首先提出了一个单参数的（BV,G,E）三元变分分解模型,并且理论分析了参数与不同特征分量的尺度的关系.然后将此模型的参数选为一个二进制序列,得到多尺度的（BV,G,E）变分分解.该多尺度变分分解可以将图像分解为一序列图像结构、纹理和噪声.证明了此多尺度分解的收敛性并且基于对偶理论和交替迭代算法给出了其数值求解方法.最后将提出的多尺度的（BV,G,E）变分分解应用到图像恢复和重建,实验结果证实了理论分析的正确性,显示了将此模型进行图像多尺度恢复和重建的有效性,和与一些其他分解模型相比较的优越性.     

基于先验信息的二值血管锥束迭代重建

基于旋转DSA(Digital Subtraction Angiography)的血管三维重建是当前医学图像处理领域的一个新的研究热点,具有广阔的应用前景.本文在SART(Simultaneous Algebraic Reconstruction Technique)算法的基础上,根据穿过每个体素的锥束射线误差的加权平均值,构造了二值体素状态转移的概率函数,实现了一种适用于二值三维图像的迭代重建算法.针对二值三维血管的特点,本文采用最大均匀性准则作为重建目标的先验信息对迭代过程进行约束,使得迭代过程具有很好的体积聚类功能,大大提高了三维图像的重建质量.以Defrise模型和冠状动脉模型作为研究对象,试验结果表明,本文的重建算法在抑制噪声保持目标结构信息等方面优于经典的Feldkamp算法.     

一种基于压缩感知的迭代重建算法

迭代重建算法是一种经典的CT图像重建算法,适合于不完全投影数据的图像重建,其缺点是重建速度慢。为提高图像重建的质量和速度,文中利用压缩感知理论提出了一种改进的基于图像全变差最小的迭代重建算法。该算法在迭代的不同阶段对迭代初始值做不同处理,并在每次迭代结束后采用梯度下降法调整全变差。实验结果表明,该算法不但提高了图像重建质量,同时也加快了迭代图像的收敛速度。     

迫近算子在MR图像快速重建中的应用研究

 将迫近算子用于求解基于压缩感知理论的磁共振图像快速重建模型,得到了一个高效的迭代重建算法.将该算法用于部分K空间数据重建,并就算法对噪声的敏感性及算法对迭代初值的依赖性进行了仿真实验.实验结果表明,算法对噪声不敏感,对初值也没有显著的依赖性,该算法可由极少量K空间数据重建出高质量的MR图像.     

最小特征值的迭代非刚体三维射影重建方法

为了从图像序列中重建出非刚体三维射影重建,本文提出了一种最小特征值的迭代非刚体射影重建方法.该方法利用所有的图像点和深度因子组成一个低秩图像矩阵的特性,将投影求解转化为矩阵特征值及特征向量的求解,迭代地求解深度因子,实现非刚体的三维射影重建.该方法能够保证算法能够收敛到全局最优解.模拟实验和真实实验结果表明,本文方法具有收敛性速度快、误差小等优点.     

基于改进IBP算法的图像超分辨率重建

针对传统IBP算法存在对图像细节获取能力差,重建图像清晰度不高的问题,提出一种改进方法.该方法利用小波包图像融合技术,获取所有低分辨率图像高频绝对值最大的值,与均值低频进行小波包重建,得到重建低分辨率图像.以该图像为参考图像,进行迭代反投影,获得高分辨率图像.改进后的算法增加了迭代反投影方法对高频信息的获取能力,提高了...     

基于1维子空间线性迭代射影重建

提出了一种基于1维子空间线性迭代的射影重建方法.该方法利用所有图像序列的行向量生成的子空间之和,与射影重建空间点的行向量生成的子空间是同一线性子空间,同时,由第1幅图像的3个行向量及另外一个行向量可以构成该线性子空间的一个基底的特性,线性迭代求取这个行向量及图像深度因子,最后完成射影重建.模拟实验和真实实验数据结果表明,该射影重建方法具有鲁棒性好、收敛性好以及重投影误差小等优点.     

三维锥束OSEM算法中子集序列的研究

有序子集算法的提出提高了迭代算法的图像重建速度,但是三维锥束OSEM算法中的子集个数和子集迭代的顺序都会影响图像重建的收敛速度和质量.文中提出了划分子集序列的方法,该方法通过应用距离加权方案改变子集的迭代顺序,使子集均匀分布,来减小相邻子集的相关性对收敛性的影响,并且采用每次迭代后逐渐减少子集个数,提高图像重建收敛速度...     

Finite series-expansion reconstruction methods

Series-expansion reconstruction methods made their first appearance in the scientific literature and in the CT scanner industry around 1970. Great research efforts have gone into them since but many questions still wait to be answered. These methods, synonymously known as algebraic methods, iterative algorithms, or optimization theory techniques, are based on the discretization of the image domain prior to any mathematical analysis and thus are rooted in a completely different branch of mathematics than the transform methods which are discussed in this issue by Lewitt [51]. How is the model set up? What is the methodology of the approach? Where does mathematical optimization theory enter? What do these reconstruction algorithms look like? How are quadratic optimization, entropy optimization, and Bayesian analysis used in image reconstruction? Finally, why study series expansion methods if transform methods are so much faster? These are some of the questions that are answered in this paper.     

基于非局部相似块低秩的压缩感知图像重建算法

传统的压缩感知重建算法利用信号在某个特征空间下的稀疏性构建目标优化函数,但没有充分考虑信号的局部特性和结构化属性,影响了算法的重建性能和算法的适应性.本文考虑图像的非局部自相似性(NonlocalSelf-Similarity,NLSS),提出一种基于图像相似块低秩的压缩感知图像重建算法,将图像恢复问题转化为聚合的相似块矩阵秩最小问题.算法以最小压缩感知重建误差为约束构建优化模型,并采用加权核范数最小化算法(Weighed Nuclear Norm Minimization,WNNM)求解低秩优化问题,很好地挖掘了图像自身的信息和结构化稀疏特征,保护了图像的结构和纹理细节.多个测试图像、不同采样率下的实验证明了算法的有效性,特别是在低采率下对于纹理较为丰富的图像,提出的算法图像重建质量较明显的优于最新的同类算法.     

基于秩极小化的压缩感知图像恢复算法

本文将压缩感知图像恢复问题作为低秩矩阵恢复问题来进行研究.为了构建这样的低秩矩阵,我们采样非局部相似度模型,将相似图像块作为列向量构建一个二维相似块矩阵.由于列向量间的强相关性,因此该矩阵具有低秩属性.然后以压缩感知测量作为约束条件对这样的二维相似块矩阵进行低秩矩阵恢复求解.在算法求解的过程中,使用增广拉格朗日方法将受限优化问题转换为非受限优化问题,同时为了减少计算复杂度,使用基于泰勒展开的线性化技术来加速算法求解.实验表明该算法的收敛率、图像恢复性能均优于目前主流压缩感知图像恢复算法.     

A Bayesian approach to image expansion for improved definition

Accurate image expansion is important in many areas of image analysis. Common methods of expansion, such as linear and spline techniques, tend to smooth the image data at edge regions. This paper introduces a method for nonlinear image expansion which preserves the discontinuities of the original image, producing an expanded image with improved definition. The maximum a posteriori (MAP) estimation techniques that are proposed for noise-free and noisy images result in the optimization of convex functionals. The expanded images produced from these methods will be shown to be aesthetically and quantitatively superior to images expanded by the standard methods of replication, linear interpolation, and cubic B-spline expansion.     

基于全变差的加权最小二乘法PET图像重建

传统的加权最小二乘法、惩罚项加权最小二乘法虽然能够重建得到较好质量的图像,但在欠采样的条件下不能很好的拟制噪声.全变差作为正则项已广泛用于图像重建中,利用图像稀疏的先验知识能够在欠采样的条件下很好的重建图像.本文结合加权最小二乘法和全变差的优点,构造了基于全变差正则项的加权最小二乘法目标函数,运用交替求解的方法,将目标函数分解为求解二次优化和全变差正则化的优化问题,并分别用超松弛迭代方法和梯度下降法求解这两个优化问题.采用Zubal模型对该算法与传统算法进行仿真验证比较,并用相关系数、方差、信噪比等参数描述图像重建质量.结果表明在欠采样条件下,该算法能够更好的拟制噪声,重构效果比传统的有明显地提高.     

Image compressive sensing via hybrid regularization combining centralized group sparse representation and deep denoiser prior

To effectively solve the ill-posed image compressive sensing (CS) reconstruction problem, it is essential to properly exploit image prior knowledge. In this paper, we propose an efficient hybrid regularization approach for image CS reconstruction, which can simultaneously exploit both internal and external image priors in a unified framework. Specifically, a novel centralized group sparse representation (CGSR) model is designed to more effectively exploit internal image sparsity prior by suppressing the group sparse coding noise (GSCN), i.e., the difference between the group sparse coding coefficients of the observed image and those of the original image. Meanwhile, by taking advantage of the plug-and-play (PnP) image restoration framework, a state-of-the-art deep image denoiser is plugged into the optimization model of image CS reconstruction to implicitly exploit external deep denoiser prior. To make our hybrid internal and external image priors regularized image CS method (named as CGSR-D-CS) tractable and robust, an efficient algorithm based on the split Bregman iteration is developed to solve the optimization problem of CGSR-D-CS. Experimental results demonstrate that our CGSR-D-CS method outperforms some state-of-the-art image CS reconstruction methods (either model-based or deep learning-based methods) in terms of both objective quality and visual perception.     

Restoration of blurred star field images by maximally sparseoptimization

The problem of removing blur from, or sharpening, astronomical star field intensity images is discussed. An approach to image restoration that recovers image detail using a constrained optimization theoretic approach is introduced. Ideal star images may be modeled as a few point sources in a uniform background. It is argued that a direct measure of image sparseness is the appropriate optimization criterion for deconvolving the image blurring function. A sparseness criterion based on the l(p) is presented, and candidate algorithms for solving the ensuing nonlinear constrained optimization problem are presented and reviewed. Synthetic and actual star image reconstruction examples are presented to demonstrate the method's superior performance as compared with several image deconvolution methods.     

Parallel MR image reconstruction using augmented Lagrangian methods

Magnetic resonance image (MRI) reconstruction using SENSitivity Encoding (SENSE) requires regularization to suppress noise and aliasing effects. Edge-preserving and sparsity-based regularization criteria can improve image quality, but they demand computation-intensive nonlinear optimization. In this paper, we present novel methods for regularized MRI reconstruction from undersampled sensitivity encoded data--SENSE-reconstruction--using the augmented Lagrangian (AL) framework for solving large-scale constrained optimization problems. We first formulate regularized SENSE-reconstruction as an unconstrained optimization task and then convert it to a set of (equivalent) constrained problems using variable splitting. We then attack these constrained versions in an AL framework using an alternating minimization method, leading to algorithms that can be implemented easily. The proposed methods are applicable to a general class of regularizers that includes popular edge-preserving (e.g., total-variation) and sparsity-promoting (e.g., l(1)-norm of wavelet coefficients) criteria and combinations thereof. Numerical experiments with synthetic and in vivo human data illustrate that the proposed AL algorithms converge faster than both general-purpose optimization algorithms such as nonlinear conjugate gradient (NCG) and state-of-the-art MFISTA.     

低剂量CT重建中的双边滤波权值优化新方法

为了提升低剂量CT重建图像质量,本文提出了一种基于投影数据恢复导引的双边滤波权值优化方法.新方法有效地将CT投影数据恢复和图像数据恢复的两种低剂量成像策略进行结合,实现优质的低剂量CT重建.具体而言,本文中投影数据恢复采用三维块匹配滤波进行,图像数据恢复采用双边滤波进行,其中双边滤波权值进行优化设计.在双边滤波权值设计...     

Convergent incremental optimization transfer algorithms: application to tomography

No convergent ordered subsets (OS) type image reconstruction algorithms for transmission tomography have been proposed to date. In contrast, in emission tomography, there are two known families of convergent OS algorithms: methods that use relaxation parameters, and methods based on the incremental expectation-maximization (EM) approach. This paper generalizes the incremental EM approach by introducing a general framework, "incremental optimization transfer." The proposed algorithms accelerate convergence speeds and ensure global convergence without requiring relaxation parameters. The general optimization transfer framework allows the use of a very broad family of surrogate functions, enabling the development of new algorithms. This paper provides the first convergent OS-type algorithm for (nonconcave) penalized-likelihood (PL) transmission image reconstruction by using separable paraboloidal surrogates (SPS) which yield closed-form maximization steps. We found it is very effective to achieve fast convergence rates by starting with an OS algorithm with a large number of subsets and switching to the new "transmission incremental optimization transfer (TRIOT)" algorithm. Results show that TRIOT is faster in increasing the PL objective than nonincremental ordinary SPS and even OS-SPS yet is convergent.