基于稀疏正则化和变量分裂的图像去模糊

传统的图像去模糊方法易产生振铃和边缘模糊等“伪像”效应,针对这一问题,采用非光滑的正则项约束图像在稀疏字典下表示系数的稀疏性,并引入非负约束项,提出了图像的稀疏正则化去模糊模型。进一步,基于交替方向拉格朗日乘子算法,提出了求解该模型的多变量分裂迭代快速算法,将复杂问题求解转化为三个简单子问题的迭代求解,降低了模型求解的复杂性。实验结果表明,所提出的去模糊模型及其快速算法相对较好地保持了图像的结构特征和平滑性,并降低了计算复杂性。     

混合非凸非光滑正则化约束的模糊图像盲复原

为能够复原出高质量的清晰图像,提出一种混合正则化约束的模糊图像盲复原方法。首先,根据模糊核的稀疏性,采用L₀范数的正则项对模糊核进行稀疏约束,以提高模糊核估计的准确性;然后,根据图像梯度的稀疏性,采用混合一阶和二阶图像梯度的L₀范数对图像梯度进行正则化约束,以保留图像边缘信息;最后,由于所提出的混合正则化约束模型本质上是非凸非光滑优化问题,通过交替方向乘子法对模型进行求解,并在非盲反卷积阶段采用L₁范数数据拟合项和全变分的方法复原清晰图像。实验结果表明,所提方法能够复原出更加清晰的细节和边缘信息,复原结果的质量更高。     

基于非凸低秩矩阵逼近和全变分正则化的高光谱图像去噪

高光谱图像在采集过程中经常受到混合噪声的干扰,严重影响了图像后续应用的性能,因此图像去噪已成为一个极其重要的预处理过程.文中采用非凸正则项代替传统的核范数重新构造逼近问题,使稀疏正则项更贴近本质秩函数的属性,进而提出了一种将非凸代理函数、全变分正则项和l2,1范数集成于统一框架的混合噪声去除算法.所提算法旨在将退化的高光谱图像以矩阵的形式分解为低秩分量和稀疏项,并利用全变分正则化保持边缘信息,提高了高光谱图像的空间分段平滑性.最后利用非凸代理函数的特殊性质,采用一种基于增广拉格朗日乘子法的迭代算法进行变量优化求解.通过多组实验进行验证,结果表明所提算法不仅能有效地去除混合噪声,而且能较好地保持图像的结构和细节,与现有的其他高光谱去噪方法相比,其在视觉效果和定量评价结果上都明显提升.     

基于局部和非局部正则化的图像压缩感知

基于低秩正则化的非局部低秩约束(Nonlocal low-rank regularization, NLR)算法利用相似块的结构稀疏性,获得了目前最好的重构结果。但是它仅仅利用了图像的非局部信息,忽略了图像像素间的局部信息,不能有 效地重建图像的边缘,同时Logdet函数不能很好地替代矩阵秩,因为它跟真实解之间存在着不可忽视的差距。因此,本文提出了一种基于局部和非局部正则化的压缩感知图像重建方法,同时考虑图像的非局部低秩性和图像像素的局部稀疏梯度性。选择利用Schatten-p 范数来替代矩阵秩,同时选择交替方向乘子算法求解产生的非凸优化问题。实验 结果表明,与传统的稀疏性先验重建算法和NLR算法相比,本文算法能够获得更高的图像重构质量。     

一种求解截断L1正则化项问题的坐标下降算法

L1正则化在稀疏学习的研究中起关键作用,使用截断L1正则化项往往可以获得更好的准确率,但却导致了非凸优化问题.目前,主要采用多阶段凸松弛(multi-stage convex relaxation,MSCR)算法进行求解,由于每一阶段都需要求解一个凸优化问题,计算代价较大.为了弥补上述不足,提出了一种求解截断L1正则化项非凸学习问题的坐标下降算法(Non-convex CD).该算法只需在多阶段凸松弛算法的每一阶段执行单步的坐标下降算法,有效降低了计算复杂性.理论分析表明所提出的算法是收敛的.针对Lasso问题,在大规模真实数据库作了实验,实验结果表明,Non-convex CD在取得和MSCR几乎相同准确率的基础上,求解的CPU时间甚至优于求解凸问题的坐标下降方法.为了进一步说明所提算法的性能,进一步研究了Non-convex CD在图像去模糊化中的应用问题.     

紧框架域混合正则化模型在图像恢复中的应用

目的 有界变差函数容易造成恢复图像纹理信息丢失,并产生虚假边缘,为克服此缺点,在紧框架域,提出一种保护图像纹理信息,抑制虚假边缘产生的混合正则化模型,并推导出交替方向迭代乘子算法。方法 首先,在紧框架域,对系统和泊松噪声模糊的图像,用Kullback-Leibler函数作为拟合项,用有界变差函数半范数和L₁范数组成混合正则项,二者加权组成能量泛函正则化模型。其次,分析混合正则化模型解的存在性和唯一性。再次,通过引入辅助变量,利用交替方向迭代乘子算法,将混合正则化模型最小化问题分解为4个容易处理的子问题。最后,子问题交替迭代形成有效的优化算法。结果 紧框架域混合正则化模型有效地克服有界变差函数容易导致纹理信息丢失、产生虚假边缘的不足。相对经典算法,本文算法提高峰值信噪比大约0.10.7 dB。结论 与其他图像恢复正则化模型相比,本文算法有利于保护图像的纹理,抑制虚假边缘,取得较高的峰值信噪比和结构相似测度,适用于恢复系统和泊松噪声模糊的图像。     

一种基于L1范数正则化的回声状态网络

针对回声状态网络存在的病态解以及模型规模控制问题,本文提出一种基于L1范数正则化的改进回声状态网络.该方法通过在目标函数中添加L1范数惩罚项,提高模型求解的数值稳定性,同时借助于L1范数正则化的特征选择能力,控制网络的复杂程度,防止出现过拟合.对于L1范数正则化的求解,采用最小角回归算法计算正则化路径,通过贝叶斯信息准则进行模型选择,避免估计正则化参数.将模型应用于人造数据和实际数据的时间序列预测中,仿真结果证明了本文方法的有效性和实用性.     

基于L1/2正则化的三维人体姿态重构

针对从给定2D特征点的单目图像中重构对象的3D形状问题,本文在形状空间模型的基础上,结合L_1/2正则化和谱范数的性质提出一种基于L_1/2正则化的凸松弛方法,将形状空间模型的非凸求解问题通过凸松弛方法转化为凸规划问题;在采用ADMM算法对凸规划问题进行优化求解过程中,提出谱范数近端梯度算法保证解的正交性与稀疏性.利用所提的优化方法,基于形状空间模型和3D可变形状模型在卡内基梅隆大学运动捕获数据库上进行3D人体姿态重构,定性和定量对比实验结果表明本文方法均优于现有的优化方法,验证了所提方法的有效性.     

一种求解带有冲击噪声的图像去模糊去噪问题的变步长分裂Bregman算法

分裂Bregman算法是一种有效的求解L1正则化问题的算法,Chen等人结合线性化、变步长、非单调等技术,改进了固定步长的分裂Bregman算法,提出了变步长分裂Bregman算法(BOSVS),并将该算法用于求解带有高斯噪声的图像去模糊去噪问题,其数值实验结果令人满意.但是它不能求解带有冲击噪声的图像去模糊去噪问题,我们在BOSVS算法基础上,提出了一种新的变步长分裂Bregman算法,用于求解带有冲击噪声的图像去模糊去噪问题.该算法一方面保留了BOSVS算法的线性化、变步长、非单调等特点;另一方面通过在原模型目标函数上增加一个L1正则项,使得模型不仅可以处理高斯噪声,还可以处理冲击噪声,因而适用范围比BOSVS算法更为广泛.初步数值实验结果表明,新算法得到结果的质量明显优于FTVd,且计算时间、算法效率也较有竞争力.     

