Proceedings Paper
Fast globally optimal search in tree-structured dictionaries| Format | Member Price | Non-Member Price |
|---|---|---|
| $17.00 | $21.00 |
Paper 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.
Paper Details
Date Published: 17 September 2005
PDF: 10 pages
Proc. SPIE 5914, Wavelets XI, 591410 (17 September 2005); doi: 10.1117/12.615428
Published in SPIE Proceedings Vol. 5914:
Wavelets XI
Manos Papadakis; Andrew F. Laine; Michael A. Unser, Editor(s)
PDF: 10 pages
Proc. SPIE 5914, Wavelets XI, 591410 (17 September 2005); doi: 10.1117/12.615428
Show Author Affiliations
Minh N. Do, Univ. of Illinois at Urbana-Champaign (United States)
Charles A. Bouman, Purdue Univ. (United States)
Charles A. Bouman, Purdue Univ. (United States)
Published in SPIE Proceedings Vol. 5914:
Wavelets XI
Manos Papadakis; Andrew F. Laine; Michael A. Unser, Editor(s)
© SPIE. Terms of Use
