New algorithms for best local cosine basis search

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

New algorithms for best local cosine basis search

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

Research output: Contribution to journal › Conference article › peer-review

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 language	English (US)
Pages (from-to)	II773-II776
Journal	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume	2
State	Published - 2004
Event	Proceedings - IEEE International Conference on Acoustics, Speech, and Signal Processing - Montreal, Que, Canada Duration: May 17 2004 → May 21 2004

ASJC Scopus subject areas

Software
Signal Processing
Electrical and Electronic Engineering

Library availability

Discover UIUC Full Text

Cite this

@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",

language = "English (US)",

volume = "2",

pages = "II773--II776",

journal = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

issn = "1520-6149",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings - IEEE International Conference on Acoustics, Speech, and Signal Processing ; Conference date: 17-05-2004 Through 21-05-2004",

}

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

Y1 - 2004

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

SN - 1520-6149

VL - 2

SP - II773-II776

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

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

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

Y2 - 17 May 2004 through 21 May 2004

ER -

New algorithms for best local cosine basis search

Abstract

ASJC Scopus subject areas

Library availability

Related links

Fingerprint

Cite this