基于二阶广义全变差的多帧图像超分辨率重建

图像超分辨率重建是图像处理领域的重要问题.本文将二阶广义全变差用于基于正则化的多帧图像超分辨率重建问题,构建了基于二阶广义全变差正则项的图像超分辨率模型.为了更好地保持重建图像的边缘和细节,采用图像空域自适应正则化参数,并针对该重建模型的非光滑性,给出了基于半二次正则化和交替方向法的求解算法.实验结果表明该模型和数值算法能够较好地提高图像的分辨率,同时可以较好地保持图像的细节信息.     

基于有序子集加速拆分算法的三维CT图像重建

针对计算机断层扫描(CT)重建过程中统计方法计算时间较长的问题,提出一种利用有序子集加速拆分算法的三维CT图像重建方法。该方法充分利用线性约束凸优化问题的增广拉格朗日(AL)方法在较弱条件下的收敛速度快的优势;同时针对内部最小二乘问题,使用AL方法的线性变形求解加权正则化最小二乘问题,该方法使用可分离二次型代理函数代替缩放增广拉格朗日中的二次型AL惩罚项,得到一种简单有序子集(OS)加速型拆分算法(OS-ASA),避免了繁琐的参数调整,可快速收敛。实验结果表明,该文算法显著加快了CT图像重建的收敛速度,当使用子集较多时,CT图像重建可以减少OS伪影。     

分块压缩感知的全变差正则化重构算法

针对分块压缩感知(BCS)重建图像质量较差问题,该文提出一种最小化l₀范数的分块压缩感知全变差(TV)正则化迭代阈值图像重构算法(BCS-TVIT)。BCS-TVIT算法考虑图像的局部平滑、有界变差等性质,将最小化l₀范数与图像的全变差TV正则项结合,构建目标函数。针对目标函数中l₀范数项和分块测量约束项无法直接优化问题,采用迭代阈值法使重构图像l₀范数最小化,并通过凸集投影保证满足约束条件,完成了目标函数的优化求解。实验表明,与基于l₀范数最小化的分块压缩感知平滑投影算法(BCS-SPL)相比,BCS-TVIT算法重构图像峰值信噪比提高2 dB,能消除BCS-SPL的“亮斑”效应,且在视觉效果上明显优于BCS-SPL算法;与最小全变差算法相比,BCS-TVIT算法重构图像峰值信噪比提升1 dB,且能降低重构时间约2个数量级。     

低剂量CT的线性Bregman迭代重建算法

针对降低 X 线源管电流来减少辐射剂量的实现方案所引起的投影图像低信噪比的情况,该文提出一种新的低剂量CT图像重建模型。总的优化目标函数采用泊松噪声的负对数似然函数作为数据保真项,采用待重建图像的稀疏性先验信息作为正则项。保真项能够克服加性高斯模型不能有效刻画噪声性质的缺点,正则化项能够改善测量低信噪比所引起的不适定性。求解过程中采用线性化Bregman迭代格式,将原目标函数分解为变系数的2次优化问题和稀疏性先验去噪问题,其中的2次优化问题中的2次项系数采用变系数计算,能够更好地逼近原始的保真项,从而加快收敛速度。在低剂量扇形束成像的条件下,对仿真模型进行了数值试验,并同传统的滤波反投影算法、极大似然算法和加权2范数重建算法进行了比较,验证了该文算法的有效性。     

基于加权总体最小二乘正则化方法的混合滤波器组最优化设计

模拟分析滤波器组的实现欠理想、系统噪声以及数字综合滤波器有效阶数实现所带来的系统误差均有可能造成混合滤波器组的设计出现解不稳定、无唯一解等病态问题,影响混合滤波器组的准确重构效果。本文首先给出了满足准确重构条件下,以综合滤波器组频域响应为求解变量的混合滤波器组线性求解模型。针对线性方程中系数矩阵以及目标向量受扰动误差影响特点,提出一种新的基于加权总体最小二乘正则化算法的IIR形式综合滤波器设计方法。算法以系统扰动误差最小化为目标函数,根据随机误差变量的二阶统计特性,采用加权总体最小二乘算法抑制滤波器实现误差以及随机噪声等扰动因素影响,使得到的综合滤波器组频域响应解的加权误差平方和最小化,并通过Tikhonov正则化方法优化病态情况下方程组解的稳定性。提出一种IIR类型的综合滤波器系数的求解算法,并利用正则化方法优化滤波器系数,提高系统稳定性。该方法可应用于过采样混合滤波器组的设计。仿真结果表明该算法的有效提高系统鲁棒性和改善重构性能。      

