17 September 2005 Fast globally optimal search in tree-structured dictionaries
Author Affiliations +
Proceedings Volume 5914, Wavelets XI; 591410 (2005) https://doi.org/10.1117/12.615428
Event: Optics and Photonics 2005, 2005, San Diego, California, United States
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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yan Huang, Ilya Pollak, Minh N. Do, Charles A. Bouman, "Fast globally optimal search in tree-structured dictionaries", Proc. SPIE 5914, Wavelets XI, 591410 (17 September 2005); doi: 10.1117/12.615428; https://doi.org/10.1117/12.615428

Back to Top