K-SVD Dictionary Learning and Image Reconstruction Based on Variance of Image Patches

The sparsity of signal is the premise of compressed sensing theory. It has been the hot topic for many years to sparsely represent the original signal accurately and quickly. For the sparse representation of image, the K-SVD dictionary training algorithm exhibits excellent performance. By calculating the variance of each block, different K-SVD parameters are settled, then the image sparse representation and Compressed Sensing reconstruction is achieved. Experimental results show that this method can preserve more image detail, and gain higher PSNR of the reconstruction results.

[1]  Michael Elad,et al.  Multiscale Sparse Image Representationwith Learned Dictionaries , 2007, 2007 IEEE International Conference on Image Processing.

[2]  Lu Gan Block Compressed Sensing of Natural Images , 2007, 2007 15th International Conference on Digital Signal Processing.

[3]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[4]  Paul D. Gader,et al.  EK-SVD: Optimized dictionary design for sparse representations , 2008, 2008 19th International Conference on Pattern Recognition.

[5]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

[6]  Kjersti Engan,et al.  Method of optimal directions for frame design , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).

[7]  Baoxin Li,et al.  Discriminative K-SVD for dictionary learning in face recognition , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[8]  Michael Elad,et al.  Improving Dictionary Learning: Multiple Dictionary Updates and Coefficient Reuse , 2013, IEEE Signal Processing Letters.

[9]  Hou Biao,et al.  Development and Prospect of Compressive Sensing , 2011 .