Daubechies wavelet

From Wikipedia, the free encyclopedia
Daubechies 20 2-d wavelet (Wavelet Fn X Scaling Fn)

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 (called the father wavelet) which generates an orthogonal multiresolution analysis.


In general the Daubechies wavelets are chosen to have the highest number A of vanishing moments, (this does not imply the best smoothness) for given support width (number of coefficients) 2A.[1] There are two naming schemes in use, DN using the length or number of taps, and dbA referring to the number of vanishing moments. So D4 and db2 are the same wavelet transform.

Among the 2A−1 possible solutions of the algebraic equations for the moment and orthogonality conditions, the one is chosen whose scaling filter has extremal phase. The wavelet transform is also easy to put into practice using the fast wavelet transform. Daubechies wavelets are widely used in solving a broad range of problems, e.g. self-similarity properties of a signal or fractal problems, signal discontinuities, etc.

The Daubechies wavelets are not defined in terms of the resulting scaling and wavelet functions; in fact, they are not possible to write down in closed form. The graphs below are generated using the cascade algorithm, a numeric technique consisting of inverse-transforming [1 0 0 0 0 ... ] an appropriate number of times.

Scaling and wavelet functions
Amplitudes of the frequency spectra of the above functions

Note that the spectra shown here are not the frequency response of the high and low pass filters, but rather the amplitudes of the continuous Fourier transforms of the scaling (blue) and wavelet (red) functions.

Daubechies orthogonal wavelets D2–D20 resp. db1–db10 are commonly used. The index number refers to the number N of coefficients. Each wavelet has a number of zero moments or vanishing moments equal to half the number of coefficients. For example, D2 has one vanishing moment, D4 has two, etc. A vanishing moment limits the wavelets ability to represent polynomial behaviour or information in a signal. For example, D2, with one vanishing moment, easily encodes polynomials of one coefficient, or constant signal components. D4 encodes polynomials with two coefficients, i.e. constant and linear signal components; and D6 encodes 3-polynomials, i.e. constant, linear and quadratic signal components. This ability to encode signals is nonetheless subject to the phenomenon of scale leakage, and the lack of shift-invariance, which arise from the discrete shifting operation (below) during application of the transform. Sub-sequences which represent linear, quadratic (for example) signal components are treated differently by the transform depending on whether the points align with even- or odd-numbered locations in the sequence. The lack of the important property of shift-invariance, has led to the development of several different versions of a shift-invariant (discrete) wavelet transform.


Both the scaling sequence (low-pass filter) and the wavelet sequence (band-pass filter) (see orthogonal wavelet for details of this construction) will here be normalized to have sum equal 2 and sum of squares equal 2. In some applications, they are normalised to have sum , so that both sequences and all shifts of them by an even number of coefficients are orthonormal to each other.

Using the general representation for a scaling sequence of an orthogonal discrete wavelet transform with approximation order A,

with N = 2A, p having real coefficients, p(1) = 1 and deg(p) = A − 1, one can write the orthogonality condition as

or equally as

with the Laurent-polynomial

generating all symmetric sequences and Further, P(X) stands for the symmetric Laurent-polynomial


P takes nonnegative values on the segment [0,2].

Equation (*) has one minimal solution for each A, which can be obtained by division in the ring of truncated power series in X,

Obviously, this has positive values on (0,2).

The homogeneous equation for (*) is antisymmetric about X = 1 and has thus the general solution

with R some polynomial with real coefficients. That the sum

shall be nonnegative on the interval [0,2] translates into a set of linear restrictions on the coefficients of R. The values of P on the interval [0,2] are bounded by some quantity maximizing r results in a linear program with infinitely many inequality conditions.

To solve

for p one uses a technique called spectral factorization resp. Fejér-Riesz-algorithm. The polynomial P(X) splits into linear factors

Each linear factor represents a Laurent-polynomial

that can be factored into two linear factors. One can assign either one of the two linear factors to p(Z), thus one obtains 2N possible solutions. For extremal phase one chooses the one that has all complex roots of p(Z) inside or on the unit circle and is thus real.

