Name
Title | ||
|---|---|---|
An efficient algorithm to find a jointly optimal time-frequency segmentation using time-varying filter banks |
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. We present in detail an efficient algorithm for the Haar filter set which finds the optimal basis, given the constraint that the time and frequency segmentations are binary. Extension to multiple dimensions is simple, and the use of arbitrary filter sets is also possible. 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. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1109/ICASSP.1995.480573 | Acoustics, Speech, and Signal Processing, 1995. ICASSP-95., 1995 International Conference |
Keywords | Field | DocType |
data compression,filtering theory,image representation,image segmentation,rate distortion theory,time-frequency analysis,time-varying filters,wavelet transforms,Haar filter set,algorithm,arbitrary filter sets,cost representation,frequency segmentation,image compression,optimal additive cost function,optimal time-frequency segmentation,rate-distortion cost,signal representation,time segmentation,time-varying filter banks,wavelet packet representations | Computer science,Filter bank,Image segmentation,Artificial intelligence,Adaptive filter,Wavelet packet decomposition,Wavelet transform,Wavelet,Mathematical optimization,Pattern recognition,Algorithm,Kernel adaptive filter,Filter design | Conference |
Volume | ISSN | ISBN |
2 | 1520-6149 | 0-7803-2431-5 |
Citations | PageRank | References |
5 | 0.88 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Herley | 1 | 2424 | 315.41 |
| Zixiang Xiong | 2 | 5 | 0.88 |
| Ramchandran, K. | 3 | 5 | 0.88 |
| Orchard, M.T. | 4 | 5 | 0.88 |