Boosting of image denoising algorithms

SIAM Journal on Imaging Sciences

Volumn 8, Issue 2, 2015, Pages 1187-1219

  Romano, Yaniv ^a   Elad, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Boosting; Denoising; Graph Laplacian; Graph theory; Image restoration; K SVD; Regularization; Sparse representation

Indexed keywords

ALGORITHMS; GRAPH THEORY; IMAGE RECONSTRUCTION; LAPLACE TRANSFORMS; RESTORATION; SYSTEMS ENGINEERING;

BOOSTING; DE-NOISING; GRAPH LAPLACIAN; REGULARIZATION; SPARSE REPRESENTATION;

IMAGE DENOISING;

EID: 84936764429     PISSN: None     EISSN: 19364954     Source Type: Journal    
DOI: 10.1137/140990978     Document Type: Article

References (53)

1. M. Aharon, M. Elad, and A. Bruckstein, The K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation, IEEE Trans. Signal Process., 54 (2006), pp. 4311-4322.
2. S. Bougleux, A. Elmoataz, and M. Melkemi, Local and nonlocal discrete regularization on weighted graphs for image and mesh processing, Internat. J. Comput. Vis., 84 (2009), pp. 220-236.
3. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers, Found. Trends Machine Learning, 3 (2011), pp. 1-122.
4. L. M. Bregman, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming, USSR Comput. Math. Math. Phys., 7 (1967), pp. 200-217.
5. A. M. Bruckstein, D. L. Donoho, and M. Elad, From sparse solutions of systems of equations to sparse modeling of signals and images, SIAM Rev., 51 (2009), pp. 34-81.
6. A. Buades, B. Coll, and J. M. Morel, A review of image denoising algorithms, with a new one, Multiscale Model. Simul., 4 (2005), pp. 490-530.
7. A. Buades, B. Coll, and J. M. Morel, Non-local means denoising, Image Processing On Line, 1 (2011). http://www.ipol.im/pub/art/2011/bcm nlm/.
8. P. Bühlmann and B. Yu, Boosting with the l2 loss: Regression and classification, J. Amer. Statist. Assoc., 98 (2003), pp. 324-339.
9. H. C. Burger, C. J. Schuler, and S.Harmeling, Image denoising: Can plain neural networks compete with BM3D?, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, IEEE, Washington, DC, 2012, pp. 2392-2399.
10. M. R. Charest, M. Elad, and P. Milanfar, A general iterative regularization framework for image denoising, in Proceedings of the IEEE Conference on Information Sciences and Systems, Princeton, NJ, 2006, pp. 452-457.
11. P. Chatterjee and P. Milanfar, Patch-based near-optimal image denoising, IEEE Trans. Image Process., 21 (2012), pp. 1635-1649.
12. S. S. Chen, D. L. Donoho, and M. A. Saunders, Atomic decomposition by basis pursuit, SIAM J. Sci. Comput., 20 (1998), pp. 33-61.
13. K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, Image denoising by sparse 3-D transformdomain collaborative filtering, IEEE Trans. Image Process., 16 (2007), pp. 2080-2095.
14. M. Elad, Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing, Springer, New York, 2010.
15. M. Elad and M. Aharon, Image denoising via sparse and redundant representations over learned dictionaries, IEEE Trans. Image Process., 15 (2006), pp. 3736-3745.
16. A. Elmoataz, O. Lezoray, and S. Bougleux, Nonlocal discrete regularization on weighted graphs: A framework for image and manifold processing, IEEE Trans. Image Process., 17 (2008), pp. 1047-1060.
17. K. Engan, S. O. Aase, and H. J. Hakon, Method of optimal directions for frame design, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Vol. 5, Phoenix, AZ, 1999, pp. 2443-2446.
18. A. Gadde, S. K. Narang, and A. Ortega, Bilateral Filter: Graph Spectral Interpretation and Extensions, arXiv preprint, http://arxiv.org/abs/1303.2685, 2013.
19. G. Gilboa and S. Osher, Nonlocal linear image regularization and supervised segmentation, Multiscale Model. Simul., 6 (2007), pp. 595-630.
20. G. Gilboa and S. Osher, Nonlocal operators with applications to image processing, Multiscale Model. Simul., 7 (2008), pp. 1005-1028.
21. S. M. Haque, G. Pai, and V. M. Govindu, Symmetric smoothing filters from global consistency constraints, IEEE Trans. Image Process., 24 (2014), pp. 1536-1548.
22. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, UK, 2012.
23. A. Kheradmand and P. Milanfar, A general framework for kernel similarity-based image denoising, in Proceedings of the Global Conference on Signal and Information Processing, Austin, TX, 2013, pp. 415-418.
24. A. Kheradmand and P. Milanfar, A general framework for regularized, similarity-based image restoration, IEEE Trans. Image Process., 23 (2014), pp. 5136-5151.
25. P. A. Knight and D. Ruiz, A fast algorithm for matrix balancing, IMA J. Numer. Anal., 33 (2013), pp. 1029-1047.
26. M. Lebrun, A. Buades, and J.-M. Morel, Implementation of the "Non-Local Bayes" (NL-Bayes) Image Denoising Algorithm, Image Processing On Line, 3 (2013), pp. 1-42. http://www.ipol.im/ pub/art/2013/16/article.pdf.
27. M. Lebrun, M. Colom, A. Buades, and J.-M. Morel, Secrets of image denoising cuisine, Acta Numer., 21 (2012), pp. 475-576.
28. A. Levin and B. Nadler, Natural image denoising: Optimality and inherent bounds, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Providence, RI, 2011, pp. 2833- 2840.
29. X. Liu, D. Zhai, D. Zhao, G. Zhai, and W. Gao, Progressive image denoising through hybrid graph Laplacian regularization: A unified framework, IEEE Trans. Image Process., 23 (2014), pp. 1491-1503.
30. F. G. Meyer and X. Shen, Perturbation of the eigenvectors of the graph Laplacian: Application to image denoising, Appl. Comput. Harmon. Anal., 36 (2014), pp. 326-334.
31. P. Milanfar, A tour of modern image filtering: New insights and methods, both practical and theoretical, IEEE Signal Process. Mag., 30 (2013), pp. 106-128.
32. S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin, An iterative regularization method for total variation-based image restoration, Multiscale Model. Simul., 4 (2005), pp. 460-489.
33. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, in Proceedings of the 27th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, 1993, pp. 40-44.
34. M. Protter, M. Elad, H. Takeda, and P. Milanfar, Generalizing the nonlocal-means to superresolution reconstruction, IEEE Trans. Image Process., 18 (2009), pp. 36-51.
35. I. Ram, M. Elad, and I. Cohen, Image processing using smooth ordering of its patches, IEEE Trans. Image Process., 22 (2013), pp. 2764-2774.
36. Y. Romano and M. Elad, Improving K-SVD denoising by post-processing its method-noise, in Proceedings of the IEEE International Conference on Image Processing, Melbourne, Australia, 2013, pp. 435-439.
37. Y. Romano and M. Elad, Patch-disagreement as a way to improve K-SVD denoising, in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Brisbane, Australia, 2015.
38. Y. Romano, M. Protter, and M. Elad, Single image interpolation via adaptive nonlocal sparsity-based modeling, IEEE Trans. Image Process., 23 (2014), pp. 3085-3098.
39. L. I. Rudin, S. Osher, and E. Fatemi, Nonlinear total variation based noise removal algorithms, Phys. D, 60 (1992), pp. 259-268.
40. E. Seneta, Non-negative Matrices and Markov Chains, 2nd ed., Springer-Verlag, New York, 1981.
41. D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains, IEEE Signal Process. Mag., 30 (2013), pp. 83-98.
42. L. N. Smith and M. Elad, Improving dictionary learning: Multiple dictionary updates and coefficient reuse, Signal Process. Lett., 20 (2013), pp. 79-82.
43. J. Sulam and M. Elad, Expected patch log likelihood with a sparse prior, in Proceedings of the 10th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (Hong Kong, 2015), Lecture Notes in Comput. Sci. 8932, Springer-Verlag, Berlin, 2015, pp. 99-111.
44. A. D. Szlam, M. Maggioni, and R. R. Coifman, Regularization on graphs with function-adapted diffusion processes, J. Machine Learning Res., 9 (2008), pp. 1711-1739.
45. H. Talebi and P. Milanfar, Global image denoising, IEEE Trans. Image Process., 23 (2014), pp. 755- 768.
46. H. Talebi, X. Zhu, and P. Milanfar, How to SAIF-ly boost denoising performance, IEEE Trans. Image Process., 22 (2013), pp. 1470-1485.
47. C. Tomasi and R. Manduchi, Bilateral filtering for gray and color images, in Proceedings of the IEEE International Conference on Computer Vision, Bombay, India, 1998, pp. 839-846.
48. J. A. Tropp and S. J. Wright, Computational methods for sparse solution of linear inverse problems, Proc. IEEE, 98 (2010), pp. 948-958.
49. J. W. Tukey, Exploratory Data Analysis, Pearson, Reading, MA, 1977.
50. U. Von Luxburg, A tutorial on spectral clustering, Statist. Comput., 17 (2007), pp. 395-416.
51. G. Yu, G. Sapiro, and S. Mallat, Solving inverse problems with piecewise linear estimators: From Gaussian mixture models to structured sparsity, IEEE Trans. Image Process., 21 (2012), pp. 2481- 2499.
52. D. Zoran and Y. Weiss, Scale invariance and noise in natural images, in Proceedings of the IEEE International Conference on Computer Vision, Kyoto, Japan, 2009, pp. 2209-2216.
53. D. Zoran and Y. Weiss, From learning models of natural image patches to whole image restoration, in Proceedings of the IEEE International Conference on Computer Vision, Barcelona, Spain, 2011, pp. 479-486.