### Wavelets

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 might see recorded by a seismograph or heart monitor. Generally, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets can be combined, using a "reverse, shift, multiply and integrate" technique called convolution, with portions of a known signal to extract information from the unknown signal.

For example, a wavelet could be created to have a frequency of Middle C and a short duration of roughly a 32nd note. If this wavelet was to be convolved with a signal created from the recording of a song, then the resulting signal would be useful for determining when the Middle C note was being played in the song. Mathematically, the wavelet will resonate if the unknown signal contains information of similar frequency – just as a tuning fork physically resonates with sound waves of its specific tuning frequency. This concept of resonance 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 certainly 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.

## Contents

## Name

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

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. Almost all practically useful discrete wavelet transforms use discrete-time filterbanks. These filter banks are called the wavelet 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.

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

### Continuous wavelet transforms (continuous shift and scale parameters)

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

*L*

^{2}(

**R**) ). For instance the signal may be represented on every frequency band of the form [

*f*, 2

*f*] for all positive frequencies

*f*> 0. Then, the original signal can be reconstructed by a suitable integration over all the resulting frequency components.

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

- $\backslash psi(t)=2\backslash ,\backslash operatorname\{sinc\}(2t)-\backslash ,\backslash operatorname\{sinc\}(t)=\backslash frac\{\backslash sin(2\backslash pi\; t)-\backslash sin(\backslash pi\; t)\}\{\backslash 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*)

- $\backslash psi\_\{a,b\}\; (t)\; =\; \backslash frac1\{\backslash sqrt\; a\; \}\backslash psi\; \backslash left(\; \backslash frac\{t\; -\; b\}\{a\}\; \backslash 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)=\backslash int\_\backslash R\; WT\_\backslash psi\backslash \{x\backslash \}(a,b)\backslash cdot\backslash psi\_\{a,b\}(t)\backslash ,db$

with *wavelet coefficients*

- $WT\_\backslash psi\backslash \{x\backslash \}(a,b)=\backslash langle\; x,\backslash psi\_\{a,b\}\backslash rangle=\backslash int\_\backslash R\; x(t)\{\backslash psi\_\{a,b\}(t)\}\backslash ,dt.$

See a list of some Continuous wavelets.

For the analysis of the signal *x*, one can assemble the wavelet coefficients into a scaleogram of the signal.

### Discrete wavelet transforms (discrete shift and scale parameters)

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}*,

*na*) with

^{m}b*m*,

*n*in

**Z**. The corresponding

*baby wavelets*are now given as

- $\backslash psi\_\{m,n\}(t)=a^\{-m/2\}\backslash psi(a^\{-m\}t-nb).\; \backslash ,$

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

- $x(t)=\backslash sum\_\{m\backslash in\backslash Z\}\backslash sum\_\{n\backslash in\backslash Z\}\backslash langle\; x,\backslash ,\backslash psi\_\{m,n\}\backslash rangle\backslash cdot\backslash psi\_\{m,n\}(t)$

is that the functions $\backslash \{\backslash psi\_\{m,n\}:m,n\backslash in\backslash Z\backslash \}$ form a tight frame of *L*^{2}(**R**).

### Multiresolution discrete wavelet transforms

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. To avoid this numerical complexity, one needs one auxiliary function, the *father wavelet* φ in *L*^{2}(**R**). Further, one has to restrict *a* to be 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.

From the mother and father wavelets one constructs the subspaces

- $V\_m=\backslash operatorname\{span\}(\backslash phi\_\{m,n\}:n\backslash in\backslash Z),\backslash text\{\; where\; \}\backslash phi\_\{m,n\}(t)=2^\{-m/2\}\backslash phi(2^\{-m\}t-n)$
- $W\_m=\backslash operatorname\{span\}(\backslash psi\_\{m,n\}:n\backslash in\backslash Z),\backslash text\{\; where\; \}\backslash psi\_\{m,n\}(t)=2^\{-m/2\}\backslash psi(2^\{-m\}t-n).$

From these one requires that the sequence

- $\backslash \{0\backslash \}\backslash subset\backslash dots\backslash subset\; V\_\{-1\}\backslash subset\; V\_0\backslash subset\; V\_\{+1\}\backslash subset\backslash dots\backslash subset\; L^2(\backslash mathbf\{R\})$

forms a multiresolution analysis of *a ^{m}* and that the subspaces $\backslash dots,W\_1,W\_0,W\_\{-1\},\backslash dots\backslash dots$ are the orthogonal "differences" of the above sequence, that is,

*W*is the orthogonal complement of

_{m}*V*inside the subspace

_{m}*V*

_{m−1}. In analogy to the sampling theorem one may conclude that the space

*V*with sampling distance 2

_{m}^{m}more or less covers the frequency baseband from 0 to 2

^{−m-1}. As orthogonal complement,

*W*roughly covers the band [2

_{m}^{−m-1}, 2

^{−m}].

From those inclusions and orthogonality relations follows the existence of sequences $h=\backslash \{h\_n\backslash \}\_\{n\backslash in\backslash Z\}$ and $g=\backslash \{g\_n\backslash \}\_\{n\backslash in\backslash Z\}$ that satisfy the identities

- $h\_n=\backslash langle\backslash phi\_\{0,0\},\backslash ,\backslash phi\_\{-1,n\}\backslash rangle$ and $\backslash phi(t)=\backslash sqrt2\; \backslash sum\_\{n\backslash in\backslash Z\}\; h\_n\backslash phi(2t-n),$
- $g\_n=\backslash langle\backslash psi\_\{0,0\},\backslash ,\backslash phi\_\{-1,n\}\backslash rangle$ and $\backslash psi(t)=\backslash sqrt2\; \backslash sum\_\{n\backslash in\backslash Z\}\; g\_n\backslash 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. Note that not every discrete wavelet orthonormal basis can be associated to a multiresolution analysis; for example, the Journe wavelet set wavelet admits no multiresolution analysis.^{[2]}

## Mother wavelet

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 $L^1(\backslash R)\backslash cap\; L^2(\backslash R).$ This is the space of measurable functions that are absolutely and square integrable:

- $\backslash int\_\{-\backslash infty\}^\{\backslash infty\}\; |\backslash psi\; (t)|\backslash ,\; dt\; <\backslash infty$ and $\backslash int\_\{-\backslash infty\}^\{\backslash infty\}\; |\backslash psi\; (t)|^2\; \backslash ,\; dt\; <\backslash infty.$

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

- $\backslash int\_\{-\backslash infty\}^\{\backslash infty\}\; \backslash psi\; (t)\backslash ,\; dt\; =\; 0$ is the condition for zero mean, and
- $\backslash int\_\{-\backslash infty\}^\{\backslash infty\}\; |\backslash psi\; (t)|^2\backslash ,\; 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 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*

- $\backslash int\_\{-\backslash infty\}^\{\backslash infty\}\; t^m\backslash ,\backslash psi\; (t)\backslash ,\; 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):

- $\backslash psi\; \_\{a,b\}\; (t)\; =\; \{1\; \backslash over\; \{\backslash sqrt\; a\; \}\}\backslash psi\; \backslash left(\; \backslash 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：

(1) $\backslash frac\{1\}\{\backslash sqrt\{a\}\}\; \backslash int\_\{-\backslash infty\}^\{\backslash infty\}\; \backslash varphi\_\{a1,b1\}(t)\backslash varphi(\backslash frac\{t-b\}\{a\})\; \backslash ,\; dt$ when a1 = a and b1 = b,

(2) $\backslash Psi\; (t)$ has a finite time interval

## Comparisons with Fourier transform (continuous-time)

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 $\backslash psi\; (t)\; =\; e^\{-2\; \backslash 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 more 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. Wavelets often give a better signal representation using Multiresolution analysis, with balanced resolution at any time and frequency.

The discrete wavelet transform is also 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).^{[3]} 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.^{[4]})

## Definition of a wavelet

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

### Scaling filter

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.

### Scaling function

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 it 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 [1] 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

### Wavelet function

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.

## Applications of Wavelet Transform

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

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, ab initio calculations, astrophysics, density-matrix localisation, seismology, optics, turbulence and quantum mechanics. This change has also occurred in image processing, EEG, EMG,^{[5]} ECG analyses, brain rhythms, DNA analysis, protein analysis, climatology, human sexual response analysis,^{[6]} general signal processing, speech recognition, acoustics, vibration signals,^{[7]} computer graphics and multifractal analysis. In computer vision and image processing, the notion of scale space representation and Gaussian derivative operators is regarded as a canonical multi-scale representation.