For Daubechies wavelet transform, a pair of linear filters is used. Each filter of the pair should be a quadrature mirror filter. Solving the coefficient of the linear filter using the quadrature mirror filter property results in the following solution for the coefficient values for filter of order 4.

The scaling sequences of lowest approximation order[edit]

Below are the coefficients for the scaling functions for D2-20. The wavelet coefficients are derived by reversing the order of the scaling function coefficients and then reversing the sign of every second one, (i.e., D4 wavelet {−0.1830127, −0.3169873, 1.1830127, −0.6830127}). Mathematically, this looks like where k is the coefficient index, b is a coefficient of the wavelet sequence and a a coefficient of the scaling sequence. N is the wavelet index, i.e., 2 for D2.

Orthogonal Daubechies coefficients (normalized to have sum 2)
D2 (Haar) D4 D6 D8 D10 D12 D14 D16 D18 D20
1 0.6830127 0.47046721 0.32580343 0.22641898 0.15774243 0.11009943 0.07695562 0.05385035 0.03771716
1 1.1830127 1.14111692 1.01094572 0.85394354 0.69950381 0.56079128 0.44246725 0.34483430 0.26612218
0.3169873 0.650365 0.89220014 1.02432694 1.06226376 1.03114849 0.95548615 0.85534906 0.74557507
−0.1830127 −0.19093442 −0.03957503 0.19576696 0.44583132 0.66437248 0.82781653 0.92954571 0.97362811
−0.12083221 −0.26450717 −0.34265671 −0.31998660 −0.20351382 −0.02238574 0.18836955 0.39763774
0.0498175 0.0436163 −0.04560113 −0.18351806 −0.31683501 −0.40165863 −0.41475176 −0.35333620
0.0465036 0.10970265 0.13788809 0.1008467 6.68194092 × 10−4 −0.13695355 −0.27710988
−0.01498699 −0.00882680 0.03892321 0.11400345 0.18207636 0.21006834 0.18012745
−0.01779187 −0.04466375 −0.05378245 −0.02456390 0.043452675 0.13160299
4.71742793 × 10−3 7.83251152 × 10−4 −0.02343994 −0.06235021 −0.09564726 −0.10096657
6.75606236 × 10−3 0.01774979 0.01977216 3.54892813 × 10−4 −0.04165925
−1.52353381 × 10−3 6.07514995 × 10−4 0.01236884 0.03162417 0.04696981
−2.54790472 × 10−3 −6.88771926 × 10−3 −6.67962023 × 10−3 5.10043697 × 10−3
5.00226853 × 10−4 −5.54004549 × 10−4 −6.05496058 × 10−3 −0.01517900
9.55229711 × 10−4 2.61296728 × 10−3 1.97332536 × 10−3
−1.66137261 × 10−4 3.25814671 × 10−4 2.81768659 × 10−3
−3.56329759 × 10−4 −9.69947840 × 10−4
5.5645514 × 10−5 −1.64709006 × 10−4
1.32354367 × 10−4
−1.875841 × 10−5

Parts of the construction are also used to derive the biorthogonal Cohen–Daubechies–Feauveau wavelets (CDFs).


While software such as Mathematica supports Daubechies wavelets directly[2] a basic implementation is possible in MATLAB (in this case, Daubechies 4). This implementation uses periodization to handle the problem of finite length signals. Other, more sophisticated methods are available, but often it is not necessary to use these as it only affects the very ends of the transformed signal. The periodization is accomplished in the forward transform directly in MATLAB vector notation, and the inverse transform by using the circshift() function:

Transform, D4[edit]

It is assumed that S, a column vector with an even number of elements, has been pre-defined as the signal to be analyzed. Note that the D4 coefficients are [1 + 3, 3 + 3, 3 − 3, 1 − 3]/4.

N = length(S);
sqrt3 = sqrt(3);
s_odd = S(1:2:N-1);
s_even = S(2:2:N);

