基于结构组全变分模型的图像压缩感知重建

针对基于传统全变分(TV)模型的图像压缩感知(CS)重建算法不能有效地恢复图像的细节和纹理,从而导致图像过平滑的问题,该文提出一种基于结构组全变分(SGTV)模型的图像压缩感知重建算法。该算法利用图像的非局部自相似性和结构稀疏特性,将图像的重建问题转化为由非局部自相似图像块构建的结构组全变分最小化问题。算法以结构组全变分模型为正则化约束项构建优化模型,利用分裂Bregman迭代将算法分离成多个子问题,并对每个子问题高效地求解。所提算法很好地利用了图像自身的信息和结构稀疏特性,保护了图像细节和纹理。实验结果表明,该文所提出的算法优于现有基于全变分模型的压缩感知重建算法,在PSNR和视觉效果方面取得了显著提升。     

基于全变分扩展方法的压缩感知磁共振成像算法研究

针对全变分算法在压缩感知磁共振成像(CS-MRI)重构过程中存在阶梯效应的问题,该文研究3种基于全变分扩展方法的CS-MRI成像算法,即高阶全变分、总广义变分和组合稀疏全变分,并将其与平移不变离散小波稀疏基相结合,建立稀疏模型,采用快速复合分裂算法求解CS-MRI重构的凸优化问题。同时,讨论了全变分及其扩展方法对两种不同磁共振图像数据和径向欠采样模式重构CS-MRI的精度。实验结果表明,基于全变分扩展的重构算法能有效解决全变分重建中存在阶梯效应的缺点;另外,相比高阶全变分和总广义变分重构算法,组合稀疏全变分方法具有更好的重建效果,获得更高重构信噪比。     

（论坛）基于全变分的模糊人脸图像复原算法

在人脸图像采集过程中,会受到多种因素影响,图像质量都会有所退化,因此将模糊图像恢复成清晰图像一直是图像处理领域的热点之一。根据全变分正则化的图像复原算法的思想,引入相容点集与不相容点集的概念,以及一些辅助的约束条件,提出一种有约束人脸图像复原优化模型,并使用最速下降法求解此模型,使模糊的人脸图像清晰化。实验结果表明,这种模型是可行的,基本恢复了原始的图像。     

基于分裂Bregman方法的全变差图像去模糊

针对全变差图像去模糊问题,提出一种基于分裂Bregman方法的全变差图像去模糊算法,利用分裂Bregman方法来优化其求解问题模型.首先,利用辅助变量及其二次惩罚泛函把全变差去模糊优化问题转化为一个等价的无约束优化问题;其次,基于Bregman迭代将其分解为两个子优化问题采用交替最小化方法进行求解;最后,根据子问题结构特点,采用离散傅立叶变换及收缩技术实现子优化问题的快速计算.实验结果表明,在不同尺寸模糊核条件下本文算法能获得有效、稳定的图像复原结果,相比FTVd、IRN去模糊方法,本文算法复原效果更好,计算更加快速.     

基于Hessian核范数正则化的快速图像复原算法

利用Hessian核范数进行图像复原是目前较好的高阶正则化方法,但是由于Hessian核范数正则项的高度非线性和不可微性,图像去模糊和去噪过程耦合度高,求解算法的复杂度高.本文利用变量分裂设计了一种具有闭解形式的交替迭代最小化快速图像复原算法,将图像去模糊、去噪分步进行,并给出算法的收敛性证明.实验结果表明,本文方法不仅在峰值信噪比方面优于原有的基于Hessian核范数图像复原的主优化(Majorization-Minimization,MM)方法,而且大大降低了算法的迭代次数和运行时间.     

Radon变换和全变分相融合的图像复原算法

图像复原的核心是点扩散函数的估计和直接去卷积算法,针对拍照过程中,相机和被拍摄物体由于相对运动而导致的图像退化问题,提出一种基于Radon变换和全变分相融合的图像复原算法。首先利用radon变换对图像退化模型参数进行估计,然后采用全变分算法复原退化图像,最后在Matlab 2012平台进行仿真实验对算法的性能检验。仿真结果表明,相对于其它图像复原算法,本文算法可以准确估计退化模型参数,获得了更加理想的图像复原效果,具有一定的实际利用价值。     

基于粒子群优化的正则化水下图像盲复原

水下图像恢复的难点在于缺少海水的点扩展函数的足够信息,而导致病态的问题.为了提高水下激光成像系统的成像质量,提出了用粒子群优化正则化参量的盲图像复原算法.该方法结合Tikhonov正则化和改进的全变分正则化的技术特点,使用一种交替迭代方法,分别估计点扩展函数和估计复原图像,同时用粒子群算法优化正则化参量.结果表明,该方法对水下图像复原具有较好的鲁棒性,算法收敛稳定.     

