An improved fast iterative shrinkage thresholding algorithm for image deblurring. (English) Zbl 1341.94003
Summary: An improved fast iterative shrinkage thresholding algorithm (IFISTA) for image deblurring is proposed. The IFISTA algorithm uses a positive definite weighting matrix in the gradient function of the minimization problem of the known fast iterative shrinkage thresholding (FISTA) image restoration algorithm. A convergence analysis of the IFISTA algorithm shows that due to the weighting matrix, the IFISTA algorithm has an improved convergence rate and improved restoration capability of the unknown image over that of the FISTA algorithm. The weighting matrix is predetermined and fixed, and hence, like the FISTA algorithm, the IFISTA algorithm requires only one matrix vector product operation in each iteration. As a result, the computational burden per iteration of the IFISTA algorithm remains the same as in the FISTA algorithm. Numerical examples are presented that demonstrate the improved performance of the IFISTA algorithm over that of the FISTA and iterative shrinkage thresholding (ISTA) algorithms in terms of the convergence speed and the peak signal-to-noise ratio.
MSC:
| 94A08 | Image processing (compression, reconstruction, etc.) in information and communication theory |
Keywords:
image restoration; ISTA algorithm; FISTA algorithm; convergence; computational cost; peak signal-to-noise ratioReferences:
| [1] | A. Antoniou and W. S. Lu, {\it Practical Optimization}, Springer, New York, 2007. · Zbl 1128.90001 |
| [2] | A. Beck and M. Teboulle, {\it A fast iterative shrinkage-thresholding algorithm for linear inverse problems}, SIAM J. Imaging Sci., 2 (2009), pp. 183-202. · Zbl 1175.94009 |
| [3] | A. Beck and M. Teboulle, {\it Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems}, IEEE Trans. Image Process., 18 (2009), pp. 2419-2434. · Zbl 1371.94049 |
| [4] | S. Becker and M. J. Fadiliy, {\it A Quasi-Newton Proximal Splitting Method}, Technical report, Cornell University Library, 2012; also available online from \burlhttp://arxiv.org/abs/1206.1156. |
| [5] | J. Bioucas-Dias and M. Figueiredo, {\it A new TwIST: Two-step iterative shrinkage/thresholding algorithms for image restoration}, IEEE Trans. Image Process., 16 (2007), pp. 2992-3004. |
| [6] | E. J. Candes, J. Romberg, and T. Tao, {\it Robust uncertainty principles: Exact signal recognition from highly incomplete frequency information}, IEEE Trans. Inform. Theory, 52 (2006), pp. 489-509. · Zbl 1231.94017 |
| [7] | E. J. Candes and T. Tao, {\it Near optimal signal recovery from random projections: Universal encoding strategies?}, IEEE Trans. Inform. Theory, 52 (2006), pp. 5406-5425. · Zbl 1309.94033 |
| [8] | A. Chambolle, R. A. DeVore, N. Y. Lee, and B. J. Lucier, {\it Nonlinear wavelet image processing: Variational problems, compression, and noise removal through wavelet shrinkage}, IEEE Trans. Image Process., 7 (1998), pp. 319-335. · Zbl 0993.94507 |
| [9] | I. Daubechies, M. Defrise, and C. D. Mol, {\it An iterative thresholding algorithm for linear inverse problems with a sparsity constraint}, Comm. Pure Appl. Math., 57 (2004), pp. 1413-1457. · Zbl 1077.65055 |
| [10] | D. Donoho, {\it Compressed sensing}, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306. · Zbl 1288.94016 |
| [11] | M. Elad, {\it Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing}, Springer, New York, 2007. · Zbl 1211.94001 |
| [12] | M. Elad, B. Matalon, and M. Zibulevsky, {\it Subspace optimization methods for linear least squares with non-quadratic regularization}, Appl. Comput. Harmon. Anal., 23 (2007), pp. 346-367. · Zbl 1133.65022 |
| [13] | M. A. T. Figueiredo and R. D. Nowak, {\it An EM algorithm for wavelet-based image restoration}, IEEE Trans. Image Process., 12 (2003), pp. 906-916. · Zbl 1279.94015 |
| [14] | P. C. Hansen, {\it Regularization tools: A MATLAB package for analysis and solution of discrete ill-posed problems}, Numer. Algorithms, 6 (1994), pp. 1-35. · Zbl 0789.65029 |
| [15] | P. C. Hansen, J. G. Nagy, and D. P. O’Leary, {\it Deblurring Images: Matrices, Spectra, and Filtering,} Fundam. Algorithms 3, SIAM, Philadelphia, 2006. · Zbl 1112.68127 |
| [16] | L. Landweber, {\it An iteration formula for Fredholm integral equations of the first kind}, Amer. J. Math., 73 (1951), pp. 615-624. · Zbl 0043.10602 |
| [17] | J. D. Lee, Y. Sun, and M. A. Saunders, {\it Proximal Newton-type Methods for Minimizing Composite Functions}, Technical report, Cornell University Library, 2014; also available online from http://arxiv.org/abs/1206.1623. · Zbl 1306.65213 |
| [18] | Y. E. Nesterov, {\it A method for solving the convex programming problem with convergence rate \(\mathcal{O}(1/k^2)\)}, Dokl. Akad. Nauk SSSR, 269 (1983), pp. 543-547. |
| [19] | Y. E. Nesterov, {\it Introductory Lectures on Convex Optimization–A Basic Course}, Springer, New York, 2004. · Zbl 1086.90045 |
| [20] | Y. E. Nesterov, {\it Gradient Methods for Minimizing Composite Objective Function}, Technical report 7, Catholic University of Louvain, Louvain, Belgium, 2007. |
| [21] | N. G. Prelcic, O. W. Márquez, and S. Gonzalez, {\it Uvi \(\_\) wave, the ultimate toolbox for wavelet transforms and filter banks}, in Proceedings of the Fourth Bayona Workshop on Intelligent Methods for Processing and Communications Signal, 1996, pp. 224-227. |
| [22] | L. Rudin, S. Osher, and E. Fatemi, {\it Nonlinear total variation based noise removal algorithm}, Phys. D, 60 (1992), pp. 259-268. · Zbl 0780.49028 |
| [23] | P. Vandewalle, J. Kovacevic, and M. Vetterli, {\it Reproducible research in signal processing–What, why, and how}, IEEE Signal Process. Mag., 26 (2009), pp. 37-47. |
| [24] | S. J. Wright, R. D. Nowak, and M. A. T. Figueiredo, {\it Sparse reconstruction by separable approximation}, IEEE Trans. Signal Process., 57 (2009), pp. 2479-2493. · Zbl 1391.94442 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
