Optimal tilings and best basis search in large dictionaries

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

Research output: Contribution to journalConference articlepeer-review

Abstract

We develop a new framework of multitree dictionaries which include many previously proposed dictionaries as special cases. We show how to efficiently find the best object in a multitree dictionary using a recursive dynamic programming algorithm. We apply our framework to find the best rectangular tiling of an image domain.

Original languageEnglish (US)
Pages (from-to)327-331
Number of pages5
JournalConference Record of the Asilomar Conference on Signals, Systems and Computers
Volume1
StatePublished - Dec 1 2003
EventConference Record of the Thirty-Seventh Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: Nov 9 2003Nov 12 2003

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Optimal tilings and best basis search in large dictionaries'. Together they form a unique fingerprint.

Cite this