Deterministic construction of compressed sensing matrices with characters over finite fields
暂无分享,去创建一个
[1] Piotr Indyk,et al. Sparse Recovery Using Sparse Matrices , 2010, Proceedings of the IEEE.
[2] Stephen J. Dilworth,et al. Explicit constructions of RIP matrices and related problems , 2010, ArXiv.
[3] R. Calderbank,et al. Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery , 2009 .
[4] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[5] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.
[6] J. Tropp,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, Commun. ACM.
[7] Balas K. Natarajan,et al. Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..
[8] Lloyd R. Welch,et al. Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[9] Deanna Needell,et al. Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit , 2007, Found. Comput. Math..
[10] Joel A. Tropp,et al. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.
[11] Gennian Ge,et al. Deterministic Sensing Matrices Arising From Near Orthogonal Systems , 2014, IEEE Transactions on Information Theory.
[12] Gennian Ge,et al. Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves , 2012, IEEE Transactions on Information Theory.
[13] Farrokh Marvasti,et al. Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices , 2009, IEEE Transactions on Information Theory.
[14] Jean-Luc Starck,et al. Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.
[15] Olgica Milenkovic,et al. Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.
[16] R. DeVore,et al. Compressed sensing and best k-term approximation , 2008 .
[17] Farrokh Marvasti,et al. Matrices With Small Coherence Using $p$-Ary Block Codes , 2012, IEEE Transactions on Signal Processing.
[18] You Gao,et al. Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields , 2016 .
[19] Ronald A. DeVore,et al. Deterministic constructions of compressed sensing matrices , 2007, J. Complex..
[20] R. DeVore,et al. A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .