Paper: | SPTM-P6.11 | ||
Session: | Non-Stationary Signal Analysis and Modeling | ||
Time: | Thursday, May 20, 09:30 - 11:30 | ||
Presentation: | Poster | ||
Topic: | Signal Processing Theory and Methods: Non-stationary Signals & Time-Frequency Analysis | ||
Title: | NEW ALGORITHMS FOR BEST LOCAL COSINE BASIS SEARCH | ||
Authors: | Yan Huang; Purdue University | ||
Ilya Pollak; Purdue University | |||
Charles Bouman; Purdue University | |||
Minh N. Do; University of Illinois at Urbana-Champaign | |||
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, 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. | ||
Back |
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops