Wavelet

A wavelet is a wave-like oscillation with an amplitude that begins at zero, increases or decreases, and then returns to zero one or more times.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 15 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

A wavelet is a wave-like oscillation with an amplitude that begins at zero, increases or decreases, and then returns to zero one or more times. Wavelets are termed a "brief oscillation". A taxonomy of wavelets has been established, based on the number and direction of its pulses.

Wavelets are imbued with specific properties that make them useful for signal processing. For example, a wavelet could be created to have a frequency of middle C and a short duration of roughly one tenth of a second.

If this wavelet were to be convolved with a signal created from the recording of a melody, then the resulting signal would be useful for determining when the middle C note appeared in the song. Mathematically, a wavelet correlates with a signal if a portion of the signal is similar. Correlation is at the core of many practical wavelet applications.

As a mathematical tool, wavelets can be used to extract information from many kinds of data, including audio signals and images. Sets of wavelets are needed to analyze data fully. "Complementary" wavelets decompose a signal without gaps or overlaps so that the decomposition process is mathematically reversible.

Thus, sets of complementary wavelets are useful in wavelet-based compression/decompression algorithms, where it is desirable to recover the original information with minimal loss.…

A wavelet is a wave-like oscillation with an amplitude that begins at zero, increases or decreases, and then returns to zero one or more times. Wavelets are termed a "brief oscillation". A taxonomy of wavelets has been established, based on the number and direction of its pulses.

Wavelets are imbued with specific properties that make them useful for signal processing. For example, a wavelet could be created to have a frequency of middle C and a short duration of roughly one tenth of a second.

If this wavelet were to be convolved with a signal created from the recording of a melody, then the resulting signal would be useful for determining when the middle C note appeared in the song. Mathematically, a wavelet correlates with a signal if a portion of the signal is similar. Correlation is at the core of many practical wavelet applications.

As a mathematical tool, wavelets can be used to extract information from many kinds of data, including audio signals and images. Sets of wavelets are needed to analyze data fully. "Complementary" wavelets decompose a signal without gaps or overlaps so that the decomposition process is mathematically reversible.

Thus, sets of complementary wavelets are useful in wavelet-based compression/decompression algorithms, where it is desirable to recover the original information with minimal loss. In formal terms, this representation is a wavelet series representation of a square-integrable function with respect to either a complete, orthonormal set of basis functions, or an overcomplete set or frame of a vector space, for the Hilbert space of square-integrable functions.

This is accomplished through coherent states. In classical physics, the diffraction phenomenon is described by the Huygens–Fresnel principle that treats each point in a propagating wavefront as a collection of individual spherical wavelets.

The characteristic bending pattern is most pronounced when a wave from a coherent source (such as a laser) encounters a slit/aperture that is comparable in size to its wavelength. This is due to the addition, or interference, of different points on the wavefront (or, equivalently, each wavelet) that travel by paths of different lengths to the registering surface.

Multiple, closely spaced openings (e.g., a diffraction grating), can result in a complex pattern of varying intensity.

Etymology

The word wavelet has been used for decades in digital signal processing and exploration geophysics. The equivalent French word ondelette meaning "small wave" was used by Jean Morlet and Alex Grossmann in the early 1980s. \psi(t)=2\,\operatorname{sinc}(2t)-\,\operatorname{sinc}(t)=\frac{\sin(2\pi t)-\sin(\pi t)}{\pi t} with the (normalized) sinc function.

That, Meyer's, and two other examples of mother wavelets are: The subspace of scale a or frequency band [1/a, 2/a] is generated by the functions (sometimes called child wavelets) \psi_{a,b} (t) = \frac1{\sqrt a }\psi \left( \frac{t - b}{a} \right), where a is positive and defines the scale and b is any real number and defines the shift. The pair (a, b) defines a point in the right halfplane R + × R. The projection of a function x onto the subspace of scale a then has the form x_a(t)=\int_\R WT_\psi\{x\}(a,b)\cdot\psi_{a,b}(t)\,db with wavelet coefficients WT_\psi\{x\}(a,b)=\langle x,\psi_{a,b}\rangle=\int_\R x(t){\psi_{a,b}(t)}\,dt.

For the analysis of the signal x, one can assemble the wavelet coefficients into a scaleogram of the signal. See a list of some Continuous wavelets. \psi_{m,n}(t) = \frac1{\sqrt{a^m}}\psi\left(\frac{t - nba^m}{a^m}\right).

A sufficient condition for the reconstruction of any signal x of finite energy by the formula x(t)=\sum_{m\in\Z}\sum_{n\in\Z}\langle x,\,\psi_{m,n}\rangle\cdot\psi_{m,n}(t) is that the functions \{\psi_{m,n}:m,n\in\Z\} form an orthonormal basis of L 2 (R).

Multiresolution based discrete wavelet transforms (continuous in time)

In any discretised wavelet transform, there are only a finite number of wavelet coefficients for each bounded rectangular region in the upper halfplane. Still, each coefficient requires the evaluation of an integral. In special situations this numerical complexity can be avoided if the scaled and shifted wavelets form a multiresolution analysis.

