A* orthogonal matching pursuit: Best-first search for compressed sensing signal recovery
暂无分享,去创建一个
[1] RaphaelBertram,et al. Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths" , 1972 .
[2] David Furcy,et al. Incremental Heuristic Search in AI , 2004, AI Mag..
[3] Jean-Luc Starck,et al. Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.
[4] Minh N. Do,et al. Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction , 2006, 2006 International Conference on Image Processing.
[5] Stephen J. Wright,et al. Computational Methods for Sparse Solution of Linear Inverse Problems , 2010, Proceedings of the IEEE.
[6] M. Rudelson,et al. Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[7] Olgica Milenkovic,et al. Sublinear compressive sensing reconstruction via belief propagation decoding , 2009, 2009 IEEE International Symposium on Information Theory.
[8] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[9] Frederick Jelinek,et al. Statistical methods for speech recognition , 1997 .
[10] Yurii Nesterov,et al. Smooth minimization of non-smooth functions , 2005, Math. Program..
[11] Michael Elad,et al. A Plurality of Sparse Representations Is Better Than the Sparsest One Alone , 2009, IEEE Transactions on Information Theory.
[12] Olgica Milenkovic,et al. Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.
[13] Y. C. Pati,et al. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.
[14] T. Blumensath,et al. Iterative Thresholding for Sparse Approximations , 2008 .
[15] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[16] Volkan Cevher,et al. Fast hard thresholding with Nesterov"s gradient method , 2010, NIPS 2010.
[17] Emmanuel J. Candès,et al. Error correction via linear programming , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[18] Stephen A. Dyer,et al. Digital signal processing , 2018, 8th International Multitopic Conference, 2004. Proceedings of INMIC 2004..
[19] Michael Elad,et al. Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[20] B. M. Fulk. MATH , 1992 .
[21] David L. Donoho,et al. Sparse Solution Of Underdetermined Linear Equations By Stagewise Orthogonal Matching Pursuit , 2006 .
[22] E. Candès. The restricted isometry property and its implications for compressed sensing , 2008 .
[23] Bhaskar D. Rao,et al. Application of tree-based searches to matching pursuit , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).
[24] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..
[25] Emmanuel J. Cand. The Restricted Isometry Property and Its Implications for Compressed Sensing , 2008 .
[26] Justin Ziniel,et al. Fast bayesian matching pursuit , 2008, 2008 Information Theory and Applications Workshop.
[27] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[28] Mike E. Davies,et al. Iterative Hard Thresholding for Compressed Sensing , 2008, ArXiv.
[29] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[30] Rina Dechter,et al. Generalized best-first search strategies and the optimality of A* , 1985, JACM.
[31] Hakan Erdogan,et al. Compressed sensing signal recovery via A* Orthogonal Matching Pursuit , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[32] Joel A. Tropp,et al. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.
[33] S. Foucart,et al. Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0 , 2009 .
[34] G. Karabulut,et al. Integrating flexible tree searches to orthogonal matching pursuit algorithm , 2006 .
[35] Deanna Needell,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.
[36] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[37] D. Donoho,et al. Basis pursuit , 1994, Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers.
[38] H. Rauhut. On the Impossibility of Uniform Sparse Reconstruction using Greedy Methods , 2007 .
[39] Deanna Needell,et al. Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit , 2007, Found. Comput. Math..