A **wavelet** is a wave-like oscillation with an amplitude that begins at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" like one recorded by a seismograph or heart monitor. Generally, wavelets are intentionally crafted to have specific properties that make them useful for signal processing.

- Name
- Wavelet theory
- Continuous wavelet transforms (continuous shift and scale parameters)
- Discrete wavelet transforms (discrete shift and scale parameters, continuous in time)
- Multiresolution based discrete wavelet transforms (continuous in time)
- Mother wavelet
- Comparisons with Fourier transform (continuous-time)
- Definition of a wavelet
- Scaling filter
- Scaling function
- Wavelet function
- History
- Timeline
- Wavelet transforms
- Generalized transforms
- Applications of wavelet transform
- As a representation of a signal
- Wavelet denoising
- Wavelet Neural Network (WNN)
- Introduction
- Structure and parametrization
- Analysis
- Applications of WNN
- List of wavelets
- Discrete wavelets
- Continuous wavelets
- See also
- References
- [39]Citations
- Sources
- External links

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 was being played in the song. Mathematically, the wavelet will correlate with the signal if the unknown signal contains information of similar frequency. This concept of correlation is at the core of many practical applications of wavelet theory.

As a mathematical tool, wavelets can be used to extract information from many different kinds of data, including – but not limited to – audio signals and images. Sets of wavelets are generally needed to analyze data fully. A set of "complementary" wavelets will decompose data without gaps or overlap 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.

The word *wavelet* has been used for decades in digital signal processing and exploration geophysics.^{ [1] } The equivalent French word *ondelette* meaning "small wave" was used by Morlet and Grossmann in the early 1980s.

Wavelet theory is applicable to several subjects. All wavelet transforms may be considered forms of time-frequency representation for continuous-time (analog) signals and so are related to harmonic analysis. Discrete wavelet transform (continuous in time) of a discrete-time (sampled) signal by using discrete-time filterbanks of dyadic (octave band) configuration is a wavelet approximation to that signal. The coefficients of such a filter bank are called the shift and scaling coefficients in wavelets nomenclature. These filterbanks may contain either finite impulse response (FIR) or infinite impulse response (IIR) filters. The wavelets forming a continuous wavelet transform (CWT) are subject to the uncertainty principle of Fourier analysis respective sampling theory: Given a signal with some event in it, one cannot assign simultaneously an exact time and frequency response scale to that event. The product of the uncertainties of time and frequency response scale has a lower bound. Thus, in the scaleogram of a continuous wavelet transform of this signal, such an event marks an entire region in the time-scale plane, instead of just one point. Also, discrete wavelet bases may be considered in the context of other forms of the uncertainty principle.^{ [2] }^{ [3] }^{ [4] }^{ [5] }

Wavelet transforms are broadly divided into three classes: continuous, discrete and multiresolution-based.

In continuous wavelet transforms, a given signal of finite energy is projected on a continuous family of frequency bands (or similar subspaces of the *L ^{p}* function space

The frequency bands or subspaces (sub-bands) are scaled versions of a subspace at scale 1. This subspace in turn is in most situations generated by the shifts of one generating function ψ in *L*^{2}(**R**), the *mother wavelet*. For the example of the scale one frequency band [1, 2] this function is

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*)

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

with *wavelet coefficients*

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.

It is computationally impossible to analyze a signal using all wavelet coefficients, so one may wonder if it is sufficient to pick a discrete subset of the upper halfplane to be able to reconstruct a signal from the corresponding wavelet coefficients. One such system is the affine system for some real parameters *a* > 1, *b* > 0. The corresponding discrete subset of the halfplane consists of all the points (*a ^{m}*,

A sufficient condition for the reconstruction of any signal *x* of finite energy by the formula

is that the functions form an orthonormal basis of *L*^{2}(**R**).

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.^{ [6] }

From the mother and father wavelets one constructs the subspaces

The father wavelet keeps the time domain properties, while the mother wavelets keeps the frequency domain properties.

From these it is required that the sequence

forms a multiresolution analysis of *L ^{2}* and that the subspaces are the orthogonal "differences" of the above sequence, that is,

In analogy to the sampling theorem one may conclude that the space *V _{m}* with sampling distance 2

From those inclusions and orthogonality relations, especially , follows the existence of sequences and that satisfy the identities

- so that and
- so that

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

For any signal or function this gives a representation in basis functions of the corresponding subspaces as

where the coefficients are

- and
- .

For practical applications, and for efficiency reasons, one prefers continuously differentiable functions with compact support as mother (prototype) wavelet (functions). However, to satisfy analytical requirements (in the continuous WT) and in general for theoretical reasons, one chooses the wavelet functions from a subspace of the space This is the space of Lebesgue measurable functions that are both absolutely integrable and square integrable in the sense that

- and

Being in this space ensures that one can formulate the conditions of zero mean and square norm one:

- is the condition for zero mean, and
- 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* < *M*

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):

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 continous Fourier transform, there is no basis in the continuous wavelet transform. Time-frequency interpretation uses a subtly different formulation (after Delprat).

Restriction：

(1) when a1 = a and b1 = b,

(2) has a finite time interval

The wavelet transform is often compared with the Fourier transform, in which signals are represented as a sum of sinusoids. In fact, the Fourier transform can be viewed as a special case of the continuous wavelet transform with the choice of the mother wavelet . 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

