forked from ct6502/wavelets
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathwaveletFunctions.py
More file actions
424 lines (372 loc) · 16.9 KB
/
Copy pathwaveletFunctions.py
File metadata and controls
424 lines (372 loc) · 16.9 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
from scipy.special._ufuncs import gammainc, gamma
import numpy as np
from scipy.optimize import fminbound
__author__ = 'Evgeniya Predybaylo'
# Copyright (C) 1995-2004, Christopher Torrence and Gilbert P.Compo
# Python version of the code is written by Evgeniya Predybaylo in 2014
#
# This software may be used, copied, or redistributed as long as it is not
# sold and this copyright notice is reproduced on each copy made. This
# routine is provided as is without any express or implied warranties
# whatsoever.
#
# Notice: Please acknowledge the use of the above software in any publications:
# Wavelet software was provided by C. Torrence and G. Compo,
# and is available at URL: http://paos.colorado.edu/research/wavelets/''.
#
# Reference: Torrence, C. and G. P. Compo, 1998: A Practical Guide to
# Wavelet Analysis. <I>Bull. Amer. Meteor. Soc.</I>, 79, 61-78.
#
# Please send a copy of such publications to either C. Torrence or G. Compo:
# Dr. Christopher Torrence Dr. Gilbert P. Compo
# Research Systems, Inc. Climate Diagnostics Center
# 4990 Pearl East Circle 325 Broadway R/CDC1
# Boulder, CO 80301, USA Boulder, CO 80305-3328, USA
# E-mail: chris[AT]rsinc[DOT]com E-mail: compo[AT]colorado[DOT]edu
#
#-------------------------------------------------------------------------------------------------------------------
# # WAVELET 1D Wavelet transform with optional significance testing
# wave, period, scale, coi = wavelet(Y, dt, pad, dj, s0, J1, mother, param)
#
# Computes the wavelet transform of the vector Y (length N),
# with sampling rate DT.
#
# By default, the Morlet wavelet (k0=6) is used.
# The wavelet basis is normalized to have total energy=1 at all scales.
#
# INPUTS:
#
# Y = the time series of length N.
# DT = amount of time between each Y value, i.e. the sampling time.
#
# OUTPUTS:
#
# WAVE is the WAVELET transform of Y. This is a complex array
# of dimensions (N,J1+1). FLOAT(WAVE) gives the WAVELET amplitude,
# ATAN(IMAGINARY(WAVE),FLOAT(WAVE) gives the WAVELET phase.
# The WAVELET power spectrum is ABS(WAVE)**2.
# Its units are sigma**2 (the time series variance).
#
# OPTIONAL INPUTS:
#
# *** Note *** if none of the optional variables is set up, then the program
# uses default values of -1.
#
# PAD = if set to 1 (default is 0), pad time series with enough zeroes to get
# N up to the next higher power of 2. This prevents wraparound
# from the end of the time series to the beginning, and also
# speeds up the FFT's used to do the wavelet transform.
# This will not eliminate all edge effects (see COI below).
#
# DJ = the spacing between discrete scales. Default is 0.25.
# A smaller # will give better scale resolution, but be slower to plot.
#
# S0 = the smallest scale of the wavelet. Default is 2*DT.
#
# J1 = the # of scales minus one. Scales range from S0 up to S0*2**(J1*DJ),
# to give a total of (J1+1) scales. Default is J1 = (LOG2(N DT/S0))/DJ.
#
# MOTHER = the mother wavelet function.
# The choices are 'MORLET', 'PAUL', or 'DOG'
#
# PARAM = the mother wavelet parameter.
# For 'MORLET' this is k0 (wavenumber), default is 6.
# For 'PAUL' this is m (order), default is 4.
# For 'DOG' this is m (m-th derivative), default is 2.
#
#
# OPTIONAL OUTPUTS:
#
# PERIOD = the vector of "Fourier" periods (in time units) that corresponds
# to the SCALEs.
#
# SCALE = the vector of scale indices, given by S0*2**(j*DJ), j=0...J1
# where J1+1 is the total # of scales.
#
# COI = if specified, then return the Cone-of-Influence, which is a vector
# of N points that contains the maximum period of useful information
# at that particular time.
# Periods greater than this are subject to edge effects.
def wavelet(Y, dt, pad=0, dj=-1, s0=-1, J1=-1, mother=-1, param=-1):
n1 = len(Y)
if s0 == -1:
s0 = 2 * dt
if dj == -1:
dj = 1. / 4.
if J1 == -1:
J1 = np.fix((np.log(n1 * dt / s0) / np.log(2)) / dj)
if mother == -1:
mother = 'MORLET'
#....construct time series to analyze, pad if necessary
x = Y - np.mean(Y)
if pad == 1:
base2 = np.fix(np.log(n1) / np.log(2) + 0.4999) # power of 2 nearest to N
x = np.concatenate((x, np.zeros((2 ** (base2 + 1) - n1).astype(np.int64))))
n = len(x)
#....construct wavenumber array used in transform [Eqn(5)]
kplus = np.arange(1, np.fix(n / 2 + 1))
kplus = (kplus * 2 * np.pi / (n * dt))
kminus = (-(kplus[0:-1])[::-1])
k = np.concatenate(([0.], kplus, kminus))
#....compute FFT of the (padded) time series
f = np.fft.fft(x) # [Eqn(3)]
#....construct SCALE array & empty PERIOD & WAVE arrays
j = np.arange(0, J1+1)
scale = s0 * 2. ** (j * dj)
wave = np.zeros(shape=(int(J1 + 1), n), dtype=complex) # define the wavelet array
# loop through all scales and compute transform
for a1 in range(0, int(J1+1)):
daughter, fourier_factor, coi, dofmin = wave_bases(mother, k, scale[a1], param)
wave[a1, :] = np.fft.ifft(f * daughter) # wavelet transform[Eqn(4)]
period = fourier_factor * scale # [Table(1)]
coi = coi * dt * np.concatenate((np.insert(np.arange(int((n1 + 1) / 2 - 1)), [0], [1E-5]),
np.insert(np.flipud(np.arange(0, n1 / 2 - 1)), [-1], [1E-5]))) # COI [Sec.3g]
wave = wave[:, :n1] # get rid of padding before returning
return wave, period, scale, coi
#-------------------------------------------------------------------------------------------------------------------
# WAVE_BASES 1D Wavelet functions Morlet, Paul, or DOG
#
# DAUGHTER,FOURIER_FACTOR,COI,DOFMIN = wave_bases(MOTHER,K,SCALE,PARAM)
#
# Computes the wavelet function as a function of Fourier frequency,
# used for the wavelet transform in Fourier space.
# (This program is called automatically by WAVELET)
#
# INPUTS:
#
# MOTHER = a string, equal to 'MORLET' or 'PAUL' or 'DOG'
# K = a vector, the Fourier frequencies at which to calculate the wavelet
# SCALE = a number, the wavelet scale
# PARAM = the nondimensional parameter for the wavelet function
#
# OUTPUTS:
#
# DAUGHTER = a vector, the wavelet function
# FOURIER_FACTOR = the ratio of Fourier period to scale
# COI = a number, the cone-of-influence size at the scale
# DOFMIN = a number, degrees of freedom for each point in the wavelet power
# (either 2 for Morlet and Paul, or 1 for the DOG)
def wave_bases(mother, k, scale, param):
n = len(k)
kplus = np.array(k > 0., dtype=float)
if mother == 'MORLET': # ----------------------------------- Morlet
if param == -1:
param = 6.
k0 = np.copy(param)
expnt = -(scale * k - k0) ** 2 / 2. * kplus
norm = np.sqrt(scale * k[1]) * (np.pi ** (-0.25)) * \
np.sqrt(n) # total energy=N [Eqn(7)]
daughter = norm * np.exp(expnt)
daughter = daughter * kplus # Heaviside step function
fourier_factor = (4 * np.pi) / (k0 + np.sqrt(2 + k0 ** 2)
) # Scale-->Fourier [Sec.3h]
coi = fourier_factor / np.sqrt(2) # Cone-of-influence [Sec.3g]
dofmin = 2 # Degrees of freedom
elif mother == 'PAUL': # -------------------------------- Paul
if param == -1:
param = 4.
m = param
expnt = -scale * k * kplus
norm = np.sqrt(scale * k[1]) * (2 ** m / np.sqrt(m *
np.prod(np.arange(1, (2 * m))))) * np.sqrt(n)
daughter = norm * ((scale * k) ** m) * np.exp(expnt) * kplus
fourier_factor = 4 * np.pi / (2 * m + 1)
coi = fourier_factor * np.sqrt(2)
dofmin = 2
elif mother == 'DOG': # -------------------------------- DOG
if param == -1:
param = 2.
m = param
expnt = -(scale * k) ** 2 / 2.0
norm = np.sqrt(scale * k[1] / gamma(m + 0.5)) * np.sqrt(n)
daughter = -norm * (1j ** m) * ((scale * k) ** m) * np.exp(expnt)
fourier_factor = 2 * np.pi * np.sqrt(2. / (2 * m + 1))
coi = fourier_factor / np.sqrt(2)
dofmin = 1
else:
print('Mother must be one of MORLET, PAUL, DOG')
return daughter, fourier_factor, coi, dofmin
#-------------------------------------------------------------------------------------------------------------------
# WAVE_SIGNIF Significance testing for the 1D Wavelet transform WAVELET
#
# SIGNIF = wave_signif(Y,DT,SCALE,SIGTEST,LAG1,SIGLVL,DOF,MOTHER,PARAM)
#
# INPUTS:
#
# Y = the time series, or, the VARIANCE of the time series.
# (If this is a single number, it is assumed to be the variance...)
# DT = amount of time between each Y value, i.e. the sampling time.
# SCALE = the vector of scale indices, from previous call to WAVELET.
#
#
# OUTPUTS:
#
# SIGNIF = significance levels as a function of SCALE
# FFT_THEOR = output theoretical red-noise spectrum as fn of PERIOD
#
#
# OPTIONAL INPUTS:
# SIGTEST = 0, 1, or 2. If omitted, then assume 0.
#
# If 0 (the default), then just do a regular chi-square test,
# i.e. Eqn (18) from Torrence & Compo.
# If 1, then do a "time-average" test, i.e. Eqn (23).
# In this case, DOF should be set to NA, the number
# of local wavelet spectra that were averaged together.
# For the Global Wavelet Spectrum, this would be NA=N,
# where N is the number of points in your time series.
# If 2, then do a "scale-average" test, i.e. Eqns (25)-(28).
# In this case, DOF should be set to a
# two-element vector [S1,S2], which gives the scale
# range that was averaged together.
# e.g. if one scale-averaged scales between 2 and 8,
# then DOF=[2,8].
#
# LAG1 = LAG 1 Autocorrelation, used for SIGNIF levels. Default is 0.0
#
# SIGLVL = significance level to use. Default is 0.95
#
# DOF = degrees-of-freedom for signif test.
# IF SIGTEST=0, then (automatically) DOF = 2 (or 1 for MOTHER='DOG')
# IF SIGTEST=1, then DOF = NA, the number of times averaged together.
# IF SIGTEST=2, then DOF = [S1,S2], the range of scales averaged.
#
# Note: IF SIGTEST=1, then DOF can be a vector (same length as SCALEs),
# in which case NA is assumed to vary with SCALE.
# This allows one to average different numbers of times
# together at different scales, or to take into account
# things like the Cone of Influence.
# See discussion following Eqn (23) in Torrence & Compo.
#
# GWS = global wavelet spectrum, a vector of the same length as scale.
# If input then this is used as the theoretical background spectrum,
# rather than white or red noise.
def wave_signif(Y, dt, scale, sigtest=0, lag1=0.0, siglvl=0.95,
dof=None, mother='MORLET', param=None, gws=None):
n1 = len(np.atleast_1d(Y))
J1 = len(scale) - 1
s0 = np.min(scale)
dj = np.log2(scale[1] / scale[0])
if n1 == 1:
variance = Y
else:
variance = np.std(Y) ** 2
# get the appropriate parameters [see Table(2)]
if mother == 'MORLET': # ---------------------------------- Morlet
empir = ([2., -1, -1, -1])
if param is None:
param = 6.
empir[1:] = ([0.776, 2.32, 0.60])
k0 = param
fourier_factor = (4 * np.pi) / (k0 + np.sqrt(2 + k0 ** 2)) # Scale-->Fourier [Sec.3h]
elif mother == 'PAUL':
empir = ([2, -1, -1, -1])
if param is None:
param = 4
empir[1:] = ([1.132, 1.17, 1.5])
m = param
fourier_factor = (4 * np.pi) / (2 * m + 1)
elif mother == 'DOG': # -------------------------------------Paul
empir = ([1., -1, -1, -1])
if param is None:
param = 2.
empir[1:] = ([3.541, 1.43, 1.4])
elif param == 6: # --------------------------------------DOG
empir[1:] = ([1.966, 1.37, 0.97])
m = param
fourier_factor = 2 * np.pi * np.sqrt(2. / (2 * m + 1))
else:
print('Mother must be one of MORLET, PAUL, DOG')
period = scale * fourier_factor
dofmin = empir[0] # Degrees of freedom with no smoothing
Cdelta = empir[1] # reconstruction factor
gamma_fac = empir[2] # time-decorrelation factor
dj0 = empir[3] # scale-decorrelation factor
freq = dt / period # normalized frequency
if gws is not None: # use global-wavelet as background spectrum
fft_theor = gws
else:
fft_theor = (1 - lag1 ** 2) / (1 - 2 * lag1 *
np.cos(freq * 2 * np.pi) + lag1 ** 2) # [Eqn(16)]
fft_theor = variance * fft_theor # include time-series variance
signif = fft_theor
if dof is None:
dof = dofmin
if sigtest == 0: # no smoothing, DOF=dofmin [Sec.4]
dof = dofmin
chisquare = chisquare_inv(siglvl, dof) / dof
signif = fft_theor * chisquare # [Eqn(18)]
elif sigtest == 1: # time-averaged significance
if len(np.atleast_1d(dof)) == 1:
dof = np.zeros(J1) + dof
dof[dof < 1] = 1
dof = dofmin * np.sqrt(1 + (dof * dt / gamma_fac / scale) ** 2) # [Eqn(23)]
dof[dof < dofmin] = dofmin # minimum DOF is dofmin
for a1 in range(0, J1 + 1):
chisquare = chisquare_inv(siglvl, dof[a1]) / dof[a1]
signif[a1] = fft_theor[a1] * chisquare
elif sigtest == 2: # time-averaged significance
if len(dof) != 2:
print('ERROR: DOF must be set to [S1,S2], the range of scale-averages')
if Cdelta == -1:
print('ERROR: Cdelta & dj0 not defined for ' +
mother + ' with param = ' + str(param))
s1 = dof[0]
s2 = dof[1]
avg = np.logical_and(scale >= 2, scale < 8) # scales between S1 & S2
navg = np.sum(np.array(np.logical_and(scale >= 2, scale < 8), dtype=int))
if navg == 0:
print('ERROR: No valid scales between ' + str(s1) + ' and ' + str(s2))
Savg = 1. / np.sum(1. / scale[avg]) # [Eqn(25)]
Smid = np.exp((np.log(s1) + np.log(s2)) / 2.) # power-of-two midpoint
dof = (dofmin * navg * Savg / Smid) * \
np.sqrt(1 + (navg * dj / dj0) ** 2) # [Eqn(28)]
fft_theor = Savg * np.sum(fft_theor[avg] / scale[avg]) # [Eqn(27)]
chisquare = chisquare_inv(siglvl, dof) / dof
signif = (dj * dt / Cdelta / Savg) * fft_theor * chisquare # [Eqn(26)]
else:
print('ERROR: sigtest must be either 0, 1, or 2')
return signif
#-------------------------------------------------------------------------------------------------------------------
# CHISQUARE_INV Inverse of chi-square cumulative distribution function (cdf).
#
# X = chisquare_inv(P,V) returns the inverse of chi-square cdf with V
# degrees of freedom at fraction P.
# This means that P*100 percent of the distribution lies between 0 and X.
#
# To check, the answer should satisfy: P==gammainc(X/2,V/2)
# Uses FMIN and CHISQUARE_SOLVE
def chisquare_inv(P, V):
if (1 - P) < 1E-4:
print('P must be < 0.9999')
if P == 0.95 and V == 2: # this is a no-brainer
X = 5.9915
return X
MINN = 0.01 # hopefully this is small enough
MAXX = 1 # actually starts at 10 (see while loop below)
X = 1
TOLERANCE = 1E-4 # this should be accurate enough
while (X + TOLERANCE) >= MAXX: # should only need to loop thru once
MAXX = MAXX * 10.
# this calculates value for X, NORMALIZED by V
X = fminbound(chisquare_solve, MINN, MAXX, args=(P, V), xtol=TOLERANCE)
MINN = MAXX
X = X * V # put back in the goofy V factor
return X # end of code
#-------------------------------------------------------------------------------------------------------------------
# CHISQUARE_SOLVE Internal function used by CHISQUARE_INV
#
# PDIFF=chisquare_solve(XGUESS,P,V) Given XGUESS, a percentile P,
# and degrees-of-freedom V, return the difference between
# calculated percentile and P.
# Uses GAMMAINC
#
# Written January 1998 by C. Torrence
# extra factor of V is necessary because X is Normalized
def chisquare_solve(XGUESS, P, V):
PGUESS = gammainc(V/2, V*XGUESS/2) # incomplete Gamma function
PDIFF = np.abs(PGUESS - P) # error in calculated P
TOL = 1E-4
if PGUESS >= 1-TOL: # if P is very close to 1 (i.e. a bad guess)
PDIFF = XGUESS # then just assign some big number like XGUESS
return PDIFF