Abstract

We propose new best basis search algorithms for local cosine dictionaries. We provide several algorithms for dictionaries of various complexity. Our framework generalizes the classical best local cosine basis selection based on a dyadic tree [1].

Original languageEnglish (US)
Pages (from-to)187-192
Number of pages6
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume5299
DOIs
StatePublished - 2004
EventComputational Imaging II - San Jose, CA, United States
Duration: Jan 19 2004Jan 20 2004

Keywords

  • Best basis
  • Local cosine basis
  • Multitree
  • Overcomplete dictionaries

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Time-frequency analysis with best local cosine bases'. Together they form a unique fingerprint.

Cite this