arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1407.2375math.NAcs.NA
收藏

一种新的步长选择方法用于加权梯度方法及其在图像去模糊中的应用

A new steplength selection for scaled gradient methods with application to image deblurring

Dipartimento di Scienze Fisiche, Informatiche e Matematiche, Università degli Studi di Modena e Reggio Emilia(摩德纳和雷焦艾米利亚大学物理、信息和数学科学系)

Federica Porta, Marco Prato, Luca Zanni

AI总结:

本文提出了一种新的步长选择方法,用于加权梯度投影方法在非负约束最小化问题中的应用,并在图像去模糊中测试其有效性,包括显式边缘保持正则化项的存在和不存在情况。

摘要:

梯度方法常用于大规模图像去模糊问题,因为它们避免了计算目标函数Hessian矩阵的繁重计算。第二阶信息通常通过巧妙选择定义下降方向的步长参数来获得,如著名的Barzilai和Borwein规则。在最近的一篇论文中,提出了一种步长选择策略,用于近似Hessian矩阵某些特征值的倒数,适用于梯度方法应用于无约束最小化问题。在二次情况下,这种方法基于每m次迭代应用一次Lanczos过程到最近m次后梯度的矩阵,但该想法可以推广到一般目标函数。本文将此规则扩展到加权梯度投影方法应用于非负约束最小化问题的情况,并在图像去模糊问题中测试所提出策略的有效性,包括显式边缘保持正则化项存在和不存在的情况。

英文摘要:

Gradient methods are frequently used in large scale image deblurring problems since they avoid the onerous computation of the Hessian matrix of the objective function. Second order information is typically sought by a clever choice of the steplength parameter defining the descent direction, as in the case of the well-known Barzilai and Borwein rules. In a recent paper, a strategy for the steplength selection approximating the inverse of some eigenvalues of the Hessian matrix has been proposed for gradient methods applied to unconstrained minimization problems. In the quadratic case, this approach is based on a Lanczos process applied every m iterations to the matrix of the most recent m back gradients but the idea can be extended to a general objective function. In this paper we extend this rule to the case of scaled gradient projection methods applied to non-negatively constrained minimization problems, and we test the effectiveness of the proposed strategy in image deblurring problems in both the presence and the absence of an explicit edge-preserving regularization term.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