[1] [1] CANDES E J.Compressive sampling［C］//Proceedings of International Congress of Mathematicians.Madrid,Spain.European Mathematical Society Publishing House,2006:1433-1452.

[2] [2] BARANIUK R.Compressive sensing ［J］.IEEE Signal Processing Magazine,2007,24(4):118-120.

[3] [3] MAIRAL J,ELAD M,SAPIRO G.Sparse representation for color image restoration［J］.IEEE Transactions on Image Processing,2008,17(1):53-69.

[4] [4] AHARON M,ELAD M.BRUCKSTEIN A.K-SVD:an algorithm for designing overcomplete dictionaries for sparse representation［J］.IEEE Transactions on Signal Processing,2006,54(11):4311-4322.

[5] [5] HE Z,CICHOCKI A.K-EVD clustering and its applications to sparse component analysis［C］.Independent Component Analysis and Blind Signal Separation,Charleston,SC,USA.LNCS,2006,3889:90-97.

[6] [6] XIE Z,FENG J.KFCE:a dictionary generation algorithm for sparse representation［J］.Signal Processing,2009,89(10):2072-2077.

[7] [7] TROPP J A,GIBERT A C.Signal recovery from random measurements via orthogonal matching pursuit［J］.IEEE Transactions on Information Theory,2007,53(12):4655-4666.

[8] [8] KUNIS S,RAUHUT H.Random sampling of sparse trigonometric polynomials,II.Orthogonal matching pursuit versus basis pursuit［J］.Foundations of Computational Mathematics,2008,8(6):737-763.

[9] [9] RUBINSTEIN R,ZIBULEVSKY M,ELAD M.Efficient implementation of the K-SVD algorithm using batch orthogonal matching pursuit［J/OL］.Technical Report-CS Technion,2008［2008-03-15］.http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-get.cgi/2008/CS /CS-2008-08.revised.pdf.