Back to Search
Start Over
Fast orthogonal sparse approximation algorithms over local dictionaries
- Source :
-
Signal Processing . Dec2011, Vol. 91 Issue 12, p2822-2835. 14p. - Publication Year :
- 2011
-
Abstract
- Abstract: In this work we present a new greedy algorithm for sparse approximation called LocOMP. LocOMP is meant to be run on local dictionaries made of atoms with much shorter supports than the signal length. This notably encompasses shift-invariant dictionaries and time–frequency dictionaries, be they monoscale or multiscale. In this case, very fast implementations of Matching Pursuit are already available. LocOMP is almost as fast as Matching Pursuit while approaching the signal almost as well as the much slower Orthogonal Matching Pursuit. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 01651684
- Volume :
- 91
- Issue :
- 12
- Database :
- Academic Search Index
- Journal :
- Signal Processing
- Publication Type :
- Academic Journal
- Accession number :
- 63978905
- Full Text :
- https://doi.org/10.1016/j.sigpro.2011.01.004