Tree-structured Haar transforms

被引：30

作者：

Egiazarian, K ^{[1
]}

Astola, J ^{[1
]}

机构：

[1] Tampere Univ Technol, Signal Proc Lab, FIN-33101 Tampere, Finland

来源：

JOURNAL OF MATHEMATICAL IMAGING AND VISION | 2002年 / 16卷 / 03期

关键词：

Haar functions; Haar transform; fast algorithms; Walsh transform; binary tree; Fibonacci tree; wavelet packets;

D O I：

10.1023/A:1020385811959

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The Haar transform is generalized to the case of an arbitrary time and scale splitting. To any binary tree we associate an orthogonal system of Haar-type functions-tree-structured Haar (TSH) functions. Unified fast algorithm for computation of the introduced tree-structured Haar transforms is presented. It requires 2(N-1) additions and 3N-2 multiplications, where N is transform order or, equivalently, the number of leaves of the binary tree.

引用

页码：269 / 279

页数：11