[1]DONOHO L D. Compressed sensing [J]. IEEE Transactions on Information Theory, 2006, 52(4):1289-1306.[2]TEMLYAKOV V. Nonlinear methods of approximation [R]. Los Angeles: University of South Carolina, Department of Mathematics, 2001.[3]MALLAT S, ZHANG Z. Matching pursuits with time-frequency dictionaries [J]. IEEE Transactions on Signal Processing, 1993, 41(12): 3397-3415.[4]TROPP J A, GILBERT A C. Signal recovery from partial In-formation by orthogonal matching pursuit [EB/OL].(2005)[2011-10-01]. http://www.personal. umich. edu/ - jtropp/ papers/ TG052Signal2Re2 covery. pdf.[5]CHEN S S, DONOHO D L, SAUNDERS M A. Atomicdecomposition by basis pursuit [J]. SIAM Journal on Scientific Computing, 2001, 43(1): 129-159. [6]DONOHO D L, ELAD M. Optimally sparse representation ingeneral (non-orthogonal) dictionaries via l1 minimization [EB/OL].[2011-09-08]. http://www-stat.stanford.edu/~donoho/Reports/2002/OptSparse.pdf.[7]AHARON M, ELAD M, BRUCKSTEIN A. K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J]. IEEE Transactions on Signal Processing, 2006, 23(4): 4311-4322.[8]GAO WEN, CAO BO, SHAN SHIQUAN, et al.The CAS-PEAL large-scale Chinese face database and baseline evaluations [J]. IEEE Transactions on System Man, and Cybernetics: Part A, 2008, 38(1):149-161.[9]MA X, ZHANG J P, QI C. Hallucinating face by position-patch [J]. Pattern Recognition, 2010, 43(6): 2224-2236.[10]WANG X G, TANG X O. Hallucinating face by eigen trans-formation [J]. IEEE Transactions on Systems, Man and Cybernetics, 2005, 35(3): 425-434.[11]CHANG H, YEUNG D Y, XIONG Y M. Super-resolution through neighbor embedding [C]// Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Washington, DC: IEEE, 2004: 1275-1282.[12]ZHUANG Y T, ZHANG J, WU F. Hallucinating faces: LPH super- resolution and neighbor reconstruction for residue compensation [J]. Pattern Recognition, 2007, 40(9):3178-3194. |