基于非局部低秩和加权全变分的图像压缩感知重构算法

为准确有效地实现自然图像的压缩感知(CS)重构,该文提出一种基于图像非局部低秩(NLR)和加权全变分(WTV)的CS重构算法。该算法考虑图像的非局部自相似性(NSS)和局部光滑特性,对传统的全变分(TV)模型进行改进,只对图像的高频分量设置权重,并用一种差分曲率的边缘检测算子来构造权重系数。此外,算法以改进的TV模型与NLR模型为约束构建优化模型,并分别采用光滑非凸函数和软阈值函数来求解低秩和全变分优化问题,很好地利用了图像的自身性质,保护了图像的细节信息,并提高了算法的抗噪性和适应性。仿真结果表明,与基于NLR的CS算法相比,相同采样率下,该文所提算法的峰值信噪比最高可提高2.49 dB,且抗噪性更强,验证了算法的有效性。     

应用双稀疏模型和ADMM优化的图像复原

基于稀疏表示的图像复原算法大都只利用了图像整体稀疏性和局部稀疏性中的一种,未充分利用图像的先验知识,基于此,本文在稀疏表示框架下,同时引入Cosparse解析模型及平移不变小波变换两种稀疏模型,前者对每个图像块进行稀疏表示,后者对整幅图像进行稀疏表示,从而提出一种新的图像复原算法。该算法将图像复原问题归结为双稀疏正则化问题。为求解复杂的双稀疏优化问题,本文运用交替方向乘子法 (ADMM, Alternating Direction Method of Multipliers)算法将该约束优化问题分解为若干子问题,通过交替迭代求解获得复原图像。实验中对不同类型的模糊图像进行了复原,其结果表明该算法对于各类模糊图像的复原比现有复原算法效果更好,从而验证了算法的有效性。      

基于变分的图像复原算法的改进

图像复原也称图像恢复,是图像处理的一个重要分支。图像复原是希望达到改进输入图像的视觉质量的目的,它是视图利用退化过程的先验知识,根据相应的退化模型,恢复出已被污染的图像的本来面目。Rudin和Osher提出的整体变分图像模型被认为是目前比较合理的图像复原模型,但恢复出的图像边界会产生一定的模糊;后来提出的冲击滤波器能够有效地锐化图像的边界,但是对噪声较为敏感,因此本论文提出一种结合全变分模型和冲击滤波器模型的混合模型的增强算法,弥补原有模型的不足,实现较好的复原效果。     

基于并行分离增广拉格朗日乘子法的字符矫正

字符矫正是光学字符识别(OCR)系统预处理过程中 的重要步骤,针对传统的增广拉格朗日乘子法(ALM)求解字符矫正问题时收敛性和计算速度 的不足,本文研究了并行分离的增广拉格朗日乘子法,综合考虑字符矫正模型的建立过程, 提出并行分离方法与ALM相结合的思想解决字符 矫正问题。用并行方式将迭代问题分解成3个子问题,计算时能够同时求解分解后的这3个 子问题,然后进行凸组合,最 后收敛到问题的最优解。实验结果表明,本文算法能够快速准确地对变形的字符图像进 行矫正,并且具有良好的实时性和适 应性,可用于OCR系统的矫正预处理中,提高OCR系统的识别率。     

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.     

增广Lagrangian的快速视频复原方法

针对单幅模糊图像复原的局限性和视频应用的广泛 性,提出了一种基于时空体和增广Lagrangian的快速视频复原方法。首先对视频复原与图像 复原的特征进行比较和分析,研究视频复原的三维解卷积操作, 并对目前存在的视频复原方法的实现过程与性能进行分析和总结;然后在时空体的思想下, 通过时空联合 的各向同性全变分来控制时间误差和空间误差,并引入一种增广的Lagrangian方法完成全变 分规整化的难 题;最后通过求解Lagrangian形式的f子问题和u子问题实现全变分最小化难题,并对规整化 过程中的参 数进行研究与讨论,最终实现了视频的快速鲁棒复原。基于仿真图像和实际视频的实验结果 表明,本文方法 的性能在运行时间和视觉质量评价方面都要优于当前的其它方法,能够有效地实现图像和视 频的快速复原。     

混合正则化约束的湍流退化图像复原算法

