Deterministic phase guarantees for robust recovery in incoherent dictionaries
暂无分享,去创建一个
[1] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[2] Xiaoming Huo,et al. Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.
[3] Helmut Bölcskei,et al. Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets , 2012, IEEE Transactions on Information Theory.
[4] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[5] Joel A. Tropp,et al. Recovery of short, complex linear combinations via /spl lscr//sub 1/ minimization , 2005, IEEE Transactions on Information Theory.
[6] E. Candès,et al. Near-ideal model selection by ℓ1 minimization , 2008, 0801.0345.
[7] Helmut Bölcskei,et al. Where is randomness needed to break the square-root bottleneck? , 2010, 2010 IEEE International Symposium on Information Theory.
[8] J. Tropp. On the conditioning of random subdictionaries , 2008 .
[9] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[10] Emmanuel J. Candès,et al. Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions , 2004, Found. Comput. Math..
[11] Jean-Jacques Fuchs,et al. On sparse representations in arbitrary redundant bases , 2004, IEEE Transactions on Information Theory.