article · 2004
Improved sparse approximation over quasiincoherent dictionaries
Joel A. Tropp, Anna C. Gilbert, S. Muthukrishnan, Michael Strauss
Cited by 74Abstract and details only
Abstract
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.
Cite this paper
Tropp, J. A., Gilbert, A. C., Muthukrishnan, S., & Strauss, M. (2004). Improved sparse approximation over quasiincoherent dictionaries. https://doi.org/10.1109/icip.2003.1246892
Tropp, Joel A., et al. “Improved sparse approximation over quasiincoherent dictionaries.” vol. 1, 2004, pp. I–37, https://doi.org/10.1109/icip.2003.1246892.
Tropp, Joel A., Anna C. Gilbert, S. Muthukrishnan, and Michael Strauss. 2004. “Improved sparse approximation over quasiincoherent dictionaries.” https://doi.org/10.1109/icip.2003.1246892.
Tropp, J.A. et al. (2004) ‘Improved sparse approximation over quasiincoherent dictionaries’. Available at: https://doi.org/10.1109/icip.2003.1246892.
@article{tropp2004improved,
title = {{Improved sparse approximation over quasiincoherent dictionaries}},
author = {Tropp, Joel A. and Gilbert, Anna C. and Muthukrishnan, S. and Strauss, Michael},
volume = {1},
pages = {I--37},
year = {2004},
doi = {10.1109/icip.2003.1246892}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.