Fast orthogonal sparse approximation algorithms over local dictionaries


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… (More)
DOI: 10.1016/j.sigpro.2011.01.004


3 Figures and Tables