Abstract
We propose a best basis search algorithm for local cosine dictionaries. We improve upon the classical best local cosine basis selection based on a dyadic tree [2], by considering a larger dictionary of bases. This results in more compact representations, lower costs, and approximate shift-invariance. We also provide a version of our algorithm which is strictly shift-invariant.
| Original language | English (US) |
|---|---|
| Pages (from-to) | II773-II776 |
| Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| Volume | 2 |
| State | Published - 2004 |
| Event | Proceedings - IEEE International Conference on Acoustics, Speech, and Signal Processing - Montreal, Que, Canada Duration: May 17 2004 → May 21 2004 |
ASJC Scopus subject areas
- Software
- Signal Processing
- Electrical and Electronic Engineering