[1] DONOHO D L. Compressed sensing [J]. IEEE Transactions on Information Theory, 2006, 52(4): 1289-1306.[2] DONOHO D L, TSAIG Y. Extensions of compressed sensing [J]. Signal Processing, 2006, 86(3): 533-548.[3] DONOHO D L. For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution [J]. Communications on Pure and Applied Mathematics, 2006, 59(6): 797-829.[4] CANDS E, TAO T. Decoding by linear programming [J]. IEEE Transactions on Information Theory, 2005,51(12): 4203-4215.[5] CANDS E, ROMBERG J. Quantitative robust uncertainty principles and optimally sparse decompositions [J]. Foundations of Computational Mathematics, 2006, 6(2): 227-254.[6] CANDS E, ROMBERG J, TAO T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information [J]. IEEE Transactions on Information Theory, 2006, 52(2): 489-509.[7] CANDS E, TAO T. Near-optimal signal recovery from random projections: Universal encoding strategies? [J]. IEEE Transactions on Information Theory, 2006, 52(12): 5406-5425.[8] NEEDELL D, VERSHYNIN R. Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit [J]. Foundations of Computational Mathematics, 2009, 9(3): 317-334.[9] NEEDELL D, TROPP J A. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples [J]. Applied and Computational Harmonic Analysis, 2009, 26(3): 301-321.[10] DAI W, MILENKOVIC O. Subspace pursuit for compressive sensing signal reconstruction [J]. IEEE Transactions on Information Theory, 2009, 55(5): 2230-2249.[11] CHEN S S, DONOHO D L, SAUNDERS M A. Atomic decomposition by basis pursuit [J]. SIAM Journal of Science Computing, 1988, 20(1): 33-61.[12] TROPP J A, GILBERT A C. Signal recovery from random measurements via orthogonal matching pursuit [J]. IEEE Transactions on Information Theory, 2007, 53(12): 4655-4666.[13] RATH G, GUILLEMOT C. Complementary matching pursuit algorithms for sparse approximation [J]. IEEE Transactions on Signal Processing, 2008, 56(4): 2370-2382.[14] BLUMENSATH T, DAVIES M E. Gradient pursuits [J]. IEEE Transactions on Signal Processing, 2008, 56(6): 2370-2382.[15] BLUMENSATH T, DAVIES M E. Iterative thresholding for sparse approximations [J]. Journal of Fourier Analysis and Applications, 2008, 14(5): 629-654.[16] BLUMENSATH T, DAVIES M E. Iterative hard thresholding for compressed sensing [J]. Applied and Computational Harmonic Analysis, 2009, 27(3): 265-274.[17] BLUMENSATH T, DAVIES M E. How to use the iterative hard thresholding algorithm [C]// SPARS'09: Proceeding of Signal Processing with Adaptive Sparse Structure Representations. Saint-Malo, France: [s.n.], 2009: 33-38.[18] 石光明,刘丹华,高大化,等.压缩感知理论及其研究进展[J].电子学报,2009,37(5):1070-1081.[19] 吴宗亮,窦衡.一种新的最小二乘支持向量机稀疏化算法[J].计算机应用,2009,29(6):1559-1562.[20] 曾小波,魏祖宽,金在弘.协同过滤系统的矩阵稀疏性问题的研究[J].计算机应用,2010,30(4):1079-1082.[21] 姚远,刘鹏,王辉,等.基于稀疏矩阵存储的状态表压缩算法[J].计算机应用,2010,30(8):2157-2160. |