s = (sqrt3+1)*s_odd + (3+sqrt3)*s_even + (3-sqrt3)*[s_odd(2:N/2);s_odd(1)] + (1-sqrt3)*[s_even(2:N/2);s_even(1)];
d = (1-sqrt3)*[s_odd(N/2);s_odd(1:N/2-1)] + (sqrt3-3)*[s_even(N/2);s_even(1:N/2-1)] + (3+sqrt3)*s_odd + (-1-sqrt3)*s_even
s = s / (4*sqrt(2));
d = d / (4*sqrt(2));

Inverse transform, D4[edit]

d1 = d * ((sqrt(3) - 1) / sqrt(2));
s2 = s * ((sqrt(3) + 1) / sqrt(2));
s1 = s2 + circshift(d1, - 1);
S(2:2:N) = d1 + sqrt(3) / 4 * s1 + (sqrt(3) - 2) / 4 * circshift(s1, 1);
S(1:2:N - 1) = s1 - sqrt(3) * S(2:2:N);


It was shown by Ali Akansu in 1990 that the binomial quadrature mirror filter bank (binomial QMF) is identical to the Daubechies wavelet filter, and its performance was ranked among known subspace solutions from a discrete-time signal processing perspective.[3][4] It was an extension of the prior work on binomial coefficient and Hermite polynomials that led to the development of the Modified Hermite Transformation (MHT) in 1987.[5][6] The magnitude square functions of Binomial-QMF filters are the unique maximally flat functions in a two-band perfect reconstruction QMF (PR-QMF) design formulation that is related to the wavelet regularity in the continuous domain.[7][8]


  • The application of Daubechies wavelet transform as a watermarking scheme has been proved effective. This approach operates in a proficient multi-resolution frequency domain, enabling the incorporation of an encrypted digital logo in the format of QR codes.[9]
  • Daubechies wavelet approximation can be used to analyze Griffith crack behavior in nonlocal magneto-elastic horizontally shear (SH) wave propagation within a finite-thickness, infinitely long homogeneous isotropic strip. [10]
  • Daubechies wavelet cepstral coefficients can be useful in the context of Parkinson's disease detection. Daubechies wavelets, known for their efficient multi-resolution analysis, are utilized to extract cepstral features from vocal signal data. These wavelet-based coefficients can act as discriminative features for accurately identifying patterns indicative of Parkinson's disease, offering a novel approach to diagnostic methodologies.[11]
  • When it comes to analysis and detection of Community Acquired Pneumonia (CAP), Complex Daubechies wavelets can be used to identify intricate details of the CAP affected areas in infected lungs to produce accurate results. [12]
  • The elastohydrodynamic lubrication problem involves the study of lubrication regimes in which the deformation of the contacting surfaces significantly influences the lubricating film. Daubechies wavelets can address the challenges associated with accurately modeling and simulating such intricate lubrication phenomena. Daubechies wavelets allows for a more detailed and refined exploration of the interactions between the lubricant and the contacting surfaces.[13]
  • Daubechies Wavelet can extract intricate details and features from the vibroacoustic signals, offering a comprehensive diagnostic approach for evaluating the condition and performance of diesel engines in combine harvesters. The Daubechies Wavelet spectrum serves as a powerful analytical tool, allowing the researchers to identify patterns, anomalies, and characteristic signatures within the signals associated with different engine conditions. This detailed spectral analysis aids in enhancing the accuracy of diagnostic assessments, enabling a more nuanced understanding of the vibrational and acoustic characteristics indicative of engine health or potential issues.[14]
  • In practical terms, the Daubechies wavelets facilitate a finely tuned examination of the temporal and spatial characteristics of dynamic waves within elastic materials. This approach enables a more nuanced understanding of how elastic solids respond to varying dynamic conditions over time. The integration of Daubechies wavelets into the finite wavelet domain method likely contributes to a more versatile and robust analytical framework for studying transient dynamic waves in elastic solids.[15]
  • The brachistochrone problem can be formulated and expressed as a variational problem, emphasizing the importance of finding the optimal curve that minimizes the time of descent. By introducting Daubechies wavelets into the mathematical framework, scaling functions associated with these wavelets can construct an approximation of the optimal curve. Daubechies wavelets, with their ability to capture both high and low-frequency components of a function, prove instrumental in achieving a detailed representation of the brachistochrone curve.[16]

