Cascade algorithm - Alchetron, The Free Social Encyclopedia

In the mathematical topic of wavelet theory, the cascade algorithm is a numerical method for calculating function values of the basic scaling and wavelet functions of a discrete wavelet transform using an iterative algorithm. It starts from values on a coarse sequence of sampling points and produces values for successively more densely spaced sequences of sampling points. Because it applies the same operation over and over to the output of the previous application, it is known as the cascade algorithm.

Successive approximation

The iterative algorithm generates successive approximations to ψ(t) or φ(t) from {h} and {g} filter coefficients. If the algorithm converges to a fixed point, then that fixed point is the basic scaling function or wavelet.

The iterations are defined by

φ ( k + 1 ) ( t ) = ∑ n = 0 N − 1 h [ n ] 2 φ ( k ) ( 2 t − n )

For the kth iteration, where an initial φ⁽⁰⁾(t) must be given.

The frequency domain estimates of the basic scaling function is given by

Φ ( k + 1 ) ( ω ) = 1 2 H ( ω 2 ) Φ ( k ) ( ω 2 )

and the limit can be viewed as an infinite product in the form

Φ ( ∞ ) ( ω ) = ∏ k = 1 ∞ 1 2 H ( ω 2 k ) Φ ( ∞ ) ( 0 ) .

If such a limit exists, the spectrum of the scaling function is

Φ ( ω ) = ∏ k = 1 ∞ 1 2 H ( ω 2 k ) Φ ( ∞ ) ( 0 )

The limit does not depends on the initial shape assume for φ⁽⁰⁾(t). This algorithm converges reliably to φ(t), even if it is discontinuous.

From this scaling function, the wavelet can be generated from

ψ ( t ) = ∑ n = − ∞ ∞ g [ n ] 2 φ ( k ) ( 2 t − n ) .

Successive approximation can also be derived in the frequency domain.

References

Cascade algorithm Wikipedia

(Text) CC BY-SA