采用自适应正则参数的超分辨率加权重建

采用L1(一阶)、L2(二阶)范数是当前较为流行的2种图像超分辨率重建算法。在对这2种算法的优缺点进行分析的基础上,提出了一种采用L1和L2范数混合加权的参数自适应双边全变差正则化重建算法,将正则化参数作为重建图像的一个函数。实验证明这种算法有很好的边缘保持和去除椒盐噪声的能力,重建图像的质量有显著提高。     

交替使用小波去噪和全变差正则化的盲图像恢复算法

盲图像恢复就是在点扩散函数未知情况下从降质观测图像恢复出原图像.该文提出了一种交替使用小波去噪和全变差正则化的盲图像恢复算法.观测模型首先被分解成两个相互关联的子模型,这种分解转化盲恢复问题成为图像去噪和图像恢复两个问题,可以交替采用图像去噪和图像恢复算法求解.模糊辨识阶段,使用全变差正则化算法估计点扩散函数;图像恢复阶段,使用小波去噪和全变差正则化相结合的算法恢复图像.实验结果和与其它方法的比较表明该文算法能够获得更好的恢复效果.     

欠定线性瞬时混合盲分离矩阵求解算法

针对欠定线性瞬时混合中的混合矩阵条件数较大的情况,使用最小二乘估计算法求解源信号造成的噪声放大问题,研究了一种求解分离矩阵的算法。此方法基于最大信干噪比的原则建立代价函数,通过最优化此函数得到分离矩阵。仿真实验表明,该算法与最小二乘算法相比可以改善在混合矩阵条件数较大时噪声放大影响下的分离性能。     

激光雷达主动偏振图像散斑抑制算法研究

针对激光主动偏振图像的散斑去除问题,提出了一种新的非局部正则化方法:根据激光主动偏振图像的噪声特点,在全变差模型的基础上,提出了非局部全变差正则化模型.该算法充分利用了图像的全局信息复原图像,在很好地抑制散斑的同时,保持了图像的细节信息.新模型使用轮流最小化方法进行求解,则原始图像和点扩散函数都可以在最小化框架中求解,...     

基于全广义变分约束加权最小二乘的低剂量计算机断层重建方法

为了减少X射线的辐射剂量，提出了一种基于全广义变分约束加权最小二乘的低剂量计算机断层（CT）重建方法。首先对投影数据进行统计建模，然后将全广义变分正则化作为先验信息引入到投影数据恢复过程中，从而达到抑制噪声的目的，最后使用传统的滤波反投影算法进行CT图像重建。在Shepp-Logan体模实验中，提出方法的重建结果与Gibbs先验约束的惩罚加权最小二乘（Gibbs-WLS）、字典学习先验约束的惩罚加权最小二乘（DL-WLS）和全变分先验约束的惩罚加权最小二乘（TV-WLS）方法的重建结果相比，均方根误差分别降低了25.06%、1.50%和15.21%，信噪比分别提高了10.29%、0.53%和5.68%。在Clock体模实验中，提出方法的重建结果与Gibbs-WLS、DL-WLS和TV-WLS方法的重建结果相比，均方根误差分别降低了42.72%、23.45%和34.63%，信噪比分别提高了27.04%、11.42%和15.49%。实验结果表明，该方法在有效抑制低剂量CT图像的伪影和噪声的同时可以很好地保持图像的边缘信息和结构细节特征。     

Conjugate-gradient preconditioning methods for shift-variant PETimage reconstruction

