Translator Disclaimer
Paper
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
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.
© (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, and Charles A. Bouman "Fast globally optimal search in tree-structured dictionaries", Proc. SPIE 5914, Wavelets XI, 591410 (17 September 2005); https://doi.org/10.1117/12.615428
PROCEEDINGS
10 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Multiscale geometric image processing
Proceedings of SPIE (June 23 2003)
Toward a stereoscopic encoder/decoder for digital cinema
Proceedings of SPIE (February 29 2008)
Experiments in JPEG 2000-based INTRA coding for H.26L
Proceedings of SPIE (June 23 2003)
Geometric methods for wavelet-based image compression
Proceedings of SPIE (November 13 2003)

Back to Top