Subspace Pursuit for Compressive Sensing Signal Reconstruction
暂无分享,去创建一个
[1] J. Navarro-Pedreño. Numerical Methods for Least Squares Problems , 1996 .
[2] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[3] Graham Cormode,et al. Combinatorial Algorithms for Compressed Sensing , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[4] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[5] R. Varga. Geršgorin And His Circles , 2004 .
[6] Yaakov Tsaig,et al. Fast Solution of $\ell _{1}$ -Norm Minimization Problems When the Solution May Be Sparse , 2008, IEEE Transactions on Information Theory.
[7] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[8] 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.
[9] Yoram Bresler,et al. Sub-Nyquist sampling of multiband signals: perfect reconstruction and bounds on aliasing error , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).
[10] Richard Baraniuk,et al. Compressed Sensing Reconstruction via Belief Propagation , 2006 .
[11] Stephen P. Boyd,et al. An Interior-Point Method for Large-Scale $\ell_1$-Regularized Least Squares , 2007, IEEE Journal of Selected Topics in Signal Processing.
[12] E. Candès. The restricted isometry property and its implications for compressed sensing , 2008 .
[13] Paul Tseng,et al. A coordinate gradient descent method for nonsmooth separable minimization , 2008, Math. Program..
[14] R. Vershynin,et al. One sketch for all: fast algorithms for compressed sensing , 2007, STOC '07.
[15] Deanna Needell,et al. Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit , 2007, Found. Comput. Math..
[16] Yunghsiang Sam Han,et al. Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes , 1993, IEEE Trans. Inf. Theory.
[17] Deanna Needell,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.
[18] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[19] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.
[20] Richard G. Baraniuk,et al. Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.
[21] Emmanuel J. Candès,et al. Error correction via linear programming , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[22] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.