This means that there has to exist an auxiliary function, the father wavelet φ in L 2 (R), and that a is an integer. A typical choice is a = 2 and b = 1. The most famous pair of father and mother wavelets is the Daubechies 4-tap wavelet.

Note that not every orthonormal discrete wavelet basis can be associated to a multiresolution analysis; for example, the Journe wavelet admits no multiresolution analysis. From the mother and father wavelets one constructs the subspaces V_m=\operatorname{span}(\phi_{m,n}:n\in\Z),\text{ where }\phi_{m,n}(t)=2^{-m/2}\phi(2^{-m}t-n) W_m=\operatorname{span}(\psi_{m,n}:n\in\Z),\text{ where }\psi_{m,n}(t)=2^{-m/2}\psi(2^{-m}t-n). The father wavelet V_{i} keeps the time domain properties, while the mother wavelets W_{i} keeps the frequency domain properties.

From these it is required that the sequence \{0\}\subset\dots\subset V_{1}\subset V_{0}\subset V_{-1}\subset V_{-2}\subset\dots\subset L^2(\R) forms a multiresolution analysis of L 2 and that the subspaces \dots,W_1,W_0,W_{-1},\dots are the orthogonal "differences" of the above sequence, that is, W m is the orthogonal complement of V m inside the subspace V m−1 , V_m\oplus W_m=V_{m-1}. In analogy to the sampling theorem one may conclude that the space V m with sampling distance 2 m more or less covers the frequency baseband from 0 to 1/2 m-1 .

As orthogonal complement, W m roughly covers the band [1/2 m−1 , 1/2 m ]. From those inclusions and orthogonality relations, especially V_0\oplus W_0=V_{-1} , follows the existence of sequences h=\{h_n\}_{n\in\Z} and g=\{g_n\}_{n\in\Z} that satisfy the identities g_n=\langle\phi_{0,0},\,\phi_{-1,n}\rangle so that \phi(t)=\sqrt2 \sum_{n\in\Z} g_n\phi(2t-n), and h_n=\langle\psi_{0,0},\,\phi_{-1,n}\rangle so that \psi(t)=\sqrt2 \sum_{n\in\Z} h_n\phi(2t-n). The second identity of the first pair is a refinement equation for the father wavelet φ. Both pairs of identities form the basis for the algorithm of the fast wavelet transform.

From the multiresolution analysis derives the orthogonal decomposition of the space L 2 as L^2 = V_{j_0} \oplus W_{j_0} \oplus W_{j_0-1} \oplus W_{j_0-2} \oplus W_{j_0-3} \oplus \cdots For any signal or function S\in L^2 this gives a representation in basis functions of the corresponding subspaces as S = \sum_{k} c_{j_0,k}\phi_{j_0,k} + \sum_{j\le j_0}\sum_{k} d_{j,k}\psi_{j,k} where the coefficients are c_{j_0,k} = \langle S,\phi_{j_0,k}\rangle and d_{j,k} = \langle S,\psi_{j,k}\rangle.

Time-causal wavelets

For processing temporal signals in real time, it is essential that the wavelet filters do not access signal values from the future as well as that minimal temporal latencies can be obtained. Time-causal wavelets representations have been developed by Szu et al and Lindeberg, with the latter method also involving a memory-efficient time-recursive implementation. \int_{-\infty}^{\infty} |\psi (t)| \, dt and \int_{-\infty}^{\infty} |\psi (t)|^2 \, dt Being in this space ensures that one can formulate the conditions of zero mean and square norm one: \int_{-\infty}^{\infty} \psi (t) \, dt = 0 is the condition for zero mean, and \int_{-\infty}^{\infty} |\psi (t)|^2\, dt = 1 is the condition for square norm one.

For ψ to be a wavelet for the continuous wavelet transform (see there for exact statement), the mother wavelet must satisfy an admissibility criterion (loosely speaking, a kind of half-differentiability) in order to get a stably invertible transform. For the discrete wavelet transform, one needs at least the condition that the wavelet series is a representation of the identity in the space L 2 (R). Most constructions of discrete WT make use of the multiresolution analysis, which defines the wavelet by a scaling function.

This scaling function itself is a solution to a functional equation. In most situations it is useful to restrict ψ to be a continuous function with a higher number M of vanishing moments, i.e. for all integer m \int_{-\infty}^{\infty} t^m\,\psi (t)\, dt = 0.

