Improved sparse approximation over quasiincoherent dictionaries
Joel A. Tropp, Anna C. Gilbert, Subramanian Muthukrishnan, Michael Strauss · 2004
This paper discusses a new greedy algorithm for solving the sparse approximation problem over quasiincoherent dictionaries. These dictionaries consist of waveforms that are uncorrelated "on average," and they provide a natural generalization of incoherent dictionaries. The algorithm provides strong guarantees on the quality of the approximations it produces, unlike most other methods for sparse approximation. Moreover, very efficient implementations are possible via approximate nearest-neighbor data structures.