DocumentCode
417455
Title
New algorithms for best local cosine basis search
Author
Huang, Y. ; Pollak, I. ; Bouman, C.A. ; Do, M.N.
Author_Institution
Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA
Volume
2
fYear
2004
fDate
17-21 May 2004
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 (Coifman, R.R. and Wickerhauser, M.V., IEEE Trans. Inf. Th., vol.38, no.2, p.713-18, 1992), 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.
Keywords
approximation theory; signal representation; tree searching; trees (mathematics); adaptive approximation; adaptive signal representation; best basis search algorithm; best local cosine basis selection; dyadic tree; local cosine dictionaries; shift-invariance; Costs; Dictionaries; Dynamic programming; Engineering profession; Entropy; Heuristic algorithms; Libraries; Signal representations; Time frequency analysis; Wavelet packets;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP '04). IEEE International Conference on
ISSN
1520-6149
Print_ISBN
0-7803-8484-9
Type
conf
DOI
10.1109/ICASSP.2004.1326372
Filename
1326372
Link To Document