Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Fourier Transform" wg kryterium: Temat


Wyświetlanie 1-6 z 6
Tytuł:
Discrete Fourier transform based pattern classifiers
Autorzy:
Hui, S.
Żak, S. H.
Powiązania:
https://bibliotekanauki.pl/articles/202074.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
pattern classification
multidimensional discrete Fourier transform
DFT
Fourier coefficients
Opis:
A technique for pattern classification using the Fourier transform combined with the nearest neighbor classifier is proposed. The multidimensional fast Fourier transform (FFT) is applied to the patterns in the data base. Then the magnitudes of the Fourier coefficients are sorted in descending order and the first P coefficients with largest magnitudes are selected, where P is a design parameter. These coefficients are then used in further processing rather than the original patterns. When a noisy pattern is presented for classification, the pattern’s P Fourier coefficients with largest magnitude are extracted. The coefficients are arranged in a vector in the descending order of their magnitudes. The obtained vector is referred to as the signature vector of the corresponding pattern. Then the distance between the signature vector of the pattern to be classified and the signature vectors of the patterns in the data base are computed and the pattern to be classified is matched with a pattern in the data base whose signature vector is closest to the signature vector of the pattern being classified.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 1; 15-22
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The unified theory of n-dimensional complex and hypercomplex analytic signals
Autorzy:
Hahn, S.
Snopek, K.
Powiązania:
https://bibliotekanauki.pl/articles/202287.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
complex/hypercomplex analytic signal
hypercomplex Fourier transform
hypercomplex delta distribution
Opis:
The paper is devoted to the theory of n-D complex and hypercomplex analytic signals with emphasis on the 3-dimensional (3-D) case. Their definitions are based on the proposed general n-D form of the Cauchy integral. The definitions are presented in signaland frequency domains. The new notion of lower rank signals is introduced. It is shown that starting with the 3-D analytic hypercomplex signals and decreasing their rank by extending the support in the frequency-space to a so called space quadrant, we get a signal having the quaternionic structure. The advantage of this procedure is demonstrated in the context of the polar representation of 3-D hypercomplex signals. Some new reconstruction formulas are presented. Their validation has been confirmed using two 3-D test signals: a Gaussian one and a spherical one.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 2; 167-181
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Two relations for generalized discrete Fourier transform coefficients
Autorzy:
Spałek, D.
Powiązania:
https://bibliotekanauki.pl/articles/201835.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
generalized discrete Fourier transform
coefficient errors
aliasing
dyskretna transformata Fouriera
Opis:
A new generalized discrete Fourier transform DFT that allows for sample shift δ 2 [0, T/N] in time-domain is defined. Two relations are proved for the sum of errors between generalized DFT coefficients and theirs theoretical values. The first is the equation for samples received for continuous and piecewise–smooth functions. The second relation is the inequality for samples generated by discontinuous functions. Moreover, the influence of samples shift on generalized DFT coefficients values, which leads to aliasing phenomenon, is presented.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 3; 275-281
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Discrete Fourier transform and permutations
Autorzy:
Hui, S.
Żak, S. H.
Powiązania:
https://bibliotekanauki.pl/articles/202022.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
discrete Fourier transform
DFT
DFT invariants
Fourier coefficients
permutations
DFT coefficient magnitudes
circulant matrix
pattern recognition
Opis:
It is well known that the magnitudes of the coefficients of the discrete Fourier transform (DFT) are invariant under certain operations on the input data. In this paper, the effects of rearranging the elements of an input data on its DFT are studied. In the one-dimensional case, the effects of permuting the elements of a finite sequence of length N on its Discrete Fourier transform (DFT) coefficients are investigated. The permutations that leave the unordered collection of Fourier coefficients and their magnitudes invariant are completely characterized. Conditions under which two different permutations give the same DFT coefficient magnitudes are given. The characterizations are based on the automorphism group of the additive group ZN of integers modulo N and the group of translations of ZN. As an application of the results presented, a generalization of the theorem characterizing all permutations that commute with the discrete Fourier transform is given. Numerical examples illustrate the obtained results. Possible generalizations and open problems are discussed. In higher dimensions, results on the effects of certain geometric transformations of an input data array on its DFT are given and illustrated with an example.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2019, 67, 6; 995-1005
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Time invariant property of weighted circular convolution and its application to continuous wavelet transform
Autorzy:
Yi, Hua
Ru, Yu-Le
Dai, Yin-Yun
Powiązania:
https://bibliotekanauki.pl/articles/2086853.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
continuous wavelet transform
linear convolution
weighted circular convolution
generalized discrete Fourier transform
ciągła transformata falkowa
splot liniowy
splot kołowy ważony
transformata Fouriera uogólniona dyskretna
Opis:
Time invariant linear operators are the building blocks of signal processing. Weighted circular convolution and signal processing framework in a generalized Fourier domain are introduced by Jorge Martinez. In this paper, we prove that under this new signal processing framework, weighted circular convolution also has a generalized time invariant property. We also give an application of this property to algorithm of continuous wavelet transform (CWT). Specifically, we have previously studied the algorithm of CWT based on generalized Fourier transform with parameter 1. In this paper, we prove that the parameter can take any complex number. Numerical experiments are presented to further demonstrate our analyses.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 4; e137726, 1--9
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stator winding fault detection of permanent magnet synchronous motors based on the bispectrum analysis
Autorzy:
Pietrzak, Przemysław
Wolkiewicz, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/2173641.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fault diagnosis
condition monitoring
inter-turn short circuits
permanent magnet synchronous motor
bispectrum
fast Fourier transform
błędna diagnoza
monitorowanie stanu
zwarcia międzyzwojowe
silnik synchroniczny z magnesami trwałymi
bispektrum
szybka transformata Fouriera
Opis:
The popularity of high-efficiency permanent magnet synchronous motors in drive systems has continued to grow in recent years. Therefore, also the detection of their faults is becoming a very important issue. The most common fault of this type of motor is the stator winding fault. Due to the destructive character of this failure, it is necessary to use fault diagnostic methods that facilitate damage detection in its early stages. This paper presents the effectiveness of spectral and bispectrum analysis application for the detection of stator winding faults in permanent magnet synchronous motors. The analyzed diagnostic signals are stator phase current, stator phase current envelope, and stator phase current space vector module. The proposed solution is experimentally verified during various motor operating conditions. The object of the experimental verification was a 2.5 kW permanent magnet synchronous motor, the construction of which was specially prepared to facilitate inter-turn short circuits modelling. The application of bispectrum analysis discussed so far in the literature has been limited to vibration signals and detecting mechanical damages. There are no papers in the field of motor diagnostic dealing with the bispectrum analysis for stator winding fault detection, especially based on stator phase current signal.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 2; art. no. e140556
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies