Loading...
Please wait, while we are loading the content...
Similar Documents
Flexible Tree-structured Signal Expansions Using Time-varying Wavelet Packets (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Herley, Cormac Xiong, Zixiang Ramchandran, Kannan Orchard, Michael T. |
| Abstract | In this paper we address the problem of finding the best time-varying filter bank treestructured representation for a signal. The tree is allowed to vary at regular intervals, and the spacing of these changes can be arbitrarily short. The question of how to choose tree-structured representations of signals based on filter banks has attracted considerable attention. Wavelets, and their adaptive versions, known as wavelet packets, represent one approach that has proved very popular. Wavelet packets are subband trees where the tree is chosen to match the characteristics of the signal. Variations where the tree varies over time have been proposed as the double tree, and the time-frequency tree algorithms. Time-variation adds a further level of adaptivity. In all of the approaches proposed so far the tree must be either fixed for the whole duration of the signal, or fixed for its dyadic subintervals (i.e. halves, quarters, etc). The solution that we propose, since it allows much more flexib... |
| File Format | |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Wavelet Packet Time-varying Filter Bank Subband Tree Dyadic Subintervals Regular Interval Tree-structured Representation Adaptive Version Filter Bank Double Tree Time-frequency Tree Algorithm Considerable Attention Whole Duration |
| Content Type | Text |
| Resource Type | Article |