针对大气湍流引起的红外图像模糊问题,提出一种基于混合正则化的模糊核估计模型。根据图像主要边缘的稀疏性,采用图像梯度的L0范数为正则化项;通过分析模糊核的特性,提出能适用于复杂模糊情况的核L0-L2范数正则化约束。复原模型的优化过程中,结合变量分裂策略和增广拉格朗日法交替估计图像和模糊核,并利用快速傅里叶变换,实现模糊核的快速、准确估计;最终根据估计的模糊核,复原得清晰图像。实验结果表明,本文算法可以更好地复原退化图像,在主观视觉和客观质量评价方面都有所提高。     

Blind restoration of turbulence degraded images based on two-channel alternating minimization algorithm

Due to the atmospheric turbulence and the system noise, images are blurred in the astronomical or space object detection. Wavefront aberrations and system noise make the capability of detecting objects decrease greatly. A two-channel image restoration method based on alternating minimization is proposed to restore the turbulence degraded images. The images at different times are regarded as separate channels, then the object and the point spread function (PSF) are reconstructed in an alternative way. There are two optimization parameters in the algorithm:the object and the PSF. Each optimization step is transformed into a constraint problem by variable splitting and processed by the augmented Lagrangian method. The results of simulation and actual experiment verify that the two-channel image restoration method can always converge rapidly within five iterations, and values of normalized root mean square error (NRMSE) remain below 3% after five iterations. Standard deviation data show that optimized alternating minimization (OAM) has strong stability and adaptability to different turbulent levels and noise levels. Restored images are approximate to the ideal imaging by visual assessment, even though atmospheric turbulence and systemnoise have a strong impact on imaging. Additionally, the method can remove noise effectively during the process of image restoration.     

Image Deblurring Via Combined Total Variation and Framelet

This paper presents a new approach to image deblurring, on the basis of total variation (TV) and wavelet frame. The Rudin–Osher–Fatemi model, which is based on TV minimization, has been proven effective for image restoration. The explicit exploitation of sparse approximations of natural images has led to the success of wavelet frame approach in solving image restoration problems. However, TV introduces staircase effects. Thus, we propose a new objective functional that combines the tight wavelet frame and TV to reconstruct images from blurry and noisy observations while mitigating staircase effects. The minimization of the new objective functional presents a computational challenge. We propose a fast minimization algorithm by employing the augmented Lagrangian technique. The experiments on a set of image deblurring benchmark problems show that the proposed method outperforms the previous state-of-the-art methods for image restoration.     

Robust multichannel blind deconvolution via fast alternating minimization

Blind deconvolution, which comprises simultaneous blur and image estimations, is a strongly ill-posed problem. It is by now well known that if multiple images of the same scene are acquired, this multichannel (MC) blind deconvolution problem is better posed and allows blur estimation directly from the degraded images. We improve the MC idea by adding robustness to noise and stability in the case of large blurs or if the blur size is vastly overestimated. We formulate blind deconvolution as an l(1) -regularized optimization problem and seek a solution by alternately optimizing with respect to the image and with respect to blurs. Each optimization step is converted to a constrained problem by variable splitting and then is addressed with an augmented Lagrangian method, which permits simple and fast implementation in the Fourier domain. The rapid convergence of the proposed method is illustrated on synthetically blurred data. Applicability is also demonstrated on the deconvolution of real photos taken by a digital camera.     

A direct approach toward global minimization for multiphase labeling and segmentation problems

This paper intends to extend the minimization algorithm developed by Bae, Yuan and Tai [IJCV, 2011] in several directions. First, we propose a new primal-dual approach for global minimization of the continuous Potts model with applications to the piecewise constant Mumford-Shah model for multiphase image segmentation. Different from the existing methods, we work directly with the binary setting without using convex relaxation, which is thereby termed as a direct approach. Second, we provide the sufficient and necessary conditions to guarantee a global optimum. Moreover, we provide efficient algorithms based on a reduction in the intermediate unknowns from the augmented Lagrangian formulation. As a result, the underlying algorithms involve significantly fewer parameters and unknowns than the naive use of augmented Lagrangian-based methods; hence, they are fast and easy to implement. Furthermore, they can produce global optimums under mild conditions.     

Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems

This paper studies gradient-based schemes for image denoising and deblurring problems based on the discretized total variation (TV) minimization model with constraints. We derive a fast algorithm for the constrained TV-based image deburring problem. To achieve this task, we combine an acceleration of the well known dual approach to the denoising problem with a novel monotone version of a fast iterative shrinkage/thresholding algorithm (FISTA) we have recently introduced. The resulting gradient-based algorithm shares a remarkable simplicity together with a proven global rate of convergence which is significantly better than currently known gradient projections-based methods. Our results are applicable to both the anisotropic and isotropic discretized TV functionals. Initial numerical results demonstrate the viability and efficiency of the proposed algorithms on image deblurring problems with box constraints.