where can often be written as , where 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

From this, the square of the temporal support of the window offset by time u is given by

and the square of the spectral support of the window acting on a frequency

Multiplication with a rectangular window in the time domain corresponds to convolution with a function in the frequency domain, resulting in spurious ringing artifacts for short/localized temporal windows. With the continuous-time Fourier Transform, and this convolution is with a delta function in Fourier space, resulting in the true Fourier transform of the signal . 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.^{ [7] }

The discrete wavelet transform is less computationally complex, taking O(*N*) time as compared to O(*N* log *N*) for the fast Fourier transform. 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 (Fast Fourier Transform) which uses the same basis functions as DFT (Discrete Fourier Transform).^{ [8] } It is also important to note that 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.^{ [9] })

There are a number of ways of defining a wavelet (or a wavelet family).

An orthogonal wavelet is entirely defined by the scaling filter – a low-pass finite impulse response (FIR) filter of length 2*N* and sum 1. In biorthogonal wavelets, separate decomposition and reconstruction filters are defined.

For analysis with orthogonal wavelets the high pass filter is calculated as the quadrature mirror filter of the low pass, and reconstruction filters are the time reverse of the decomposition filters.

Daubechies and Symlet wavelets can be defined by the scaling filter.

Wavelets are defined by the wavelet function ψ(*t*) (i.e. the mother wavelet) and scaling function φ(*t*) (also called father wavelet) in the time domain.

The wavelet function is in effect a band-pass filter and scaling that for each level halves its bandwidth. This creates the problem that in order to cover the entire spectrum, an infinite number of levels would be required. The scaling function filters the lowest level of the transform and ensures all the spectrum is covered. See^{ [10] } for a detailed explanation.

For a wavelet with compact support, φ(*t*) can be considered finite in length and is equivalent to the scaling filter *g*.

Meyer wavelets can be defined by scaling functions

The wavelet only has a time domain representation as the wavelet function ψ(*t*).

For instance, Mexican hat wavelets can be defined by a wavelet function. See a list of a few Continuous wavelets.

The development of wavelets can be linked to several separate trains of thought, starting with Haar's work in the early 20th century. Later work by Dennis Gabor yielded Gabor atoms (1946), which are constructed similarly to wavelets, and applied to similar purposes.

Wavelet compression, a form of transform coding that uses wavelet transforms in data compression, began after the development of the discrete cosine transform (DCT),^{ [11] } a block-based data compression algorithm first proposed by Nasir Ahmed in the early 1970s.^{ [12] }^{ [13] } The introduction of the DCT led to the development of wavelet coding, a variant of DCT coding that uses wavelets instead of DCT's block-based algorithm.^{ [11] }

Notable contributions to wavelet theory since then can be attributed to Zweig’s discovery of the continuous wavelet transform (CWT) in 1975 (originally called the cochlear transform and discovered while studying the reaction of the ear to sound),^{ [14] } Pierre Goupillaud, Grossmann and Morlet's formulation of what is now known as the CWT (1982), Jan-Olov Strömberg's early work on discrete wavelets (1983), the LeGall-Tabatabai (LGT) 5/3 wavelet developed by Didier Le Gall and Ali J. Tabatabai (1988),^{ [15] }^{ [16] }^{ [17] } Ingrid Daubechies' orthogonal wavelets with compact support (1988), Mallat's multiresolution framework (1989), Ali Akansu's Binomial QMF (1990), Nathalie Delprat's time-frequency interpretation of the CWT (1991), Newland's harmonic wavelet transform (1993), and set partitioning in hierarchical trees (SPIHT) developed by Amir Said with William A. Pearlman in 1996.^{ [18] }

The JPEG 2000 standard was developed from 1997 to 2000 by a Joint Photographic Experts Group (JPEG) committee chaired by Touradj Ebrahimi (later the JPEG president).^{ [19] } In contrast to the DCT algorithm used by the original JPEG format, JPEG 2000 instead uses discrete wavelet transform (DWT) algorithms. It uses the CDF 9/7 wavelet transform (developed by Ingrid Daubechies in 1992) for its lossy compression algorithm, and the LeGall-Tabatabai (LGT) 5/3 wavelet transform (developed by Didier Le Gall and Ali J. Tabatabai in 1988) for its lossless compression algorithm.^{ [20] } JPEG 2000 technology, which includes the Motion JPEG 2000 extension, was selected as the video coding standard for digital cinema in 2004.^{ [21] }

- First wavelet (Haar Wavelet) by Alfréd Haar (1909)
- Since the 1970s: George Zweig, Jean Morlet, Alex Grossmann
- Since the 1980s: Yves Meyer, Didier Le Gall, Ali J. Tabatabai, Stéphane Mallat, Ingrid Daubechies, Ronald Coifman, Ali Akansu, Victor Wickerhauser
- Since the 1990s: Nathalie Delprat, Newland, Amir Said, William A. Pearlman, Touradj Ebrahimi, JPEG 2000

A wavelet is a mathematical function used to divide a given function or continuous-time signal into different scale components. Usually one can assign a frequency range to each scale component. Each scale component can then be studied with a resolution that matches its scale. A wavelet transform is the representation of a function by wavelets. The wavelets are scaled and translated copies (known as "daughter wavelets") of a finite-length or fast-decaying oscillating waveform (known as the "mother wavelet"). Wavelet transforms have advantages over traditional Fourier transforms for representing functions that have discontinuities and sharp peaks, and for accurately deconstructing and reconstructing finite, non-periodic and/or non-stationary signals.

Wavelet transforms are classified into discrete wavelet transforms (DWTs) and continuous wavelet transforms (CWTs). Note that both DWT and CWT are continuous-time (analog) transforms. They can be used to represent continuous-time (analog) signals. CWTs operate over every possible scale and translation whereas DWTs use a specific subset of scale and translation values or representation grid.

There are a large number of wavelet transforms each suitable for different applications. For a full list see list of wavelet-related transforms but the common ones are listed below:

- Continuous wavelet transform (CWT)
- Discrete wavelet transform (DWT)
- Fast wavelet transform (FWT)
- Lifting scheme & Generalized Lifting Scheme
- Wavelet packet decomposition (WPD)
- Stationary wavelet transform (SWT)
- Fractional Fourier transform (FRFT)
- Fractional wavelet transform (FRWT)

There are a number of generalized transforms of which the wavelet transform is a special case. For example, Yosef Joseph Segman introduced scale into the Heisenberg group, giving rise to a continuous transform space that is a function of time, scale, and frequency. The CWT is a two-dimensional slice through the resulting 3d time-scale-frequency volume.

Another example of a generalized transform is the chirplet transform in which the CWT is also a two dimensional slice through the chirplet transform.

An important application area for generalized transforms involves systems in which high frequency resolution is crucial. For example, darkfield electron optical transforms intermediate between direct and reciprocal space have been widely used in the harmonic analysis of atom clustering, i.e. in the study of crystals and crystal defects.^{ [22] } Now that transmission electron microscopes are capable of providing digital images with picometer-scale information on atomic periodicity in nanostructure of all sorts, the range of pattern recognition ^{ [23] } and strain ^{ [24] }/metrology ^{ [25] } applications for intermediate transforms with high frequency resolution (like brushlets^{ [26] } and ridgelets^{ [27] }) is growing rapidly.

Fractional wavelet transform (FRWT) is a generalization of the classical wavelet transform in the fractional Fourier transform domains. This transform is capable of providing the time- and fractional-domain information simultaneously and representing signals in the time-fractional-frequency plane.^{ [28] }

Generally, an approximation to DWT is used for data compression if a signal is already sampled, and the CWT for signal analysis.^{ [29] } Thus, DWT approximation is commonly used in engineering and computer science, and the CWT in scientific research.

Like some other transforms, wavelet transforms can be used to transform data, then encode the transformed data, resulting in effective compression. For example, JPEG 2000 is an image compression standard that uses biorthogonal wavelets. This means that although the frame is overcomplete, it is a *tight frame* (see types of frames of a vector space), and the same frame functions (except for conjugation in the case of complex wavelets) are used for both analysis and synthesis, i.e., in both the forward and inverse transform. For details see wavelet compression.

A related use is for smoothing/denoising data based on wavelet coefficient thresholding, also called wavelet shrinkage. By adaptively thresholding the wavelet coefficients that correspond to undesired frequency components smoothing and/or denoising operations can be performed.

Wavelet transforms are also starting to be used for communication applications. Wavelet OFDM is the basic modulation scheme used in HD-PLC (a power line communications technology developed by Panasonic), and in one of the optional modes included in the IEEE 1901 standard. Wavelet OFDM can achieve deeper notches than traditional FFT OFDM, and wavelet OFDM does not require a guard interval (which usually represents significant overhead in FFT OFDM systems).^{ [30] }

Often, signals can be represented well as a sum of sinusoids. However, consider a non-continuous signal with an abrupt discontinuity; this signal can still be represented as a sum of sinusoids, but requires an infinite number, which is an observation known as Gibbs phenomenon. This, then, requires an infinite number of Fourier coefficients, which is not practical for many applications, such as compression. Wavelets are more useful for describing these signals with discontinuities because of their time-localized behavior (both Fourier and wavelet transforms are frequency-localized, but wavelets have an additional time-localization property). Because of this, many types of signals in practice may be non-sparse in the Fourier domain, but very sparse in the wavelet domain. This is particularly useful in signal reconstruction, especially in the recently popular field of compressed sensing. (Note that the short-time Fourier transform (STFT) is also localized in time and frequency, but there are often problems with the frequency-time resolution trade-off. Wavelets are better signal representations because of multiresolution analysis.)

This motivates why wavelet transforms are now being adopted for a vast number of applications, often replacing the conventional Fourier transform. Many areas of physics have seen this paradigm shift, including molecular dynamics, chaos theory,^{ [31] } ab initio calculations, astrophysics, gravitational wave transient data analysis,^{ [32] }^{ [33] } density-matrix localisation, seismology, optics, turbulence and quantum mechanics. This change has also occurred in image processing, EEG, EMG,^{ [34] } ECG analyses, brain rhythms, DNA analysis, protein analysis, climatology, human sexual response analysis,^{ [35] } general signal processing, speech recognition, acoustics, vibration signals,^{ [36] } computer graphics, multifractal analysis, and sparse coding. In computer vision and image processing, the notion of scale space representation and Gaussian derivative operators is regarded as a canonical multi-scale representation.

