暂无分享,去创建一个
[1] E. Candès,et al. Sparsity and incoherence in compressive sampling , 2006, math/0611957.
[2] Saeid Sanei,et al. On optimization of the measurement matrix for compressive sensing , 2010, 2010 18th European Signal Processing Conference.
[3] Michael Elad,et al. A generalized uncertainty principle and sparse representation in pairs of bases , 2002, IEEE Trans. Inf. Theory.
[4] Yiming Pi,et al. Optimized ProjectionMatrix for Compressive Sensing , 2010 .
[5] Xiaoming Huo,et al. Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.
[6] Michael Elad,et al. Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[7] Y. C. Pati,et al. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.
[8] Aggelos K. Katsaggelos,et al. Use of tight frames for optimized compressed sensing , 2012, 2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO).
[9] Martin Bossert,et al. Low Coherence Sensing Matrices Based on Best Spherical Codes , 2013 .
[10] Saeid Sanei,et al. A robust approach for optimization of the measurement matrix in Compressed Sensing , 2010, 2010 2nd International Workshop on Cognitive Information Processing.
[11] Michael Elad,et al. Optimized Projections for Compressed Sensing , 2007, IEEE Transactions on Signal Processing.
[12] Rémi Gribonval,et al. Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.
[13] Guillermo Sapiro,et al. Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization , 2009, IEEE Transactions on Image Processing.
[14] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..