Graph-based Sparse Representation for Image Denoising

Abstract Sparse representation has shown the effectiveness in solving image restoration and classification problems. To improve the performance of sparse representation, the patch-based and graph-based regularization term with respect to the sparse coding are proposed to solve image restoration and classification problems, respectively. In this paper, the local manifold structure of intensity on patches is exploited by a graph Laplacian operator for performing more precise estimation of sparse coding. Additionally, an improved nonlocal regularization term with the local manifold structure information is proposed to preserve the texture more effectively compared with the traditional nonlocal regularization term. The experimental results on image denoising show the promising performance in terms of both peak signal noise ratio and visual perception.

[1]  Curtis R. Vogel,et al.  Ieee Transactions on Image Processing Fast, Robust Total Variation{based Reconstruction of Noisy, Blurred Images , 2022 .

[2]  Chun Chen,et al.  Graph Regularized Sparse Coding for Image Representation , 2011, IEEE Transactions on Image Processing.

[3]  I. Daubechies,et al.  An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.

[4]  Mikhail Belkin,et al.  Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.

[5]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[6]  Allen Y. Yang,et al.  Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Michael Elad,et al.  Sparse Representation for Color Image Restoration , 2008, IEEE Transactions on Image Processing.

[8]  Michael Elad,et al.  From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images , 2009, SIAM Rev..

[9]  François-Xavier Le Dimet,et al.  Deblurring From Highly Incomplete Measurements for Remote Sensing , 2009, IEEE Transactions on Geoscience and Remote Sensing.

[10]  Alessandro Foi,et al.  Image Denoising by Sparse 3-D Transform-Domain Collaborative Filtering , 2007, IEEE Transactions on Image Processing.

[11]  Michael Elad,et al.  Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries , 2006, IEEE Transactions on Image Processing.

[12]  Guillermo Sapiro,et al.  Non-local sparse models for image restoration , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[13]  Leo Grady,et al.  Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Andy M. Yip,et al.  Recent Developments in Total Variation Image Restoration , 2004 .

[15]  Michael Elad,et al.  Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.

[16]  David Zhang,et al.  Fisher Discrimination Dictionary Learning for sparse representation , 2011, 2011 International Conference on Computer Vision.

[17]  A Tikhonov,et al.  Solution of Incorrectly Formulated Problems and the Regularization Method , 1963 .

[18]  Kostadin Dabov,et al.  BM3D Image Denoising with Shape-Adaptive Principal Component Analysis , 2009 .

[19]  José M. Bioucas-Dias,et al.  Adaptive total variation image deblurring: A majorization-minimization approach , 2009, Signal Process..

[20]  M. Lustig,et al.  Compressed Sensing MRI , 2008, IEEE Signal Processing Magazine.