See also[edit]


  1. ^ I. Daubechies, Ten Lectures on Wavelets, SIAM, 1992, p. 194.
  2. ^ Daubechies Wavelet in Mathematica. Note that in there n is n/2 from the text.
  3. ^ A.N. Akansu, An Efficient QMF-Wavelet Structure (Binomial-QMF Daubechies Wavelets), Proc. 1st NJIT Symposium on Wavelets, April 1990.
  4. ^ A.N. Akansu, R.A. Haddad and H. Caglar, Perfect Reconstruction Binomial QMF-Wavelet Transform, Proc. SPIE Visual Communications and Image Processing, pp. 609–618, vol. 1360, Lausanne, Sept. 1990.
  5. ^ A.N. Akansu, Statistical Adaptive Transform Coding of Speech Signals. Ph.D. Thesis. Polytechnic University, 1987.
  6. ^ R.A. Haddad and A.N. Akansu, "A New Orthogonal Transform for Signal Coding," IEEE Transactions on Acoustics, Speech and Signal Processing, vol.36, no.9, pp. 1404-1411, September 1988.
  7. ^ H. Caglar and A.N. Akansu, A Generalized Parametric PR-QMF Design Technique Based on Bernstein Polynomial Approximation, IEEE Trans. Signal Process., pp. 2314–2321, July 1993.
  8. ^ O. Herrmann, On the Approximation Problem in Nonrecursive Digital Filter Design, IEEE Trans. Circuit Theory, vol CT-18, no. 3, pp. 411–413, May 1971.
  9. ^ Umer, Aziz Waqas; Majid, Khan; Syeda, Iram Batool (18 December 2019). "A new watermarking scheme based on Daubechies wavelet and chaotic map for quick response code images". Multimedia Tools and Applications. 79 (9–10): 6891–6914. doi:10.1007/s11042-019-08570-5.
  10. ^ Jyotirmoy, Mouley; Nantu, Sarkar; Soumen, De (5 January 2023). "Griffith crack analysis in nonlocal magneto-elastic strip using Daubechies wavelets". Waves in Random and Complex Media: 1–19. doi:10.1080/17455030.2022.2163060.
  11. ^ Soumaya, Zayrit; Taoufiq, Belhoussine Drissi; Abdelkrim, Ammoumou (2020). "Daubechies Wavelet Cepstral Coefficients for Parkinson's Disease Detection" (PDF). Complex Systems.
  12. ^ Natzina, Juanita S.R.F; Nadine, Suzanne S.R.F; Shojaa, Ayed Aljasar; Yubin, Xu; Muhammad, Saqib (2020). "Analysis and Detection of Community Acquired Pneumonia Using PSPNET with Complex Daubechies Wavelets". Indian Journal of Computer Science and Engineering (IJCSE).
  13. ^ S.C., Shiralashetti; S.I., Hanaji; Sharada, S.Naregal (28 July 2020). "Daubechies wavelet based numerical method for the solution of grease elastohydrodynamic lubrication problem". International Conference on Mathematical Sciences and Applications.
  14. ^ L L, Titova; Yu, M Chernik; Yu O, Gumenyuk; M M, Korobko (2020). "Research of Daubechies Wavelet spectrum of vibroacoustic signals for diagnostic of diesel engines of combine harvesters". IOP Conference Series: Earth and Environmental Science. 548: 032030. doi:10.1088/1755-1315/548/3/032030.
  15. ^ Christos, V.Nastos; Dimitris, A. Saravanos (7 September 2021). "Multiresolution Daubechies finite wavelet domain method for transient dynamic wave analysis in elastic solids". International Journal for Numerical Methods in Engineering. 122 (23): 7078–7100. doi:10.1002/nme.6822.
  16. ^ Azad, Kasnazani; Amjad, AliPanah (2021). "Solving brachistochrone problem via scaling functions of Daubechies wavelets". Computational Methods for Differential Equations.

External links[edit]