Suppose we measure a noisy signal . Assume s has a sparse representation in a certain wavelet bases, and

So .

Most elements in p are 0 or close to 0, and

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 , is the variance of "significant" coefficients, and is the variance of "insignificant" coefficients.

Then , is called the shrinkage factor, which depends on the prior variances and . The effect of the shrinkage factor is that small coefficients are set early to 0, and large coefficients are unaltered.

Small coefficients are mostly noises, and large coefficients contain actual signal.

At last, apply the inverse wavelet transform to obtain

WNN is a deep learning model. Its main feature is that WNN can reduce noise or redundant data to improve accuracy. In this case, WNN is widely used in different fields, including signal processing, engineering, computer vision, and finance.

Non-linear networks are very useful for system modeling and identification. For example, this approximate method can be used for black box recognition of nonlinear systems. Recently, neural networks have been established as a general approximation tool for fitting nonlinear models from input/output data. The work of G. Cybenko, Caroll, and Dickinson established universal approximation properties for such networks. On the other hand, the recently introduced wavelet decomposition has become a powerful new approximation tool. Facts have proved that the structure of this approximate structure is very similar to the structure implemented by the (1+$) layer neural network. In particular, recent developments have shown the existence of orthogonal wavelet bases, from which the convergence speed of wavelet-based network approximation can be obtained. Inspired by feedforward neural networks and wavelet decomposition, this paper proposes a new type of network called wavelet network. A back-propagation algorithm is proposed and experimental results are given.

A form of network structure in which additional (and redundant) parameters g are introduced to help deal with non-zero mean functions over finite fields. Please note that since the expansion and translation are adjustable, this form is equivalent to the form up to a constant g. In addition, in order to compensate for the direction selectivity of expansion, we combine rotation with each affine transformation to make the network more flexible.

where

- The additional parameter 9 is introduced in order to make it easicr to approximate functions with nonzero average, since the wavelet a(x) is zero mean;
- The dilation matrices D,’s are diagonal matrices built from dilation vectors, while R,’s are rotation matrices.

The structure of wavelet network is proposed and discussed. Wavelet networks usually have the form of a three-layer network. The lower layer represents the input layer, the middle layer represents the hidden layer, and the upper layer represents the output layer. In our implementation, a multi-dimensional wavelet network with a linear connection between the wavelet and the output is used. In addition, there is a direct connection from the input layer to the output layer, which will help the network perform well in linear applications.

In addition, the initialization phase, training phase, and stopping conditions are also discussed. The initialization of parameters is very important in wavelet networks, because it can greatly reduce the training time. The developed initialization method extracts useful information from wavelet analysis. The simplest method is the heuristic method. More complex methods (such as selection based on residuals, selection through orthogonalization and backward elimination) can be used for effective initialization. Our analysis results show that backward elimination is significantly better than other methods. The results of two simulation cases show that using the backward elimination method, the wavelet network provides a fitting very close to the real basis function. However, it is computationally more expensive than other methods. The backpropagation method is used for network training. Iteratively, update the weights of the network according to incremental learning rules, where learning rate and momentum are used. Train the weights of the network to minimize the average quadratic cost function. Training will continue until one of the stopping conditions is met.

The attributes that people have been emphasizing so far make wavelet networks particularly interesting in a wide range of applications in engineering, computer science, or biology . These ranges may range from classification to feature extraction or approximation of complex nonlinear functions. Some related examples will be further discussed in the next few lines to make this technique offer many possibilities.

Many probabilistic methods have been developed for computer vision, such as neural networks, PCA or eigenfaces. These methods tend to learn the variance of gray value pixels on a set of training data, and then use pixel-based knowledge to classify new images. This has nothing to do with the object itself.

The interest of wavelet networks lies in their ability to be directly related to the basic structure of the image [5]. The wavelet function of the model is the "natural" feature detector [7], and it has nothing to do with lighting changes. Figure 10 shows how the wavelet is performed, for example, the direction θ of the image is automatically adopted. In addition, they provide adjustable resolution to focus on a given area, making it particularly suitable for surveillance or tracking applications.

An example of face tracking is described by Krueger et al. [5] Among them, 16 (4×4) 4 Gabor wavelets (with corresponding directions 0, π/4, π/2 and 3π/4) are distributed in the region of interest (face). Then use the projection calculated by the neural network and obtain the solution of each filter response. In order to be able to track the face, an update is performed on each frame, which means (1) re-parameterize the model (to follow the movement of the target), and (2) optimize the weight of the previous frame to account for the changes in the image.

Robot motion is described by complex nonlinear dynamic equations, including time-related parameters and system uncertainties, as observed in the difference description:

In this framework, the approximation through nonlinear networks is very useful for learning control patterns [4], solving inverse kinematics problems [2] and synthesizing correct behavior. This goal has been studied and solved by neural networks based on radial basis function (RBF) before, that is, a function that only depends on the distance to the reference point (or centre) ci

However, for a given function, the RBF network may not be unique or particularly effective. A model developed by Katic et al. For example, [4] replaced this activation function with a wavelet-based network, and then it played the role of a robust controller. When the system is in contact with the environment, it helps to compensate for the uncertainty and generate more computational efficiency. result. In this case, gratifying results have been achieved for controlling manipulator robots.

The contribution of computer science in developing new and improved algorithms to approximate signals in different engineering fields has now become a reality. Because of these contributions, it is now possible to consider making the implementation of computational algorithms more and more complex, just like algorithms using neural networks and fuzzy logic, as shown in several papers.

- Beylkin (18)
- Biorthogonal nearly coiflet (BNC) wavelets
- Coiflet (6, 12, 18, 24, 30)
- Cohen-Daubechies-Feauveau wavelet (Sometimes referred to as CDF N/P or Daubechies biorthogonal wavelets)
- Daubechies wavelet (2, 4, 6, 8, 10, 12, 14, 16, 18, 20, etc.)
- Binomial-QMF (Also referred to as Daubechies wavelet)
- Haar wavelet
- Mathieu wavelet
- Legendre wavelet
- Villasenor wavelet
- Symlet
^{ [37] }

- Chirplet transform
- Curvelet
- Digital cinema
- Filter banks
- Fractal compression
- Fractional Fourier transform
- JPEG 2000
- Multiresolution analysis
- Noiselet
- Non-separable wavelet
- Scale space
- Scaled correlation
- Shearlet
- Short-time Fourier transform
- Ultra wideband radio- transmits wavelets
- Wave packet
- Gabor wavelet#Wavelet space
^{ [38] } - Dimension reduction
- Fourier-related transforms
- Spectrogram
- Huygens–Fresnel principle (physical wavelets)

In mathematics, **Fourier analysis** is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Joseph Fourier, who showed that representing a function as a sum of trigonometric functions greatly simplifies the study of heat transfer.

In mathematics, the **Haar wavelet** is a sequence of rescaled "square-shaped" functions which together form a wavelet family or basis. Wavelet analysis is similar to Fourier analysis in that it allows a target function over an interval to be represented in terms of an orthonormal basis. The Haar sequence is now recognised as the first known wavelet basis and extensively used as a teaching example.

The **Daubechies wavelets**, based on the work of Ingrid Daubechies, are a family of orthogonal wavelets defining a discrete wavelet transform and characterized by a maximal number of vanishing moments for some given support. With each wavelet type of this class, there is a scaling function which generates an orthogonal multiresolution analysis.

In mathematics, the **continuous wavelet transform (CWT)** is a formal tool that provides an overcomplete representation of a signal by letting the translation and scale parameter of the wavelets vary continuously.

In numerical analysis and functional analysis, a **discrete wavelet transform** (**DWT**) is any wavelet transform for which the wavelets are discretely sampled. As with other wavelet transforms, a key advantage it has over Fourier transforms is temporal resolution: it captures both frequency *and* location information.

**S****transform** as a time–frequency distribution was developed in 1994 for analyzing geophysics data. In this way, the *S* transform is a generalization of the short-time Fourier transform (STFT), extending the continuous wavelet transform and overcoming some of its disadvantages. For one, modulation sinusoids are fixed with respect to the time axis; this localizes the scalable Gaussian window dilations and translations in *S* transform. Moreover, the *S* transform doesn't have a cross-term problem and yields a better signal clarity than Gabor transform. However, the *S* transform has its own disadvantages: the clarity is worse than Wigner distribution function and Cohen's class distribution function.

The **Fast Wavelet Transform** is a mathematical algorithm designed to turn a waveform or signal in the time domain into a sequence of coefficients based on an orthogonal basis of small finite waves, or wavelets. The transform can be easily extended to multidimensional signals, such as images, where the time domain is replaced with the space domain. This algorithm was introduced in 1989 by Stéphane Mallat.

**Coiflets** are discrete wavelets designed by Ingrid Daubechies, at the request of Ronald Coifman, to have scaling functions with vanishing moments. The wavelet is near symmetric, their wavelet functions have vanishing moments and scaling functions , and has been used in many applications using Calderón–Zygmund operators.

A **multiresolution analysis** (**MRA**) or **multiscale approximation** (**MSA**) is the design method of most of the practically relevant discrete wavelet transforms (DWT) and the justification for the algorithm of the fast wavelet transform (FWT). It was introduced in this context in 1988/89 by Stephane Mallat and Yves Meyer and has predecessors in the microlocal analysis in the theory of differential equations and the pyramid methods of image processing as introduced in 1981/83 by Peter J. Burt, Edward H. Adelson and James L. Crowley.

In mathematics, a **wavelet series** is a representation of a square-integrable function by a certain orthonormal series generated by a wavelet. This article provides a formal, mathematical definition of an **orthonormal wavelet** and of the **integral wavelet transform**.

An **orthogonal wavelet** is a wavelet whose associated wavelet transform is orthogonal. That is, the inverse wavelet transform is the adjoint of the wavelet transform. If this condition is weakened one may end up with biorthogonal wavelets.

The **Gabor transform**, named after Dennis Gabor, is a special case of the short-time Fourier transform. It is used to determine the sinusoidal frequency and phase content of local sections of a signal as it changes over time. The function to be transformed is first multiplied by a Gaussian function, which can be regarded as a window function, and the resulting function is then transformed with a Fourier transform to derive the time-frequency analysis. The window function means that the signal near the time being analyzed will have higher weight. The Gabor transform of a signal *x*(*t*) is defined by this formula:

**Geophysical survey** is the systematic collection of geophysical data for spatial studies. Detection and analysis of the geophysical signals forms the core of Geophysical signal processing. The magnetic and gravitational fields emanating from the Earth's interior hold essential information concerning seismic activities and the internal structure. Hence, detection and analysis of the electric and Magnetic fields is very crucial. As the Electromagnetic and gravitational waves are multi-dimensional signals, all the 1-D transformation techniques can be extended for the analysis of these signals as well. Hence this article also discusses multi-dimensional signal processing techniques.

In the mathematics of signal processing, the **harmonic wavelet transform**, introduced by David Edward Newland in 1993, is a wavelet-based linear transformation of a given function into a time-frequency representation. It combines advantages of the short-time Fourier transform and the continuous wavelet transform. It can be expressed in terms of repeated Fourier transforms, and its discrete analogue can be computed efficiently using a fast Fourier transform algorithm.

In functional analysis, a **Shannon wavelet** may be either of real or complex type. Signal analysis by ideal bandpass filters defines a decomposition known as Shannon wavelets. The Haar and sinc systems are Fourier duals of each other.

The Mathieu equation is a linear second-order differential equation with periodic coefficients. The French mathematician, E. Léonard Mathieu, first introduced this family of differential equations, nowadays termed Mathieu equations, in his “Memoir on vibrations of an elliptic membrane” in 1868. "Mathieu functions are applicable to a wide variety of physical phenomena, e.g., diffraction, amplitude distortion, inverted pendulum, stability of a floating body, radio frequency quadrupole, and vibration in a medium with modulated density"

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*.

**Fractional wavelet transform** (FRWT) is a generalization of the classical wavelet transform (WT). This transform is proposed in order to rectify the limitations of the WT and the fractional Fourier transform (FRFT). The FRWT inherits the advantages of multiresolution analysis of the WT and has the capability of signal representations in the fractional domain which is similar to the FRFT.

In applied mathematical analysis, **shearlets** are a multiscale framework which allows efficient encoding of anisotropic features in multivariate problem classes. Originally, shearlets were introduced in 2006 for the analysis and sparse approximation of functions . They are a natural extension of wavelets, to accommodate the fact that multivariate functions are typically governed by anisotropic features such as edges in images, since wavelets, as isotropic objects, are not capable of capturing such phenomena.

In mathematics, in functional analysis, several different wavelets are known by the name **Poisson wavelet**. In one context, the term "Poisson wavelet" is used to denote a family of wavelets labeled by the set of positive integers, the members of which are associated with the Poisson probability distribution. These wavelets were first defined and studied by Karlene A. Kosanovich, Allan R. Moser and Michael J. Piovoso in 1995–96. In another context, the term refers to a certain wavelet which involves a form of the Poisson integral kernel. In still another context, the terminology is used to describe a family of complex wavelets indexed by positive integers which are connected with the derivatives of the Poisson integral kernel.

- ↑ Ricker, Norman (1953). "Wavelet Contraction, Wavelet Expansion, and the Control of Seismic Resolution".
*Geophysics*.**18**(4): 769–792. Bibcode:1953Geop...18..769R. doi:10.1190/1.1437927. - ↑ Meyer, Yves (1992), Wavelets and Operators, Cambridge, UK: Cambridge University Press, ISBN 0-521-42000-8
- ↑ Chui, Charles K. (1992), An Introduction to Wavelets, San Diego, CA: Academic Press, ISBN 0-12-174584-8
- ↑ Daubechies, Ingrid. (1992), Ten Lectures on Wavelets, SIAM, ISBN 978-0-89871-274-2
- ↑ Akansu, Ali N.; Haddad, Richard A. (1992), Multiresolution Signal Decomposition: Transforms, Subbands, and Wavelets, Boston, MA: Academic Press, ISBN 978-0-12-047141-6
- ↑ Larson, David R. (2007). "Wavelet Analysis and Applications (See: Unitary systems and wavelet sets)". Appl. Numer. Harmon. Anal. Birkhäuser: 143–171.Cite journal requires
`|journal=`

(help) - ↑ Mallat, Stephane. "A wavelet tour of signal processing. 1998." 250-252.
- ↑ The Scientist and Engineer's Guide to Digital Signal Processing By Steven W. Smith, Ph.D. chapter 8 equation 8-1: http://www.dspguide.com/ch8/4.htm
- ↑ http://homepages.dias.ie/~ajones/publications/28.pdf
- ↑ "A Really Friendly Guide To Wavelets – PolyValens".
*www.polyvalens.com*. - 1 2 Hoffman, Roy (2012).
*Data Compression in Digital Systems*. Springer Science & Business Media. p. 124. ISBN 9781461560319.Basically, wavelet coding is a variant on DCT-based transform coding that reduces or eliminates some of its limitations. (...) Another advantage is that rather than working with 8 × 8 blocks of pixels, as do JPEG and other block-based DCT techniques, wavelet coding can simultaneously compress the entire image.

- ↑ Ahmed, Nasir (January 1991). "How I Came Up With the Discrete Cosine Transform".
*Digital Signal Processing*.**1**(1): 4–5. doi:10.1016/1051-2004(91)90086-Z. - ↑ Stanković, Radomir S.; Astola, Jaakko T. (2012). "Reminiscences of the Early Work in DCT: Interview with K.R. Rao" (PDF).
*Reprints from the Early Days of Information Sciences*.**60**. Retrieved 13 October 2019. - ↑ http://scienceworld.wolfram.com/biography/Zweig.html Zweig, George Biography on Scienceworld.wolfram.com
- ↑ Sullivan, Gary (8–12 December 2003). "General characteristics and design considerations for temporal subband video coding".
*ITU-T*. Video Coding Experts Group . Retrieved 13 September 2019. - ↑ Bovik, Alan C. (2009).
*The Essential Guide to Video Processing*. Academic Press. p. 355. ISBN 9780080922508. - ↑ Gall, Didier Le; Tabatabai, Ali J. (1988). "Sub-band coding of digital images using symmetric short kernel filters and arithmetic coding techniques".
*ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing*: 761–764 vol.2. doi:10.1109/ICASSP.1988.196696. S2CID 109186495. - ↑ Said, Amir; Pearlman, William A. (June 1996). "A new fast and efficient image codec based on set partitioning in hierarchical trees".
*IEEE Transactions on Circuits and Systems for Video Technology*.**6**(3): 243–250. doi:10.1109/76.499834. ISSN 1051-8215. - ↑ Taubman, David; Marcellin, Michael (2012).
*JPEG2000 Image Compression Fundamentals, Standards and Practice: Image Compression Fundamentals, Standards and Practice*. Springer Science & Business Media. ISBN 9781461507994. - ↑ Unser, M.; Blu, T. (2003). "Mathematical properties of the JPEG2000 wavelet filters" (PDF).
*IEEE Transactions on Image Processing*.**12**(9): 1080–1090. Bibcode:2003ITIP...12.1080U. doi:10.1109/TIP.2003.812329. PMID 18237979. S2CID 2765169. Archived from the original (PDF) on 2019-10-13. - ↑ Swartz, Charles S. (2005).
*Understanding Digital Cinema: A Professional Handbook*. Taylor & Francis. p. 147. ISBN 9780240806174. - ↑ P. Hirsch, A. Howie, R. Nicholson, D. W. Pashley and M. J. Whelan (1965/1977)
*Electron microscopy of thin crystals*(Butterworths, London/Krieger, Malabar FLA) ISBN 0-88275-376-2 - ↑ P. Fraundorf, J. Wang, E. Mandell and M. Rose (2006) Digital darkfield tableaus,
*Microscopy and Microanalysis***12**:S2, 1010–1011 (cf. arXiv:cond-mat/0403017) - ↑ Hÿtch, M. J.; Snoeck, E.; Kilaas, R. (1998). "Quantitative measurement of displacement and strain fields from HRTEM micrographs".
*Ultramicroscopy*.**74**(3): 131–146. doi:10.1016/s0304-3991(98)00035-7. - ↑ Martin Rose (2006)
*Spacing measurements of lattice fringes in HRTEM image using digital darkfield decomposition*(M.S. Thesis in Physics, U. Missouri – St. Louis) - ↑ F. G. Meyer and R. R. Coifman (1997)
*Applied and Computational Harmonic Analysis***4**:147. - ↑ A. G. Flesia, H. Hel-Or, A. Averbuch, E. J. Candes, R. R. Coifman and D. L. Donoho (2001)
*Digital implementation of ridgelet packets*(Academic Press, New York). - ↑ Shi, J.; Zhang, N.-T.; Liu, X.-P. (2011). "A novel fractional wavelet transform and its applications".
*Sci. China Inf. Sci*.**55**(6): 1270–1279. doi: 10.1007/s11432-011-4320-x . - ↑ A.N. Akansu, W.A. Serdijn and I.W. Selesnick, Emerging applications of wavelets: A review, Physical Communication, Elsevier, vol. 3, issue 1, pp. 1-18, March 2010.
- ↑ Stefano Galli; O. Logvinov (July 2008). "Recent Developments in the Standardization of Power Line Communications within the IEEE".
*IEEE Communications Magazine*.**46**(7): 64–71. doi:10.1109/MCOM.2008.4557044. S2CID 2650873. An overview of P1901 PHY/MAC proposal. - ↑ Wotherspoon, T.; et., al. (2009). "Adaptation to the edge of chaos with random-wavelet feedback".
*J. Phys. Chem*.**113**(1): 19–22. Bibcode:2009JPCA..113...19W. doi:10.1021/jp804420g. PMID 19072712. - ↑ Abbott, Benjamin P.; et al. (LIGO Scientific Collaboration and Virgo Collaboration) (2016). "Observing gravitational-wave transient GW150914 with minimal assumptions".
*Phys. Rev. D*.**93**(12): 122004. arXiv: 1602.03843 . Bibcode:2016PhRvD..93l2004A. doi:10.1103/PhysRevD.93.122004. S2CID 119313566. - ↑ V Necula, S Klimenko and G Mitselmakher (2012). "Transient analysis with fast Wilson-Daubechies time-frequency transform".
*Journal of Physics: Conference Series*.**363**(1): 012032. Bibcode:2012JPhCS.363a2032N. doi: 10.1088/1742-6596/363/1/012032 . - ↑ J. Rafiee et al. Feature extraction of forearm EMG signals for prosthetics, Expert Systems with Applications 38 (2011) 4058–67.
- ↑ J. Rafiee et al. Female sexual responses using signal processing techniques, The Journal of Sexual Medicine 6 (2009) 3086–96. (pdf)
- ↑ Rafiee, J.; Tse, Peter W. (2009). "Use of autocorrelation in wavelet coefficients for fault diagnosis".
*Mechanical Systems and Signal Processing*.**23**(5): 1554–72. Bibcode:2009MSSP...23.1554R. doi:10.1016/j.ymssp.2009.02.008. - ↑
*Matlab Toolbox*– URL: http://matlab.izmiran.ru/help/toolbox/wavelet/ch06_a32.html - ↑ Erik Hjelmås (1999-01-21)
*Gabor Wavelets*URL: http://www.ansatt.hig.no/erikh/papers/scia99/node6.html - ↑ Prasad, Akhilesh; Maan, Jeetendrasingh; Verma, Sandeep Kumar (2021). "Wavelet transforms associated with the index Whittaker transform".
*Mathematical Methods in the Applied Sciences*.**n/a**(n/a). doi:10.1002/mma.7440. ISSN 1099-1476.

