Fast globally optimal search in tree-structured dictionaries

Yan Huang; Ilya Pollak; Minh N. Do; Charles A. Bouman

doi:10.1117/12.615428

17 September 2005 Fast globally optimal search in tree-structured dictionaries

Yan Huang, Ilya Pollak, Minh N. Do, Charles A. Bouman

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE