Abstract
This paper reviews recent best basis search algorithms. The problem under consideration is to select a representation from a dictionary which minimizes an additive cost function for a given signal. We describe a new framework of multitree dictionaries, and an efficient algorithm for finding the best representation in a multitree dictionary. We illustrate the algorithm through image compression examples.
| Original language | English (US) |
|---|---|
| Article number | 591410 |
| Pages (from-to) | 1-10 |
| Number of pages | 10 |
| Journal | Proceedings of SPIE - The International Society for Optical Engineering |
| Volume | 5914 |
| DOIs | |
| State | Published - 2005 |
| Event | Wavelets XI - San Diego, CA, United States Duration: Jul 31 2005 → Aug 3 2005 |
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Condensed Matter Physics
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering