相关实验视频

Updated: May 14, 2025

Design and Analysis for Fall Detection System Simplification
08:05

Design and Analysis for Fall Detection System Simplification

Published on: April 6, 2020

10.6K

全面利用时间和频域信息,通过自适应波形状转换通用对抗网络和集体学习来对不平衡数据集进行轴承故障诊断

Huachao Jiao1, Wenlei Sun1, Hongwei Wang1

  • 1Intelligent Manufacturing Modern Industry College, Xinjiang University, Urumqi 830049, China.

Sensors (Basel, Switzerland)
|April 12, 2025
PubMed
概括

本研究介绍了一种使用自适应波形状转换生成对抗网络 (AWLT-GAN) 来平衡轴承故障数据集的新方法. 该方法通过有效使用时间和频率域特征来增强轴承故障诊断.

关键词:
没有了,没有了,没有了.适应波形状的转换.轴承故障诊断 轴承故障诊断 轴承故障诊断组合学习组合学习不平衡数据的数据不平衡.

更多相关视频

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

42.6K
Combined Invasive Subcortical and Non-invasive Surface Neurophysiological Recordings for the Assessment of Cognitive and Emotional Functions in Humans08:25

Combined Invasive Subcortical and Non-invasive Surface Neurophysiological Recordings for the Assessment of Cognitive and Emotional Functions in Humans

Published on: May 19, 2016

10.6K

相关概念视频

Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
193
Aliasing01:18

Aliasing

Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
103
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
244
Time and frequency -Domain Interpretation of Phase-lead Control01:24

Time and frequency -Domain Interpretation of Phase-lead Control

Phase-lead controllers are commonly used in various control systems to enhance response speed and stability. Adjusting the brightness on a television screen offers a practical example of phase-lead control. When contrast is enhanced, a phase-lead controller is employed. Mathematically, phase-lead control is identified when the first parameter is smaller than the second.
The design of phase-lead control involves the strategic placement of poles and zeros to balance steady-state error and system...
68
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
228
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
226