Paper
6 April 1995 Efficient algorithm to find a jointly optimal time-frequency segmentation using time-varying filter banks
Author Affiliations +
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.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Cormac Herley, Zixiang Xiong, and Kannan Ramchandran "Efficient algorithm to find a jointly optimal time-frequency segmentation using time-varying filter banks", Proc. SPIE 2491, Wavelet Applications II, (6 April 1995); https://doi.org/10.1117/12.205393
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Time-frequency analysis

Electronic filtering

Image segmentation

Algorithm development

Wavelets

Evolutionary algorithms

Binary data

RELATED CONTENT

Quadtree-based block merging algorithm for subband coding
Proceedings of SPIE (February 17 1995)
Subpixel resolution with steerable filters
Proceedings of SPIE (March 23 1994)
Space adaptive wavelet packet image compression
Proceedings of SPIE (March 13 1996)

Back to Top