Gradient-based iterative methods often converge slowly for tomographic image reconstruction and image restoration problems, but can be accelerated by suitable preconditioners. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. Circulant preconditioners can provide remarkable acceleration for inverse problems that are approximately shift-invariant, i.e., for those with approximately block-Toeplitz or block-circulant Hessians. However, in applications with nonuniform noise variance, such as arises from Poisson statistics in emission tomography and in quantum-limited optical imaging, the Hessian of the weighted least-squares objective function is quite shift-variant, and circulant preconditioners perform poorly. Additional shift-variance is caused by edge-preserving regularization methods based on nonquadratic penalty functions. This paper describes new preconditioners that approximate more accurately the Hessian matrices of shift-variant imaging problems. Compared to diagonal or circulant preconditioning, the new preconditioners lead to significantly faster convergence rates for the unconstrained conjugate-gradient (CG) iteration. We also propose a new efficient method for the line-search step required by CG methods. Applications to positron emission tomography (PET) illustrate the method.     

基于自适应加权非凸正则化和全变分的稀疏SAR成像

针对传统压缩感知(Compressive Sensing,CS)重构算法成像精度低及抗噪性能差等问题,提出了一种基于自适应加权极小极大凹罚函数和全变分的稀疏合成孔径雷达(Synthetic Aperture Imaging Radar,SAR)成像重建方法。首先,将加权思想同非凸函数簇中的极小极大凹罚函数结合,以进一步促进解的稀疏性;然后,与全变分判罚函数线性组合构成复合正则化器,以进一步提高抗噪性能;最后,采用交替方向乘子法求解该成像模型,并在求解过程中使用方位-距离解耦算子替换测量矩阵及其厄米特转置以减少存储空间。仿真与实测数据处理结果表明,所提方法相比于其他算法有更好的聚焦性能和重建精度。     

A maximum a posteriori probability expectation maximization algorithm for image reconstruction in emission tomography

The expectation maximization method for maximum likelihood image reconstruction in emission tomography, based on the Poisson distribution of the statistically independent components of the image and measurement vectors, is extended to a maximum aposteriori image reconstruction using a multivariate Gaussian a priori probability distribution of the image vector. The approach is equivalent to a penalized maximum likelihood estimation with a special choice of the penalty function. The expectation maximization method is applied to find the a posteriori probability maximizer. A simple iterative formula is derived for a penalty function that is a weighted sum of the squared deviations of image vector components from their a priori mean values. The method is demonstrated to be superior to pure likelihood maximization, in that the penalty function prevents the occurrence of irregular high amplitude patterns in the image with a large number of iterations (the so-called "checkerboard effect" or "noise artifact").     

This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms--theory and practice

Observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Gaussian noise model, and instead require a Poisson noise model. As a result, accurate reconstruction of a spatially or temporally distributed phenomenon (f*) from Poisson data (y) cannot be effectively accomplished by minimizing a conventional penalized least-squares objective function. The problem addressed in this paper is the estimation of f* from y in an inverse problem setting, where the number of unknowns may potentially be larger than the number of observations and f* admits sparse approximation. The optimization formulation considered in this paper uses a penalized negative Poisson log-likelihood objective function with nonnegativity constraints (since Poisson intensities are naturally nonnegative). In particular, the proposed approach incorporates key ideas of using separable quadratic approximations to the objective function at each iteration and penalization terms related to l1 norms of coefficient vectors, total variation seminorms, and partition-based multiscale estimation methods.     

Regularized image reconstruction algorithms for positron emission tomography

We develop algorithms for obtaining regularized estimates of emission means in positron emission tomography. The first algorithm iteratively minimizes a penalized maximum-likelihood (PML) objective function. It is based on standard de-coupled surrogate functions for the ML objective function and de-coupled surrogate functions for a certain class of penalty functions. As desired, the PML algorithm guarantees nonnegative estimates and monotonically decreases the PML objective function with increasing iterations. The second algorithm is based on an iteration dependent, de-coupled penalty function that introduces smoothing while preserving edges. For the purpose of making comparisons, the MLEM algorithm and a penalized weighted least-squares algorithm were implemented. In experiments using synthetic data and real phantom data, it was found that, for a fixed level of background noise, the contrast in the images produced by the proposed algorithms was the most accurate.     

一种多目标优化重建方法在气体浓度层析成像中的应用

为了克服传统的少射线图像重建方法-ART对噪声敏感而导致的重建图像质量差的问题,在考虑气体扩散时其浓度二维分布特点的基础上,提出了一种利用多目标优化的方法来重建气体二维浓度分布图的方法.实验表明,该算法对改善气体浓度层析成像中的噪声对重建结果的影响具有较好的效果.     

信号压缩与重构的交替方向外点持续法

针对压缩感知（Compressed Sensing,CS）中信号重构的l1-正则化问题中的l1-正则项非光滑,求解比较困难,提出了交替方向外点持续法（Alternating Direction Exterior Point Continuation Method,ADEPCM）.该算法首先将信号的稀疏域的l1-正则化问题通过变量分裂（Variable Splitting,VS）技术转化为与之等价的约束优化问题;然后采用一步Gauss-Seidel思想,对优化问题中的变量最小化,并采用持续的思想更新罚参数,重构出信号的稀疏系数;最后进行正交反变换,重构出原始信号.并将ADEPCM用于图像重构,进行了仿真实验及对实验结果进行了分析.实验结果表明：与现有的一些重构算法相比,ADEPCM具有稍高的峰值信噪比（Peak Signal to Noise Ratio,PSNR）和更快速的收敛速度.     

Constrained least squares in adaptive, imperfect arrays

Two new constrained deterministic least-squares algorithms are presented which are capable of enabling a narrow-band zero-order generalized sidelobe canceller (SLC), in the presence of array imperfections, to null out jammers while preserving the friendly look-direction signal with minimal a priori knowledge of the signal environment. The algorithms are capable of solving deterministic least-squares optimization problems subject to an equality constraint in an iterative, adaptive manner by imposing a `soft' constraint via the quadratic penalty function optimization method. The first algorithm is based on the matrix inversion lemma while the second is obtained by means of QR-decomposition using new three-dimensional Givens (1958) rotations and implemented with a systolic array architecture. These new constrained algorithms improve system performance when an artificial injection of a receiver noise vector is introduced     

Tomographic fluorescence imaging in tissue phantoms: a novel reconstruction algorithm and imaging geometry

A novel image reconstruction algorithm has been developed and demonstrated for fluorescence-enhanced frequency-domain photon migration (FDPM) tomography from measurements of area illumination with modulated excitation light and area collection of emitted fluorescence light using a gain modulated image-intensified charge-coupled device (ICCD) camera. The image reconstruction problem was formulated as a nonlinear least-squares-type simple bounds constrained optimization problem based upon the penalty/modified barrier function (PMBF) method and the coupled diffusion equations. The simple bounds constraints are included in the objective function of the PMBF method and the gradient-based truncated Newton method with trust region is used to minimize the function for the large-scale problem (39919 unknowns, 2973 measurements). Three-dimensional (3-D) images of fluorescence absorption coefficients were reconstructed using the algorithm from experimental reflectance measurements under conditions of perfect and imperfect distribution of fluorophore within a single target. To our knowledge, this is the first time that targets have been reconstructed in three-dimensions from reflectance measurements with a clinically relevant phantom.     

一种改进的TV图像重建算法

针对当前稀疏角度下有限角图像重建过程中,边界部分出现伪影,降低了图像重建质量的缺陷。文中提出了一种新的ART+TV算法,该方法是在原始TV算法的基础上进行改进。原始TV梯度下降算法求解目标函数最小值时,使用固定函数作为目标函数,文中对其进行更改,采用带参数的目标函数,并对TV重建后的结果进行自适应步长修正,加速图像收敛。与传统的ART+TV算法相比,文中算法在不改变重建速度的基础上,且在少量迭代次数下,能重建出质量更高的图像,抑制图像伪影。