1 paper
Gilles Monnoyer de Galland, Luc Vandendorpe, Laurent Jacques
We propose a fast greedy algorithm to compute sparse representations of signals from continuous dictionaries that are factorizable, i.e., with atoms that can be separated as a prod…