Topic
Harmonic wavelet transform
About: Harmonic wavelet transform is a research topic. Over the lifetime, 9602 publications have been published within this topic receiving 247336 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, a wavelet transform normalization procedure was proposed for the construction of a weighted bank of correlation filters, and a derivation was given to show that an inverse transform still exists when using the new normalization.
Abstract: A new wavelet transform normalization procedure is proposed for the construction of a weighted bank of correlation filters. The standard normalization results in lower input frequencies producing larger wavelet transform magnitudes for equal-amplitude frequencies, while the new normalization produces equal responses as desired. This is illustrated with examples of Gibbs overshooting phenomenon and a cocktail party effect. A derivation is given to show that an inverse transform still exists when using the new normalization.
40 citations
01 May 2017
TL;DR: 4 types of wavelets that can be applied to carry out fast discrete wavelet transforms are presented: based on the performed calculations the most appropriate wavelet is chosen.
Abstract: Signals are usually described in two domains: time and frequency. The Fourier transform is used for signal transformation from time domain to frequency domain and vice versa and that is enough to analyse the stationary signal. If a signal is non-stationary, the Fourier transform can be utilized to determine frequencies in signal but it can't be applied to determine the moment when a particular signal exists. For the analysis of non-stationary signals the wavelet transform can be used as well as a continuous or discrete wavelet transform. If the signal has a large number of samples, a discrete wavelet transform should be applicable preferably. If the signal is a discrete dynamic series, fast algorithms of discrete wavelet transforms can be used. The article presents 4 types of wavelets that can be applied to carry out fast discrete wavelet transforms. Based on the performed calculations the most appropriate wavelet is chosen.
40 citations
TL;DR: The performances of methods based on fast Fourier transforms and fast wavelet transforms for flank wear estimation are compared using data from turning experiments to provide a useful insight into their merits and drawbacks.
40 citations
TL;DR: In this paper, the Gabor and Morlet wavelet functions are compared with the general harmonic wavelet function and the time and frequency spreads of the two functions are shown to be similar.
40 citations
TL;DR: In this paper, a fast algorithm is presented for solving a time-domain electric field integral equation pertinent to the analysis of scattering from uniformly meshed, perfectly conducting structures, which is accelerated by using the fast Fourier transform to perform spatial convolutions.
Abstract: A fast algorithm is presented for solving a time-domain electric field integral equation (EFIE) pertinent to the analysis of scattering from uniformly meshed, perfectly conducting structures The marching-on-in-time (MOT) scheme that results from discretizing this EFIE is accelerated by using the fast Fourier transform to perform spatial convolutions The computational cost and storage requirements of this algorithm scale as O(NtNs 15) and O(Ns 15), respectively, as opposed to O(NtNs 2) and O(Ns 2) for classical MOT methods Simulation results demonstrate the accuracy and efficiency of the approach and suggestions for extending the technique are proffered
40 citations