Abstract
We propose new best basis search algorithms for local cosine dictionaries. We provide several algorithms for dictionaries of various complexity. Our framework generalizes the classical best local cosine basis selection based on a dyadic tree [1].
Original language | English (US) |
---|---|
Pages (from-to) | 187-192 |
Number of pages | 6 |
Journal | Proceedings of SPIE - The International Society for Optical Engineering |
Volume | 5299 |
DOIs | |
State | Published - 2004 |
Event | Computational Imaging II - San Jose, CA, United States Duration: Jan 19 2004 → Jan 20 2004 |
Keywords
- Best basis
- Local cosine basis
- Multitree
- Overcomplete dictionaries
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Condensed Matter Physics
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering