Robustness of orthogonal matching pursuit for multiple measurement vectors in noisy scenario
暂无分享,去创建一个
[1] Yan Wang,et al. Performance of orthogonal matching pursuit for multiple measurement vectors with noise , 2013, 2013 IEEE China Summit and International Conference on Signal and Information Processing.
[2] Entao Liu,et al. Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing ∗ , 2010 .
[3] D. Lorenz,et al. Greedy solution of ill-posed problems: error bounds and exact inversion , 2009, 0904.0154.
[4] Joel A. Tropp,et al. Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit , 2006, Signal Process..
[5] Kaushik Mahata,et al. A Robust Algorithm for Joint-Sparse Recovery , 2009, IEEE Signal Processing Letters.
[6] Bhaskar D. Rao,et al. Sparse solutions to linear inverse problems with multiple measurement vectors , 2005, IEEE Transactions on Signal Processing.
[7] Jie Chen,et al. Theoretical Results on Sparse Representations of Multiple-Measurement Vectors , 2006, IEEE Transactions on Signal Processing.
[8] Yonina C. Eldar,et al. From Theory to Practice: Sub-Nyquist Sampling of Sparse Wideband Analog Signals , 2009, IEEE Journal of Selected Topics in Signal Processing.
[9] Michael B. Wakin,et al. Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property , 2009, IEEE Transactions on Information Theory.
[10] Jie Ding,et al. Performance analysis of Orthogonal Matching Pursuit under general perturbations , 2012, 2012 International Conference on Computing, Networking and Communications (ICNC).
[11] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.