New algorithms for best local cosine basis search

Y. Huang, I. Pollak, C. A. Bouman, Minh N Do

Research output: Contribution to journalConference article

Abstract

We propose a best basis search algorithm for local cosine dictionaries. We improve upon the classical best local cosine basis selection based on a dyadic tree [2], by considering a larger dictionary of bases. This results in more compact representations, lower costs, and approximate shift-invariance. We also provide a version of our algorithm which is strictly shift-invariant.

Original languageEnglish (US)
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume2
StatePublished - Oct 7 2004
EventProceedings - IEEE International Conference on Acoustics, Speech, and Signal Processing - Montreal, Que, Canada
Duration: May 17 2004May 21 2004

Fingerprint

Glossaries
Invariance
Costs

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

New algorithms for best local cosine basis search. / Huang, Y.; Pollak, I.; Bouman, C. A.; Do, Minh N.

In: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, Vol. 2, 07.10.2004.

Research output: Contribution to journalConference article

@article{b075821e311a4529a65b69869adf4e34,
title = "New algorithms for best local cosine basis search",
abstract = "We propose a best basis search algorithm for local cosine dictionaries. We improve upon the classical best local cosine basis selection based on a dyadic tree [2], by considering a larger dictionary of bases. This results in more compact representations, lower costs, and approximate shift-invariance. We also provide a version of our algorithm which is strictly shift-invariant.",
author = "Y. Huang and I. Pollak and Bouman, {C. A.} and Do, {Minh N}",
year = "2004",
month = "10",
day = "7",
language = "English (US)",
volume = "2",
journal = "Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing",
issn = "0736-7791",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - New algorithms for best local cosine basis search

AU - Huang, Y.

AU - Pollak, I.

AU - Bouman, C. A.

AU - Do, Minh N

PY - 2004/10/7

Y1 - 2004/10/7

N2 - We propose a best basis search algorithm for local cosine dictionaries. We improve upon the classical best local cosine basis selection based on a dyadic tree [2], by considering a larger dictionary of bases. This results in more compact representations, lower costs, and approximate shift-invariance. We also provide a version of our algorithm which is strictly shift-invariant.

AB - We propose a best basis search algorithm for local cosine dictionaries. We improve upon the classical best local cosine basis selection based on a dyadic tree [2], by considering a larger dictionary of bases. This results in more compact representations, lower costs, and approximate shift-invariance. We also provide a version of our algorithm which is strictly shift-invariant.

UR - http://www.scopus.com/inward/record.url?scp=4644351953&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4644351953&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:4644351953

VL - 2

JO - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

JF - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

SN - 0736-7791

ER -