[1] D L Donoho.Compressed sensing[J].IEEE Transactions on Information Theory,2006,52(4):1289-1306.[2] E Candès.Compressive sampling [A].Proceeding of IEEE ICM'06 [C].Madrid:IEEE Press,2006.1433-1452.[3] 马坚伟,等.压缩感知及其应用:从稀疏约束到低秩约束优化[J].信号处理,2012,28(5):609-623. MA Jian-wei,et al.Compressive sensing and its application:from sparse to low-rank regularized optimization[J].Signal Processing,2012,28(5):609-623.[4] M Aharon,et al.The K-SVD:An algorithm for designing of over complete dictionaries for sparse representations[J].IEEE Transactions on Image Processing,2006,54(11):4311-4322.[5] C D Sigg,et al.Learning dictionaries with bounded self-coherence[J].IEEE Signal Processing Letter,2012,19(12):861-864.[6] S Mallat.A Wavelet Tour of Signal Processing[M].San Diego:Academic Press,1996.[7] H Rauhut,et al.Compressed sensing and redundant dictionaries[J].IEEE Transactions on Information Theory,2008,54(5):2210-2219.[8] Marco F Duarte.Introduction to Compressive Sensing [OL].http://cnx.org/content/m37170/latest/?Collection=co-l11355/latest,2012-05-20.[9] 焦李成,杨淑媛,等.压缩感知回顾与展望[J].电子学报,2011,7(7):1651-1662. JIAO Li-cheng,YANG Shu-yuan,et al.Development and prospect of compressive sensing[J].Acta Electronica Sinica,2011,7(7):1651-1662.(in Chinese)[10] 杨海蓉,等.压缩传感理论与重构算法[J].电子学报,2011,39(1):142-148. YANG Hai-rong,et al.The theory of compressed sensing and reconstruction algorithm[J].Acta Electronica Sinica,2011,39(1):142-148.(in Chinese)[11] S J Kim,et al.An interior-point method for large-scale l1 regularized least squares[J].IEEE Journal of Selected Topics in Signal Processing,2007,1(4):606-617.[12] M A T Fiqueiredo,et al.Gradient projection for sparse reconstruction:Application to compressed sensing and other inverse problems[J].IEEE Journal of Selected Top-ics in Signal Processing,2007,1(4):586-597.[13] J A Tropp,A C Gilbert.Signal recovery from random measurements via orthogonal matching pursuit[J].IEEE Transactions on Information Theory,2007,53(12):4655-4666.[14] W Dai,O Milenkovic.Subspace pursuit for compressive sensing signal reconstruction[J].IEEE Transactions on Information Theory,2009,55(5):2230-2249.[15] D Needell,J A Tropp.CoSaMP:Iterative signal recovery from incomplete and inaccurate samples[J].Applied and Computational Harmonic Analysis,2008,26(3):301-321.[16] B S Chen,et al.Atomic decomposition by basis pursuit[J].SIAM Journal on Scientific Computing,1998,20(1):33-61.[17] 李志林,等.一种有效的压缩感知图像重建算法[J].电子学报,2011,39(12):2796-2800. LI Zhi-lin,et al.An efficient algorithm for compressed sensing image reconstruction[J].Acta Electronica Sinica,2011,39(12):2796-2800.(in Chinese)[18] E Candès,et al.Robust uncertainty principles:Exact signal reconstruction from highly incomplete frequency information[J].IEEE Transactions on Information Theory,2006,52(2):489-509.[19] J A Tropp.Greed is good:Algorithmic results for sparse approximation[J].IEEE Transactions on Information Theory,2004,50(10):2231-2242.[20] M A Sustik,et al.On the existence of equiangular tight frames[J].Linear Algebra and its Applications,2007,426(2-3):619-635.[21] R A Devore.Deterministic construction of compressed sensing matrices[J].Journal of complexity,2007,23(4-6):918-925.[22] 李小波.基于压缩感知的测量矩阵研究 [D].北京:北京交通大学硕士学位论文,2010. Li Xiao-Bo.The Research of Measurement Matrix Based on Compressed Sensing [D].Beijing:A Dissertation of Beijing Jiao Tong University,2010.(in Chinese)[23] S Jafarpour,et al.Efficient and robust compressed sensing using optimized expander graphs[J].IEEE Transactions on Information Theory,2009,55(9):4299-4308.[24] M Raginsky,et al.Performance bounds for expander-based compressed sensing in Poisson noise[J].IEEE Transactions on Signal Processing,2011,59(9):4139-4153.[25] V Guruswami,et al.Unbalanced expanders and randomness extractors from parvaresh-vardy codes[J].Journal of Association for Computing Machinery,2009,56(4):1-34.[26] S Li,et al.Deterministic construction of compressed sensing matrices via algebraic curves[J].IEEE Transactions on Information Theory,2012,58(8):5035-5041.[27] R Calderbank,et al.Construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property[J].IEEE Journal of Selected Topics in Signal Processing,2010,4(2):358-374.[28] L Applebaum,et al.Chirp sensing codes:deterministic compressed sensing measurements for fast recovery[J].Applied and Computational Harmonic Analysis,2009,26(3):283-290.[29] K Ni,S Datta,P Mahanti,et al.Efficient deterministic compressed sensing for images with chirps and reed-muller codes[J].SIAM Journal on Imaging Sciences,2011,4(3):931-953.[30] A Amini,F Marvasti.Deterministic construction of binary,bipolar,and ternary compressed sensing matrices[J].IEEE Transactions on Information Theory,2011,57(4):2360-2370.[31] A Amini,V Montazerhodjat,F Marvasti.Matrices with small coherence using p-Ary block codes[J].IEEE Transactions on Signal Processing,2012,60(1):172-180.[32] 王开,等.准Toeplitz测量矩阵的有限等距性质分析[J].计算机应用研究,2011,28(4):1512-1514. Wang Kai,et al.RIP analysis for quasi-Toeplitz measurement matrices[J].Application Research of Computers,2011,28(4):1512-1514.(in Chinese)[33] J Haupt,et al.Toeplitz compressed sensing matrices with applications to sparse channel estimation[J].IEEE Transactions on Information Theory,2010,56(10):5862-5875.[34] V SaliGrama.Deterministic Designs with Deterministic Guarantees:Toeplitz Compressed Sensing Matrices,Sequence Design and System Identification.http://arxiv.org/abs/0806.4958v2,2008-07-28.[35] R Holger.Circulant and Toeplitz matrices in compressed sensing [OL].http://arxiv.org/abs/0902.4394v1,2009-02-25.[36] J A Tropp,et al.Designing structured tight frames via an alternating projection method[J].IEEE Transactions on Information Theory,2005,51(1):188-209.[37] B Li,Y Shen,J Li.Dictionaries construction using alternating projection method in compressive sensing[J].IEEE Signal Processing Letters,2011,18(11):663-666.[38] M Elad.Optimized projections for compressed sensing[J].IEEE Transactions on Signal Processing,2007,55(12):5695-5702.[39] J M Duarte-Carvajalino,G Sapiro.Learning to sense sparse signals:simultaneous sensing matrix and sparsifying dictionary optimization[J].IEEE Transactions on Image Processing,2009,18(7):1395-1408.[40] V Abolghasemi,et al.A robust approach for optimization of the measurement matrix in compressed sensing.Proceeding of IEEE IWCIP'10 [C].Elba:IEEE Press,2010.388-392.[41] A Vahid,et al.A gradient-based alternating minimization approach for optimization of the measurement matrix in compressive sensing[J].Signal Processing,2012,92(3):999-1009.[42] J Xu,Y Pi,Z Cao.Optimized projection matrix for compressive sensing[J].EURASIP Journal on Advances in Signal Processing,2010,(2):1-8.[43] L Zelnik-Manor,K Rosenblum,Y C Eldar.Sensing matrix optimization for block-sparse decoding[J].IEEE Transactions on Signal Processing,2011,59(9):4300-4312.[44] D J Love,et al.Grassmannian beamforming for multiple-input multiple-output wireless systems[J].IEEE Transactions on Information Theory,2003,49(10):2735-2747.[45] P Xia,S Zhou,G B Giannakis.Achieving the welch bound with difference sets[J].IEEE Transactions on Information Theory,2005,51(5):1900-1907.[46] D R Stinson.Combinatorial Designs:Constructions and Analysis[M].New York:Springer-Verlag,2004.[47] C Ding.Complex codebooks from combinatorial designs[J].IEEE Transactions on Information Theory,2006,52(9):4229-4235.[48] C Ding,T Feng.A generic construction of complex codebooks meeting the Welch bound[J].IEEE Transactions on Information Theory,2007,53(12):4245-4250.[49] P Xia,G B Giannakis.Design and analysis of transmit beamforming based on limited-rate feedback [A].Proceeding of IEEE VTC'04 [C].Los Angeles,CA:IEEE Press,2004.26-29.[50] S Hong,H Park,et al.A new performance measure using k-set correlation for compressed sensing matrices[J].IEEE Signal Processing Letter,2012,19(3):143-146. |