Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit
- 1 March 2006
- journal article
- research article
- Published by Elsevier BV in Signal Processing
- Vol. 86 (3), 572-588
- https://doi.org/10.1016/j.sigpro.2005.05.030
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Algorithms for simultaneous sparse approximation. Part II: Convex relaxationSignal Processing, 2006
- Sparse solutions to linear inverse problems with multiple measurement vectorsIEEE Transactions on Signal Processing, 2005
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Vector greedy algorithmsJournal of Complexity, 2003
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimizationProceedings of the National Academy of Sciences of the United States of America, 2003
- Orthogonal matching pursuit: recursive function approximation with applications to wavelet decompositionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sparse channel estimation via matching pursuit with application to equalizationIEEE Transactions on Communications, 2002
- Computing the norm ∥A∥∞,1 is NP-hard∗Linear and Multilinear Algebra, 2000
- Adaptive greedy approximationsConstructive Approximation, 1997
- Neuromagnetic source imaging with FOCUSS: a recursive weighted minimum norm algorithmElectroencephalography and Clinical Neurophysiology, 1995