نتایج جستجو برای: fast fourier transform.
تعداد نتایج: 353482 فیلتر نتایج به سال:
anomaly detection (ad) has recently become an important application of target detection in hyperspectral images. the reed-xialoi (rx) is the most widely used ad algorithm that suffers from “small sample size” problem. the best solution for this problem is to use dimensionality reduction (dr) techniques as a pre-processing step for rx detector. using this method not only improves the detection p...
due to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. radix - 2 p algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2 . by defining a new concept, twiddle factor template , in this paper we propose a method for exact calculation of multiplicative complexity for radix-2 p algorithm...
nowadays with increasing use of numerous nonlinear loads, voltage and current harmonics in power systems are one of the most important problems power engineers encounter. many of these nonlinear loads, because of their dynamic natures, inject time-varying harmonics into power system. common techniques applied for harmonics measurement and assessment such as fft have significant errors in presen...
The Truncated Fourier Transform (tft) is a variation of the Discrete Fourier Transform (dft/fft) that allows for input vectors that do not have length 2 n for n a positive integer. We present the univariate version of the tft, originally due to Joris van der Hoeven, heavily illustrating the presentation in order to make these methods accessible to a broader audience.
We test various features for recognition of leaves of wooden species. We compare Fourier descriptors, Zernike moments, Legendre moments and Chebyshev moments. All the features are computed from the leaf boundary only. Experimental evaluation on real data indicates that Fourier descriptors slightly outperform the other tested features.
Fast algorithms for a wide class of non–separable n–dimensional (nD) discrete unitary K– transforms (DKT) are introduced. They need less 1D DKTs than in the case of the classical radix–2 FFT–type approach. The method utilizes a decomposition of the nDK–transform into the product of a new nD discrete Radon transform and of a set of parallel/independ 1D K–transforms. If the nD K–transform has a s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید