Introduction to Fourier analysis and wavelets

By M. Pinsky. 2002

434 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Outlier Analysis (2013, methodology): “Other methods such as Discrete Wavelet Transform (DWT) and Fast Fourier Transform are available for compressing the series with the multi-scale approach into numeric coefficients [366].”
Beyond Correlation Filters: Learning Continuous Convolution Operators for Visual Tracking (2016, background): “The Fourier coefficients ĝT [k] of gT can then be obtained by evaluating the Fourier transform ĝ(ξ) = ∫∞ −∞g(t)e −i2πξt dt of g at discrete locations using Poisson summation formula [21],”
PRICING DISCRETELY MONITORED BARRIER OPTIONS AND DEFAULTABLE BONDS IN LÉVY PROCESS MODELS: A FAST HILBERT TRANSFORM APPROACH (2008, background): “Furthermore, when 1 < p < ∞ the Hilbert transform is a bounded operator on Lp(R) with ‖H f ‖Lp(R) ≤ Cp‖ f ‖Lp(R),(5.6) where Cp = tan(π/2p) if 1 < p ≤ 2 and Cp = cot(π/2p) if 2 ≤ p < ∞ (Pichorides’s theorem; see Grafakos 2004, p. 255).”