Embedding Prior Knowledge Within Compressed Sensing by Neural Networks
暂无分享,去创建一个
[1] Ting Sun,et al. Single-pixel imaging via compressive sampling , 2008, IEEE Signal Process. Mag..
[2] E. Candès. The restricted isometry property and its implications for compressed sensing , 2008 .
[3] Michael Elad,et al. On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations , 2008, IEEE Transactions on Information Theory.
[4] Deanna Needell,et al. Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit , 2007, IEEE Journal of Selected Topics in Signal Processing.
[5] H. Bischof,et al. The Photodetector Array Camera and Spectrometer (PACS) on the Herschel Space Observatory , 2010, 1005.1487.
[6] Pierre Vandergheynst,et al. Learning Bimodal Structure in Audio–Visual Data , 2009, IEEE Transactions on Neural Networks.
[7] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[8] S. Hyakin,et al. Neural Networks: A Comprehensive Foundation , 1994 .
[9] R. DeVore,et al. Compressed sensing and best k-term approximation , 2008 .
[10] Deanna Needell,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.
[11] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[12] Volkan Cevher,et al. Model-Based Compressive Sensing , 2008, IEEE Transactions on Information Theory.
[13] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[14] Stephen P. Boyd,et al. Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.
[15] Joel A. Tropp,et al. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.
[16] David L. Donoho,et al. Precise Undersampling Theorems , 2010, Proceedings of the IEEE.
[17] Kurt Hornik,et al. Multilayer feedforward networks are universal approximators , 1989, Neural Networks.
[18] Olgica Milenkovic,et al. Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.
[19] E. Candès,et al. Sparsity and incoherence in compressive sampling , 2006, math/0611957.
[20] D. Donoho. For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .
[21] David L. Donoho,et al. Sparse Solution Of Underdetermined Linear Equations By Stagewise Orthogonal Matching Pursuit , 2006 .