Flexible tree-structured signal expansions using time-varying wavelet packets

被引:45
|
作者
Xiong, ZX
Ramchandran, K
Herley, C
Orchard, MT
机构
[1] UNIV ILLINOIS,URBANA,IL 61801
[2] HEWLETT PACKARD CORP,PALO ALTO,CA 94304
关键词
D O I
10.1109/78.554299
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we address the problem of finding the best time-varying filter bank tree-structured 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 version, 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 flexible variation, is thus an advance on the wavelet packet algorithm, the double tree algorithm, and the recently proposed time-frequency tree algorithm. Our solution to the problem is based on casting it in a dynamic programming (DP) setting, Focusing on compression applications, we use a Lagrangian cost of distortion +lambda xrate as the objective function and explain our algorithm in detail, pointing out its relation to existing approaches to the problem, We demonstrate the the new algorithm indeed searches a larger library of representations than previously possible and that overcoming the constraint of dyadic time segmentations gives a significant improvement in practice. Compression experiments over various sources verify the superior performance of the new algorithm.
引用
收藏
页码:333 / 345
页数:13
相关论文
共 50 条
  • [1] Constrained wavelet packets for tree-structured video coding algorithms
    Khalil, H
    Jacquin, A
    Podilchuk, C
    [J]. DCC '99 - DATA COMPRESSION CONFERENCE, PROCEEDINGS, 1999, : 354 - 363
  • [2] Time-varying quadratic model selection using wavelet packets
    Green, M
    [J]. 2001 IEEE WORKSHOP ON STATISTICAL SIGNAL PROCESSING PROCEEDINGS, 2001, : 345 - 348
  • [3] TIME-VARYING LAPPED TRANSFORMS AND WAVELET PACKETS
    DEQUEIROZ, RL
    RAO, KR
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1993, 41 (12) : 3293 - 3305
  • [4] Time-varying filtering of signal and its applications based on wavelet packets analysis
    Sun, LS
    [J]. ICEMI'2003: PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON ELECTRONIC MEASUREMENT & INSTRUMENTS, VOLS 1-3, 2003, : 1404 - 1407
  • [5] ORTHOGONAL TIME-VARYING FILTER BANKS AND WAVELET PACKETS
    HERLEY, C
    VETTERLI, M
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1994, 42 (10) : 2650 - 2663
  • [6] Time-varying wavelet packets decomposition for AR model
    Fang, Hao
    Zhou, Bing
    Xue, Peiding
    Feng, Zuren
    [J]. Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2001, 23 (11):
  • [7] Texture retrieval using tree-structured wavelet transform
    Zhou, SH
    Venkatesh, YV
    Ko, CC
    [J]. PROCEEDINGS OF THE FIFTH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1 AND 2, 2000, : A168 - A171
  • [9] Limited Feedback Based on Tree-structured Codebook for MIMO Systems over Time-varying Channels
    Wu, Min
    Shen, Chao
    Qiu, Zhengding
    [J]. ISIP: 2009 INTERNATIONAL SYMPOSIUM ON INFORMATION PROCESSING, PROCEEDINGS, 2009, : 79 - 82
  • [10] Tree-structured modelling of varying coefficients
    Berger, Moritz
    Tutz, Gerhard
    Schmid, Matthias
    [J]. STATISTICS AND COMPUTING, 2019, 29 (02) : 217 - 229