Draft:Vanishing moment
Review waiting, please be patient.
This may take 8 weeks or more, since drafts are reviewed in no specific order. There are 1,842 pending submissions waiting for review.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Reviewer tools
|
Submission declined on 22 December 2024 by Significa liberdade (talk).
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
This draft has been resubmitted and is currently awaiting re-review. |
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (December 2024) |
Vanishing moments are a fundamental concept in wavelet theory, signal processing, and functional analysis. They describe a property of a wavelet or function, wherein certain integrals of the function against polynomial terms up to a specific degree vanish. This property is crucial in determining the ability of a wavelet to represent and compress signals effectively. It is used to evaluate whether the mother wavelet effectively captures high-frequency components of a signal.
Origins
[edit]In the Continuous Wavelet Transform (CWT), the mother wavelet must satisfy five primary constraints:
1. Compact Support
2. Real Function
3. Even or Odd Symmetry
4. High Vanishing Moments[1]
5. Admissibility Criterion[2]
- ,
- where is the Fourier transform of .
Definition
[edit]Mathematically, a function is said to have vanishing moments if [1]:
In simpler terms, a wavelet has vanishing moments up to order if it is orthogonal to all polynomials of degree or lower.
The -th moment is defined as:
where has vanishing moments if .
Calculations
[edit]Calculating the zeroth moment
[edit]To compute :
1. Calculate the Fourier transform of :
2. Extract the DC component ()
Calculating the k-th moment
[edit]Using a property of the Fourier transform: differentiating -times in the frequency domain is equivalent to multiplying by in the time domain
.
When , this simplifies to:
Thus, the -th moment can be computed as:
Common functions and their vanishing moments
[edit]Vanishing moments are one of the properties for analyzing wavelets. Here are some commonly used functions categorized into continuous functions and discrete coefficients of continuous functions:
Continuous functions
[edit]Haar basis function
[edit]- Expression[3]:
- Since is an odd function:
- However, is an even function:
- Vanishing moments: 1
- Since is the second derivative of Gaussian function, its Fourier transform is:
- Using the moment formula:
- we find:
- Vanishing moments: 2
- Vanishing moments:
Discrete coefficients of continuous functions
[edit]Daubechies wavelet
[edit]- Daubechies wavelet, widely used in practice, has varying numbers of vanishing moments, offering a balance between localization in time and frequency domains[1][3][8].
- For a -point Daubechies wavelet, vanishing moment .
Symlet and Coiflets
[edit]- Symlets are designed for improved symmetry, and Coiflets ensure both wavelet and scaling functions have vanishing moments[9][10].
- For a -point Symlet, vanishing moment .
- For a -point Coiflet, vanishing moment .
Significance of Vanishing Moments for Functions
[edit]Vanishing moments serve as an indicator of how a function decreases in magnitude. For example, consider the function:
As the input value increases toward infinity, this function decreases at a rate proportional to . The decay rate of such a function can be evaluated using the momentum integral defined as .
In this example:
When : The numerator oscillates between , causing the function to oscillate within . This oscillatory behavior ensures that:
Thus, the integral converges to 0, representing the zeroth momentum .
When :
Here, the first momentum is nonzero, .
For : The momentum integral diverges as .
From this example, the maximum value of for which the momentum integral converges to zero determines the decay rate of the function. This maximum value is defined as the vanishing moment of the function.
In continuous wavelet transforms, one of the conditions for designing a wavelet mother function is that its support must be finite. The rate at which the wavelet mother function decays within this finite support is characterized by its vanishing moments.
Equivalent Statements of Vanishing Moments
[edit]According to the definition, the condition for a wavelet mother function to have vanishing moments is[1]:
However, since this definition involves an infinite-range continuous integral, it is not practical for designing wavelet mother functions.
If the scaling function in the wavelet transform is defined as , and the following relationship between the wavelet mother function and the scaling function holds[1][11]:
Then, the following four statements are equivalent[1]:
1. The wavelet mother function has vanishing moments.
2. The Fourier transforms of and , along with their derivatives up to th order, are zero at .
3. The Fourier transforms of and , along with their derivatives up to th order, are zero at .
4. For any in the interval ,
- is a polynomial function of degree .
Vanishing Moments and Wavelet Function Design
[edit]When the Fourier transform of a filter satisfies the following condition:
the filter meets the condition of a conjugate mirror filter[12]. Here, represents the Fourier transform of the discrete low-pass filter .
By combining the conjugate mirror filter condition with the third equivalent statement of vanishing moments, the low-pass filter can be expressed as:
where is a polynomial function.
Using the above condition and the equivalent statements of vanishing moments, the design process for wavelet functions can be simplified.
Vanishing Moments and Filter Length
[edit]In wavelet transforms, the scaling function and wavelet mother function can be defined using discrete filters[12]:
Here, is the discrete low-pass filter, and is the discrete high-pass filter. The filter length is usually expressed in terms of the size of support.
From the expression , we can observe that:
Choosing a higher number of vanishing moments results in being a polynomial function with higher powers of . Consequently, the corresponding will have a longer filter length.
In general, there is a trade-off between having a higher number of vanishing moments and a shorter filter length; both cannot be achieved simultaneously.
Thus, when designing the wavelet mother function for continuous wavelet transforms, considerations should include not only the number of vanishing moments but also the corresponding filter length.
References
[edit]- ^ a b c d e f Mallat, S. (1999). A Wavelet Tour of Signal Processing. Academic Press.
- ^ Grossmann, A. (1984). "Decomposition of Hardy functions into square integrable wavelets of constant shape". SIAM Journal on Mathematical Analysis. 15 (4): 723–736. doi:10.1137/S0036144500371907.
- ^ a b Daubechies, I. (1988). "Orthonormal bases of compactly supported wavelets". Communications on Pure and Applied Mathematics. 41 (7): 909–996. doi:10.1002/cpa.3160410705.
- ^ Farge, M. (1992). "Wavelet Transforms and Their Applications to Turbulence". Annual Review of Fluid Mechanics. 24 (1): 395–458. Bibcode:1992AnRFM..24..395F. doi:10.1146/annurev.fl.24.010192.002143.
- ^ Torrence, C.; Compo, G. P. (1998). "A Practical Guide to Wavelet Analysis". Bulletin of the American Meteorological Society. 79 (1): 61–78. Bibcode:1998BAMS...79...61T. doi:10.1175/1520-0477(1998)079<0061:APGTWA>2.0.CO;2.
- ^ Stepanov, A. B. (May 2017). "Construction of Activation Functions for Wavelet Neural Networks". 2017 XX IEEE International Conference on Soft Computing and Measurements (SCM). IEEE. pp. 397–399. doi:10.1109/SCM.2017.7970688.
- ^ Mallat, S.; Hwang, W. L. (1992). "Singularity detection and processing with wavelets". IEEE Transactions on Information Theory. 38 (2): 617–643. doi:10.1109/18.119727.
- ^ Daubechies, Ingrid (1992). Ten Lectures on Wavelets. SIAM. ISBN 978-0898712742.
- ^ Percival, D.B. (2000). Wavelet Methods for Time Series Analysis. Cambridge University Press. doi:10.1017/CBO9780511804289 (inactive 23 December 2024).
{{cite book}}
: CS1 maint: DOI inactive as of December 2024 (link) - ^ Ford, M. S. (2003). The Illustrated Wavelet Transform Handbook: Introductory Theory and Applications in Science. CRC Press. ISBN 978-0367574000.
- ^ "A Really Friendly Guide To Wavelets – PolyValens". www.polyvalens.com.
- ^ a b Mallat, S. (2009). "Wavelet Bases". A Wavelet Tour of Signal Processing. Academic Press. pp. 263–376. ISBN 978-0123743701.
- Strang, G. (1996). Wavelets and Filter Banks. Wellesley-Cambridge Press.
- Debnath, L. (2012). Wavelet Transforms and Time-Frequency Signal Analysis. Springer Science & Business Media.
- Addison, P.S. (2017). The Illustrated Wavelet Transform Handbook: Introductory Theory and Applications in Science, Engineering, Medicine and Finance. CRC Press.
- Promotional tone, editorializing and other words to watch
- Vague, generic, and speculative statements extrapolated from similar subjects
- Essay-like writing
- Hallucinations (plausible-sounding, but false information) and non-existent references
- Close paraphrasing
Please address these issues. The best way to do it is usually to read reliable sources and summarize them, instead of using a large language model. See our help page on large language models.