局部加权全变差下的盲去模糊

图像去模糊是图像处理和分析中的基本问题之一,其本身是一个不适定问题,通常需要使用正则化方法来提高求解过程的稳定性.为了解决去运动模糊问题,从图像的局部特性出发,提出一种基于局部加权全变差(LWTV)的正则化方法,并给出了一种基于交替迭代的有效解法.针对非盲去卷积问题,为了克服传统全变差(TV)正则化方法的不足,以图像局部的变化信息为权值,在加大对图像中平坦区域的惩罚力度的同时,减小对图像中边缘区域的惩罚力度;针对模糊核估计问题,首先利用相对全变差(RTV)方法提取图像的显著性结构,然后利用显著性结构进行初步模糊核估计,再采用LWTV模型进行临时清晰图像估计,通过以上3步交替迭代获得最终的模糊核.实验结果表明,该方法可以在去除模糊及噪声的同时,很好地保持图像边缘并抑制振铃效应.     

A nonconvex nonsmooth regularization method for compressed sensing and low rank matrix completion

In this paper, a nonconvex and nonsmooth method for compressed sensing and low-rank matrix completion is studied. The proposed model is formulated as nonconvex regularized least square optimization problem. At first, an alternating minimization scheme is developed in which the problem can be decomposed into three subproblems, two of them are convex and the remaining one is smooth. Then, the convergence of the sequence which is generated by the alternating minimization algorithm is proved. In addition, some recovery guarantees are also analyzed. Finally, various numerical simulations are performed to test the efficiency of the method.     

Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints

The efficiency of the classic alternating direction method of multipliers has been exhibited by various applications for large-scale separable optimization problems, both for convex objective functions and for nonconvex objective functions. While there are a lot of convergence analysis for the convex case, the nonconvex case is still an open problem and the research for this case is in its infancy. In this paper, we give a partial answer on this problem. Specially, under the assumption that the associated function satisfies the Kurdyka–?ojasiewicz inequality, we prove that the iterative sequence generated by the alternating direction method converges to a critical point of the problem, provided that the penalty parameter is greater than 2L, where L is the Lipschitz constant of the gradient of one of the involved functions. Under some further conditions on the problem's data, we also analyse the convergence rate of the algorithm.     

A fast minimization method for blur and multiplicative noise removal

Multiplicative noise and blur removal problems have attracted much attention in recent years. In this paper, we propose an efficient minimization method to recover images from input blurred and multiplicative noisy images. In the proposed algorithm, we make use of the logarithm to transform blurring and multiplicative noise problems into additive image degradation problems, and then employ l ₁-norm to measure in the data-fitting term and the total variation to measure the regularization term. The alternating direction method of multipliers (ADMM) is used to solve the corresponding minimization problem. In order to guarantee the convergence of the ADMM algorithm, we approximate the associated nonconvex domain of the minimization problem by a convex domain. Experimental results are given to demonstrate that the proposed algorithm performs better than the other existing methods in terms of speed and peak signal noise ratio.     

A new fast multiphase image segmentation algorithm based on nonconvex regularizer

We present a new variational model for the soft multiphase image segmentation. In the model, we introduce a nonconvex regularizer on the membership functions which are used as indicators of different homogeneous regions. The nonconvex regularizer performs better than the usual convex ones in that (i) it well preserves geometric shapes of the homogeneous regions, and (ii) it protects edges from oversmoothing which is a common drawback of the convex regularizer. To solve the nonconvex minimization problem, we design a new fast alternative iteration algorithm, which is robust to the setting of the parameters in the model. We conduct comprehensive experiments to measure the performance of the algorithm in terms of visual evaluation and a variety of quantitative indices for image segmentation. The algorithm achieves more accurate results compared to other well-known convex variational methods for image segmentation.     

Global optimization of wavelet-domain hidden Markov tree for image segmentation

This work presents a global energy minimization method for multiscale image segmentation using convex optimization theory. The construction of energy function is motivated by the intuition that the larger the entropy, the less a priori information one has on the value of the random variables. First, we represent the wavelet-domain hidden Markov tree (WHMT) model of the original image as a structured energy function, which is proved convex in marginal distributions. Next, we derive the maximum lower bound of the energy function through Lagrange dual transform for the purpose of incorporating marginal constraints into optimization. Finally, a modified belief propagation optimization algorithm is used to perform global energy minimization of the dual convex energy function. Experiments on real image segmentation problems demonstrate the superior performance of this new algorithm when compared with nonconvex ones.     

基于乘子法的离散动态非凸大系统的递阶优化算法及其应用

In this paper, a method to transform a discrete dynamic and nonconvex large-scale optimization problem into convex one is proposed by constructing the penalty terms of the part constraints. The hierarchical optimization algorithm is studied. The convergence and the application in the real world problem of the algorithm are also discussed.     

基于稀疏优化lp正则化的光滑化拟牛顿算法

压缩感知被广泛应用于信号恢复和图像重构与去噪,重构算法是压缩感知的关键部分之一。当采样率很低时,重建原始信号是个困难的问题。对此,现有算法普遍表现不佳。采用[p(0相似文献   

基于乘子法的离散动态非凸大系统的递阶优化算法及其应用

本文针对一类时间上关联的离散动态非凸大规模优化问题,提出了一种将部分约束作为罚项从而将非凸优化问题转化为凸优化问题的方法,研究了它的递阶优化算法,讨论了算法的收敛性及实际应用情况。     

Weighted Nuclear Norm Minimization and Its Applications to Low Level Vision

As a convex relaxation of the rank minimization model, the nuclear norm minimization (NNM) problem has been attracting significant research interest in recent years. The standard NNM regularizes each singular value equally, composing an easily calculated convex norm. However, this restricts its capability and flexibility in dealing with many practical problems, where the singular values have clear physical meanings and should be treated differently. In this paper we study the weighted nuclear norm minimization (WNNM) problem, which adaptively assigns weights on different singular values. As the key step of solving general WNNM models, the theoretical properties of the weighted nuclear norm proximal (WNNP) operator are investigated. Albeit nonconvex, we prove that WNNP is equivalent to a standard quadratic programming problem with linear constrains, which facilitates solving the original problem with off-the-shelf convex optimization solvers. In particular, when the weights are sorted in a non-descending order, its optimal solution can be easily obtained in closed-form. With WNNP, the solving strategies for multiple extensions of WNNM, including robust PCA and matrix completion, can be readily constructed under the alternating direction method of multipliers paradigm. Furthermore, inspired by the reweighted sparse coding scheme, we present an automatic weight setting method, which greatly facilitates the practical implementation of WNNM. The proposed WNNM methods achieve state-of-the-art performance in typical low level vision tasks, including image denoising, background subtraction and image inpainting.     

Large-scale convex optimal control problems: time decomposition,incentive coordination, and parallel algorithm

A parallel algorithm based on time decomposition and incentive coordination is developed for long-horizon optimal control problems. This is done by first decomposing the original problem into subproblems with shorter time horizon, and then using the incentive coordination scheme to coordinate the interaction of subproblems. For strictly convex problems it is proved that the decomposed problem with linear incentive coordination is equivalent to the original problem, in the sense that each optimal solution of the decomposed problem produces one global optimal solution of the original problem and vice versa. In other words, linear incentive terms are sufficient in this case and impose no additional computation burden on the subproblems. The high-level parameter optimization problem is shown to be nonconvex, despite the uniqueness of the optimal solution and the convexity of the original problem. Nevertheless, the high-level problem has no local minimum, even though it is nonconvex. A parallel algorithm based on a prediction method is developed, and a numerical example is used to demonstrate the feasibility of the approach