Share Email Print

Proceedings Paper

Efficient algorithm to find a jointly optimal time-frequency segmentation using time-varying filter banks
Author(s): Cormac Herley; Zixiang Xiong; Kannan Ramchandran
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We examine the question of how to choose a time-varying filter bank representation for a signal which is optimal with respect to an additive cost function. The tree structure gives segmentations of the signal in frequency, while the time-varying nature of the tree gives segmentations in time. We present an efficient algorithm which finds the optimal basis, given the constraint that the time and frequency segmentations are binary. Extension to multiple dimensions is simple. We verify that the algorithm indeed produces a lower cost representation than any of the wavelet packet representations for compression of images using a simple rate-distortion cost.

Paper Details

Date Published: 6 April 1995
PDF: 11 pages
Proc. SPIE 2491, Wavelet Applications II, (6 April 1995); doi: 10.1117/12.205393
Show Author Affiliations
Cormac Herley, Hewlett-Packard Co. (United States)
Zixiang Xiong, Univ. of Illinois/Urbana-Champaign (United States)
Kannan Ramchandran, Univ. of Illinois/Urbana-Champaign (United States)

Published in SPIE Proceedings Vol. 2491:
Wavelet Applications II
Harold H. Szu, Editor(s)

© SPIE. Terms of Use
Back to Top