参考文献

［1］MALLAT S G, ZHANG Z F. Matching pursuits with time-frequency dictionaries[J]. IEEE Transactions on Signal Processing, 1993, 41(12):3397-3415.

［2］DONOHO D L. Compressed Sensing[J]. IEEE Transactions on Information Theory, 2006, 51(4):1289-1306.

［3］CANDÈS E J. Compressive Sampling[C]. Proceedings of the international congress of mathematicians, 2006, 1433-1452.

［4］曾理．压缩感知关键技术及应用研究［D］．南京：解放军理工大学，2014.

［5］MORLET J, GROSSMAN A. Decomposition of Hardy functions into square integrable wavelets of constant shape[J]. SIAM Journal of Mathematics Analysis, 1984, 15:723-736.

［6］张春梅，尹忠科，肖明霞．基于冗余字典的信号超完备表示与稀疏分解［J］．科学通报，2006，51(6):628-633.

［7］OLSHAUSEN B A, FIELD D J.Sparse coding with an overcomplete basis set: A strategy employed by V1[J]. Vision Research, 1997, 37(23):3311-3325.

［8］RUBINSTEIN R, BRUCKSTEIN A M, ELAD M.Dictionaries for Sparse Representation Modeling [C]. Proceedings of the IEEE, 2010, 98(6):1045-1057.

［9］RUBINSTEIN R, ZIBULEVSKY M, ELAD M.Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Applroximation[J]. IEEE Transactions on Signal Processing, 2010, 58(3):1553-1564.

［10］BARANIUK R G. Lecture Notes:Compressive Sensing[J]. IEEE Signal Processing Magazine, 2007, 24(4):118-121.

［11］LI Y, AMARI S. Two conditions for equivalence of 0-Norm solution and 1-Norm solution in sparse representation[J]. IEEE Transactions on Neural Networks, 2010, 21(7):1189-1196.

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

［13］BLUMENSATH T, DAVIES M E.Iterative hard thresholding for compressed sensing[J]. Applied and Computational Harmonic Analysis, 2009, 27(3):265-274.

［14］方红，杨海蓉．贪婪算法与压缩感知理论［J］．自动化学报，2011，37(12):1413-1421.

［15］RAVELLI E, RICHARD G, DAUDET L. Audio Signal Representations for Indexing in the Transform Domian[J]. IEEE Transactions on Audio, Speech, and Language Processing, 2010, 18(3):434-446.

［16］CHO N, KUO C J. Sparse Music Representation with Source-Specific Dictionaries and Its Application to Signal Separation[J]. IEEE Transactions on Audio, Speech, and Language Processing, 2011, 19(2):337-348.

［17］JAFARI M G, PLUMBLEY M D. Speech Denoising Based on a Greedy Aadaptive Dictionary Algorithm[C]. 17th European Signal Processing Conference(EUSIPCO 2009), 2009, 8:1423-1426.

［18］ENGAN K, AASE S O, HUSOY J H. Method of optimal directions for frame design[C]. ICASSP, 1999, 5:2443-2446.

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

［20］MAILHÉ B, LESAGE S, GRIBOVAL R. Shift-invariant dictionary learning for sparse representations: Extending KSVD[C].Proceedings in European Conference on Signal Processing, 2008, 4-8.

［21］ELAD M, BRUCKSTEIN A M. A Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases[J]. IEEE Transactions on Information Theory, 2002, 48(9):2558-2567.

［22］FIUER A, NEMIROVSKI A. On sparse representation in pairs of bases[J]. IEEE Transactions on Information Theory, 2003, 49(6):1579-1581.

［23］LUSTIG M, DONOHO D, PAULY J M. Sparse MRI: the application of compressed sensing for rapid MR Image[J]. Magnetic Resonance in Medicine, 2007, 58(6):1182-1195.

［24］DUARTE M F, DAVENPORT M A, TAKHAR D, LASKA J N, SUN T, KELLY K F, BARANIUK R G. Single-Pixel Imaging via Compressive Sampling[J]. IEEE Signal Processing Magazine, 2008, 25(2):83-91.

［25］MISHALI M, ELDAR Y C, DOUNAEVSKY O, et al. Xampling: Analog to digital at sub-Nyquist rates[J]. IET Circuits Devices & Systems, 2011, 5(1):8-20.

［26］ELAD M.Why simple shrinkage is still relevant for redundant representations?[J]. IEEE Transactions on Image Processing, 2006, 52(12):5559-5569.

［27］ELAD M. 稀疏和冗余表示：理论及其在信号与图像处理中的应用［M］．曹铁勇，杨吉斌，赵斐，李莉，译．北京：国防工业出版社，2016.

［28］SUNDMAN D. Compressed Sensing Algorithms and Applications[D]. Royal Institute of Technology, KTH Stockholm, Sweden, 2012.

［29］陈栩杉．频谱稀疏信号检测和参数估计关键技术研究［D］．南京：解放军理工大学，2016.