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

共 14 条

[1]

AGAIAN SS, 1992, PATTERN RECOGN, P146

[2]

Ahmed N, 1975, ORTHOGONAL TRANSFORM

[3]

[Anonymous], 1998, Wavelet Analysis: the Scalable Structure of Information

[4]

Beauchamp K. G., 1975, WALSH FUNCTIONS THEI

[5] On generalized Fibonacci cubes and unitary transforms [J].

Egiazarian, K ;

Astola, J .

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1997, 8 (05) :371-377

[6]

EGIAZARIAN K, 1997, P 5 IEEE INT WORKSH

[7]

EGIAZARIAN K, 1996, P IEEE DIG SIGN PROC

[8]

EGIAZARIAN K, 1999, P 2 INT WORKSH SPECT

[9]

Elliott DF, 1982, FAST TRANSFORMS ALGO

[10] On the theory of orthogonal function systems (First announcement) [J].

Haar, A .

MATHEMATISCHE ANNALEN, 1910, 69 :331-371

← 1 2 →