The mother wavelet is scaled (or dilated) by a factor of a and translated (or shifted) by a factor of b to give (under Morlet's original formulation): \psi _{a,b} (t) = {1 \over \sqrt a}\psi \left( {t - b \over a} \right). For the continuous WT, the pair (a,b) varies over the full half-plane R + × R; for the discrete WT this pair varies over a discrete subset of it, which is also called affine group.

These functions are often incorrectly referred to as the basis functions of the (continuous) transform. In fact, as in the continuous Fourier transform, there is no basis in the continuous wavelet transform. Time-frequency interpretation uses a subtly different formulation (after Delprat).

Restriction: \frac{1}{\sqrt{a}} \int_{-\infty}^\infty \varphi_{a1,b1}(t)\varphi\left(\frac{t-b}{a}\right) \, dt when and , \Psi (t) has a finite time interval \psi (t) = e^{-2 \pi i t} . The main difference in general is that wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency.

The short-time Fourier transform (STFT) is similar to the wavelet transform, in that it is also time and frequency localized, but there are issues with the frequency/time resolution trade-off. In particular, assuming a rectangular window region, one may think of the STFT as a transform with a slightly different kernel \psi (t) = g(t-u) e^{-2 \pi i t} where g(t-u) can often be written as \operatorname{rect}\left(\frac{t-u}{\Delta_t}\right) , where \Delta_t and u respectively denote the length and temporal offset of the windowing function.

Using Parseval's theorem, one may define the wavelet's energy as E = \int_{-\infty}^{\infty} |\psi (t)|^2\, dt = \frac{1}{2\pi}\int_{-\infty}^{\infty} |\hat{\psi}(\omega)|^2 \, d\omega From this, the square of the temporal support of the window offset by time u is given by \sigma_u^2 = \frac{1}{E}\int |t-u|^2 |\psi(t)|^2 \, dt and the square of the spectral support of the window acting on a frequency \xi \hat{\sigma}_\xi^2 =\frac{1}{2\pi E} \int |\omega-\xi|^2|\hat{\psi}(\omega)|^2 \, d\omega Multiplication with a rectangular window in the time domain corresponds to convolution with a \operatorname{sinc}(\Delta_t\omega) function in the frequency domain, resulting in spurious ringing artifacts for short/localized temporal windows. With the continuous-time Fourier transform, \Delta_t \to \infty and this convolution is with a delta function in Fourier space, resulting in the true Fourier transform of the signal x(t) . The window function may be some other apodizing filter, such as a Gaussian.

The choice of windowing function will affect the approximation error relative to the true Fourier transform. A given resolution cell's time-bandwidth product may not be exceeded with the STFT. All STFT basis elements maintain a uniform spectral and temporal support for all temporal shifts or offsets, thereby attaining an equal resolution in time for lower and higher frequencies.

The resolution is purely determined by the sampling width. In contrast, the wavelet transform's multiresolutional properties enables large temporal supports for lower frequencies while maintaining short temporal widths for higher frequencies by the scaling properties of the wavelet transform. This property extends conventional time-frequency analysis into time-scale analysis.

The discrete wavelet transform is less computationally complex, taking O(N) time as compared to O(N log N) for the fast Fourier transform (FFT). This computational advantage is not inherent to the transform, but reflects the choice of a logarithmic division of frequency, in contrast to the equally spaced frequency divisions of the FFT which uses the same basis functions as the discrete Fourier transform (DFT).

This complexity only applies when the filter size has no relation to the signal size. A wavelet without compact support such as the Shannon wavelet would require O(N 2 ).

(For instance, a logarithmic Fourier Transform also exists with O(N) complexity, but the original signal must be sampled logarithmically in time, which is only useful for certain types of signals. ) Suppose we measure a noisy signal x = s + v , where s represents the signal and v represents the noise. Assume s has a sparse representation in a certain wavelet basis, and v \ \sim\ \mathcal{N}(0,\,\sigma^2I) Let the wavelet transform of x be y = W^T x = W^T s + W^T v = p + z , where p = W^T s is the wavelet transform of the signal component and z = W^T v is the wavelet transform of the noise component.

Most elements in p are 0 or close to 0, and z \ \sim\ \ \mathcal{N}(0,\,\sigma^2I) Since W is orthogonal, the estimation problem amounts to recovery of a signal in iid Gaussian noise. As p is sparse, one method is to apply a Gaussian mixture model for p . Assume a prior p \ \sim\ a\mathcal{N}(0,\,\sigma_1^2) +(1- a)\mathcal{N}(0,\,\sigma_2^2) , where \sigma_1^2 is the variance of "significant" coefficients and \sigma_2^2 is the variance of "insignificant" coefficients.

Then \tilde p = E(p/y) = \tau(y) y , \tau(y) is called the shrinkage factor, which depends on the prior variances \sigma_1^2 and \sigma_2^2 . By setting coefficients that fall below a shrinkage threshold to zero, once the inverse transform is applied, an expectedly small amount of signal is lost due to the sparsity assumption.

The larger coefficients are expected to primarily represent signal due to sparsity, and statistically very little of the signal, albeit the majority of the noise, is expected to be represented in such lower magnitude coefficients... therefore the zeroing-out operation is expected to remove most of the noise and not much signal. Typically, the above-threshold coefficients are not modified during this process.

Some algorithms for wavelet-based denoising may attenuate larger coefficients as well, based on a statistical estimate of the amount of noise expected to be removed by such an attenuation. At last, apply the inverse wavelet transform to obtain \tilde s = W \tilde p

Text derived from https://en.wikipedia.org/w/index.php?oldid=1375098950 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

17 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.