Fast globally optimal search in tree-structured dictionaries

Yan Huang, Ilya Pollak, N. Minh, Charles A. BoumanProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 2005 · DOI

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.
BibTeX
@inproceedings{huang2005fast,
  author = {Yan Huang and Ilya Pollak and N. Minh and Charles A. Bouman},
  title = {{Fast globally optimal search in tree-structured dictionaries}},
  booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
  year = {2005},
  doi = {10.1117/12.615428},
}

Loading related content...

Figure