Abstract
We develop a new framework of multitree dictionaries which include many previously proposed dictionaries as special cases. We show how to efficiently find the best object in a multitree dictionary using a recursive dynamic programming algorithm. We apply our framework to find the best rectangular tiling of an image domain.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 327-331 |
| Number of pages | 5 |
| Journal | Conference Record of the Asilomar Conference on Signals, Systems and Computers |
| Volume | 1 |
| State | Published - 2003 |
| Event | Conference Record of the Thirty-Seventh Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States Duration: Nov 9 2003 → Nov 12 2003 |
ASJC Scopus subject areas
- Signal Processing
- Computer Networks and Communications