期刊
SIAM JOURNAL ON IMAGING SCIENCES
卷 2, 期 1, 页码 183-202出版社
SIAM PUBLICATIONS
DOI: 10.1137/080716542
关键词
iterative shrinkage-thresholding algorithm; deconvolution; linear inverse problem; least squares and l(1) regularization problems; optimal gradient method; global rate of convergence; two-step iterative algorithms; image deblurring
类别
资金
- the Israel Science Foundation, ISF [48906]
We consider the class of iterative shrinkage-thresholding algorithms (ISTA) for solving linear inverse problems arising in signal/image processing. This class of methods, which can be viewed as an extension of the classical gradient algorithm, is attractive due to its simplicity and thus is adequate for solving large-scale problems even with dense matrix data. However, such methods are also known to converge quite slowly. In this paper we present a new fast iterative shrinkage-thresholding algorithm (FISTA) which preserves the computational simplicity of ISTA but with a global rate of convergence which is proven to be significantly better, both theoretically and practically. Initial promising numerical results for wavelet-based image deblurring demonstrate the capabilities of FISTA which is shown to be faster than ISTA by several orders of magnitude.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据