暂无分享,去创建一个
Akram Aldroubi | Haichao Wang | Kourosh Zarringhalam | A. Aldroubi | Kourosh Zarringhalam | Haichao Wang
[1] Minh N. Do,et al. A Theory for Sampling Signals from a Union of Subspaces , 2022 .
[2] Weiyu Xu,et al. Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs , 2007, 2007 IEEE Information Theory Workshop.
[3] Richard Baraniuk,et al. Compressed Sensing Reconstruction via Belief Propagation , 2006 .
[4] David L Donoho,et al. Compressed sensing , 2006, IEEE Transactions on Information Theory.
[5] J. Tropp,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, Commun. ACM.
[6] S. Foucart,et al. Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0 , 2009 .
[7] M. Elad,et al. $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.
[8] Jarvis Haupt,et al. Adaptive Sensing for Sparse Signal Recovery , 2009, 2009 IEEE 13th Digital Signal Processing Workshop and 5th IEEE Signal Processing Education Workshop.
[9] Richard G. Baraniuk,et al. Sudocodes ߝ Fast Measurement and Reconstruction of Sparse Signals , 2006, 2006 IEEE International Symposium on Information Theory.
[10] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[11] A. Bruckstein,et al. K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .
[12] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[13] R. Vershynin,et al. One sketch for all: fast algorithms for compressed sensing , 2007, STOC '07.
[14] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[15] Joel A. Tropp,et al. Algorithmic linear dimension reduction in the l_1 norm for sparse vectors , 2006, ArXiv.
[16] Ronald A. DeVore,et al. Deterministic constructions of compressed sensing matrices , 2007, J. Complex..
[17] Rémi Gribonval,et al. Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.
[18] Deanna Needell,et al. Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit , 2007, Found. Comput. Math..
[19] R. DeVore,et al. A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .
[20] Piotr Indyk,et al. Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[21] S. Muthukrishnan,et al. One-Pass Wavelet Decompositions of Data Streams , 2003, IEEE Trans. Knowl. Data Eng..
[22] Martin Vetterli,et al. Sampling and reconstruction of signals with finite rate of innovation in the presence of noise , 2005, IEEE Transactions on Signal Processing.
[23] Thierry Blu,et al. Extrapolation and Interpolation) , 2022 .
[24] Pierre Vandergheynst,et al. Compressed Sensing and Redundant Dictionaries , 2007, IEEE Transactions on Information Theory.
[25] Lawrence Carin,et al. Bayesian Compressive Sensing , 2008, IEEE Transactions on Signal Processing.
[26] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[27] E. Candès,et al. People Hearing Without Listening : ” An Introduction To Compressive Sampling , 2007 .
[28] A. Bruckstein,et al. On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them , 2006 .
[29] Emmanuel J. Candès,et al. Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions , 2004, Found. Comput. Math..
[30] Richard G. Baraniuk,et al. Fast reconstruction of piecewise smooth signals from random projections , 2005 .