Time-frequency analysis with best local cosine bases

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]  Charles A. Bouman,et al.  New algorithms for best local cosine basis search , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[2]  Henrique S. Malvar,et al.  Signal processing with lapped transforms , 1992 .

[3]  Charles A. Bouman,et al.  Optimal tilings and best basis search in large dictionaries , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[4]  Ronald R. Coifman,et al.  Entropy-based algorithms for best basis selection , 1992, IEEE Trans. Inf. Theory.

[5]  S. Mallat.  A wavelet tour of signal processing , 1998 .