- Haar A.,
*Zur Theorie der orthogonalen Funktionensysteme*, Mathematische Annalen,**69**, pp 331–371, 1910. - Ingrid Daubechies,
*Ten Lectures on Wavelets*, Society for Industrial and Applied Mathematics, 1992, ISBN 0-89871-274-2 - Ali Akansu and Richard Haddad,
*Multiresolution Signal Decomposition: Transforms, Subbands, Wavelets*, Academic Press, 1992, ISBN 0-12-047140-X - P. P. Vaidyanathan,
*Multirate Systems and Filter Banks*, Prentice Hall, 1993, ISBN 0-13-605718-7 - Gerald Kaiser,
*A Friendly Guide to Wavelets*, Birkhauser, 1994, ISBN 0-8176-3711-7 - Mladen Victor Wickerhauser,
*Adapted Wavelet Analysis From Theory to Software*, A K Peters Ltd, 1994, ISBN 1-56881-041-5 - Martin Vetterli and Jelena Kovačević, "Wavelets and Subband Coding", Prentice Hall, 1995, ISBN 0-13-097080-8
- Barbara Burke Hubbard, "The World According to Wavelets: The Story of a Mathematical Technique in the Making", AK Peters Ltd, 1998, ISBN 1-56881-072-5, ISBN 978-1-56881-072-0
- Stéphane Mallat, "A wavelet tour of signal processing" 2nd Edition, Academic Press, 1999, ISBN 0-12-466606-X
- Donald B. Percival and Andrew T. Walden,
*Wavelet Methods for Time Series Analysis*, Cambridge University Press, 2000, ISBN 0-521-68508-7 - Ramazan Gençay, Faruk Selçuk and Brandon Whitcher,
*An Introduction to Wavelets and Other Filtering Methods in Finance and Economics*, Academic Press, 2001, ISBN 0-12-279670-5 - Paul S. Addison,
*The Illustrated Wavelet Transform Handbook*, Institute of Physics, 2002, ISBN 0-7503-0692-0 - B. Boashash, editor, "Time-Frequency Signal Analysis and Processing – A Comprehensive Reference", Elsevier Science, Oxford, 2003, ISBN 0-08-044335-4.
- Tony F. Chan and "Jackie (Jianhong) Shen",
*Image Processing and Analysis – Variational, PDE, Wavelet, and Stochastic Methods*, Society of Applied Mathematics, ISBN 0-89871-589-X (2005) - Press, WH; Teukolsky, SA; Vetterling, WT; Flannery, BP (2007), "Section 13.10. Wavelet Transforms",
*Numerical Recipes: The Art of Scientific Computing*(3rd ed.), New York: Cambridge University Press, ISBN 978-0-521-88068-8

This section's use of external links may not follow Wikipedia's policies or guidelines.(July 2016) |

Look up in Wiktionary, the free dictionary. wavelet |

Wikimedia Commons has media related to .Wavelet |

Wikiquote has quotations related to: Wavelet |

- Wavelet Digest
- Wavelets: Software – a list of useful wavelet transform frameworks, libraries, and other software
- "Wavelet analysis",
*Encyclopedia of Mathematics*, EMS Press, 2001 [1994] - 1st NJIT Symposium on Wavelets (April 30, 1990) (First Wavelets Conference in USA)
- Binomial-QMF Daubechies Wavelets
- Wavelets by Gilbert Strang, American Scientist 82 (1994) 250–255. (A very short and excellent introduction)
- Course on Wavelets given at UC Santa Barbara, 2004
- Wavelets for Kids (PDF file) (Introductory (for very smart kids!))
- WITS: Where Is The Starlet? A dictionary of tens of wavelets and wavelet-related terms ending in -let, from activelets to x-lets through bandlets, contourlets, curvelets, noiselets, wedgelets.
- The Fractional Spline Wavelet Transform describes a fractional wavelet transform based on fractional b-Splines.
- A Panorama on Multiscale Geometric Representations, Intertwining Spatial, Directional and Frequency Selectivity provides a tutorial on two-dimensional oriented wavelets and related geometric multiscale transforms.
- Signal Denoising using Wavelets
- Concise Introduction to Wavelets by René Puschinger

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.