Fast globally optimal search in tree-structured dictionaries

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

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish (US)
Article number591410
Pages (from-to)1-10
Number of pages10
JournalProceedings of SPIE - The International Society for Optical Engineering
StatePublished - 2005
EventWavelets XI - San Diego, CA, United States
Duration: Jul 31 2005Aug 3 2005

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering


Dive into the research topics of 'Fast globally optimal search in tree-structured dictionaries'. Together they form a unique fingerprint.

Cite this