Академический Документы
Профессиональный Документы
Культура Документы
The sequence any N uniformly spaced samples from a corresponding continuous function
2
10
11
FFT Algorithm
12
13
14
15
Number of operations
The number of complex multiplications and additions required to implement FFT Algorithm:
16
17
Inverse FFT
18
19
Implementation
20
21
22
T(u,v) Forward Transformion of f(x) g(x,y,u,v) Forward Transform Kernel u = 0,1,.,N-1 v = 0,1,.,N-1
24
25
26
Example
Forward kernel
u,v = 0,1,2,,N-1
28
Walsh Transform
29
30
31
32
33
34
Modification of the successive doubling FFT algorithm for computing the fast Walsh transform
35
36
Hadamard Transform
37
for x= 0,1,2,.,N-1
38
39
40
41
42
43
44
45
for u= 0,1,2,.,N-1
46
for x= 0,1,2,.,N-1
47
48
49
50
51
Haar Transform
Haar Transform based on Haar functions hk(z) Continuous and closed interval z [0, 1] for k = 0,1,2,,N-1 where N = 2n First step in generating Haar Transform, integer k decomposed uniquely k = 2p+ q 1 where N = 2n Where 0 p n-1 q= 0 or 1 for p = 0 1 q 2p for p 0
52
Haar Functions:
and
53
54
Slant Transform
55
For N>1
56
Example
57
Hotelling Transform
Developed based on stastical properties of vector representations Tool for Image processing (H.T. has several useful properties) Population of random vectors of the form:
The mean vector of the population: E{arg} expected value of the argument Subscript m associated with the population of x vectors
58
cij = cji = 0
59
For M vector samples from the random population, The mean vector & covariance from the samples:
60