One use of wavelet approximation is in data compression. 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 Frame 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).^{[8]}

## History

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. Notable contributions to wavelet theory can be attributed to Zweig’s discovery of the continuous wavelet transform in 1975 (originally called the cochlear transform and discovered while studying the reaction of the ear to sound),^{[9]} 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), Daubechies' orthogonal wavelets with compact support (1988), Mallat's multiresolution framework (1989), Akansu's Binomial QMF (1990), Nathalie Delprat's time-frequency interpretation of the CWT (1991), Newland's harmonic wavelet transform (1993) and many others since.

### Timeline

- First wavelet (Haar wavelet) by Alfréd Haar (1909)
- Since the 1970s: George Zweig, Jean Morlet, Alex Grossmann
- Since the 1980s: Yves Meyer, Stéphane Mallat, Ingrid Daubechies, Ronald Coifman, Ali Akansu, Victor Wickerhauser,

## Wavelet transforms

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)

### Generalized transforms

There are a number of generalized transforms of which the wavelet transform is a special case. For example, Joseph Template:Proper name 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.^{[10]} 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^{[11]} and strain^{[12]}/metrology^{[13]} applications for intermediate transforms with high frequency resolution (like brushlets^{[14]} and ridgelets^{[15]}) 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.^{[16]}

## List of wavelets

### Discrete wavelets

- Beylkin (18)
- 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
^{[17]}

### Continuous wavelets

#### Real-valued

- Beta wavelet
- Hermitian wavelet
- Hermitian hat wavelet
- Meyer wavelet
- Mexican hat wavelet
- Shannon wavelet

#### Complex-valued

## See also

- Chirplet transform
- Curvelet
- Digital cinema
- Filter banks
- Fractal compression
- Fractional Fourier transform
- JPEG 2000
- Multiresolution analysis
- Noiselet
- Scale space
- Shearlet
- Short-time Fourier transform
- Ultra wideband radio- transmits wavelets
- Wave packet
- Gabor wavelet#Wavelet space
^{[18]} - Dimension reduction
- Fourier-related transforms
- Spectrogram

## Notes

## References

- Paul S. Addison,
*The Illustrated Wavelet Transform Handbook*, Institute of Physics, 2002, ISBN 0-7503-0692-0 - Ali Akansu and Richard Haddad,
*Multiresolution Signal Decomposition: Transforms, Subbands, Wavelets*, Academic Press, 1992, ISBN 0-12-047140-X - 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) - Ingrid Daubechies,
*Ten Lectures on Wavelets*, Society for Industrial and Applied Mathematics, 1992, ISBN 0-89871-274-2 - 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 - Haar A.,
*Zur Theorie der orthogonalen Funktionensysteme*, Mathematische Annalen,**69**, pp 331–371, 1910. - 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
- Gerald Kaiser,
*A Friendly Guide to Wavelets*, Birkhauser, 1994, ISBN 0-8176-3711-7 - 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 - P. P. Vaidyanathan,
*Multirate Systems and Filter Banks*, Prentice Hall, 1993, ISBN 0-13-605718-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

## External links

Look up in , the free dictionary.wavelet |

Commons has media related to .Wavelet |

- Template:Springer
- OpenSource Wavelet C# Code
- Wavelet Analysis in Mathematica (A very comprehensive set of wavelet analysis tools)
- 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)
- Wavelet Digest
- NASA Signal Processor featuring Wavelet methods Description of NASA Signal & Image Processing Software and Link to Download
- Course on Wavelets given at UC Santa Barbara, 2004
- The Wavelet Tutorial by Polikar (Easy to understand when you have some background with fourier transforms!)
- OpenSource Wavelet C++ Code
- Wavelets for Kids (PDF file) (Introductory (for very smart kids!))
- Link collection about wavelets
- Gerald Kaiser's acoustic and electromagnetic wavelets
- A really friendly guide to wavelets
- Wavelet-based image annotation and retrieval
- Very basic explanation of Wavelets and how FFT relates to it
- needs to be rectified.
- 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.
- Wavelet packet transform.
- Wavelet Library GNU/GPL library for n-dimensional discrete wavelet/framelet transforms.
- 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.
- HD-PLC Alliance
- Signal Denoising using Wavelets
- A Concise Introduction to Wavelets by René Puchinger.
- Java Library for Wavelets