Fault diagnosis of rolling bearing based on fast nonlocal means and envelop spectrum

Yong Lv1, Qinglin Zhu2, Rui Yuan3

  • 1School of Mechanical Engineering, Wuhan University of Science and Technology, Wuhan 430081, China. lvyong@wust.edu.cn.

Related Concept Videos

IR Spectrum Peak Splitting: Symmetric vs Asymmetric Vibrations01:08

IR Spectrum Peak Splitting: Symmetric vs Asymmetric Vibrations

Identical bonds within a polyatomic group can stretch symmetrically (in-phase) or asymmetrically (out-of-phase). Similar to hydrogen bonding, these vibrations also influence the shape of the IR peak. Generally, asymmetric stretching frequencies are higher than symmetric stretching frequencies. For example, primary amines exhibit two distinct IR peaks between 3300–3500 cm−1 corresponding to the symmetric and asymmetric N-H stretching, while secondary amines exhibit a single...
2.3K
Bearings: Problem Solving01:24

Bearings: Problem Solving

Understanding the calculations and concepts related to double-collar bearings is essential for engineers and designers to optimize the performance of these components in various applications. By analyzing the bearing under different conditions, one can ensure that it can withstand the forces and moments experienced during operation. This knowledge enables better decision-making when designing and selecting bearings for specific purposes and configurations. Consider a double-collar bearing with...
566
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
457
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...
1.3K
Classification of Signals01:30

Classification of Signals

In signal processing, signals are classified based on various characteristics: continuous-time versus discrete-time, periodic versus aperiodic, analog versus digital, and causal versus noncausal. Each category highlights distinct properties crucial for understanding and manipulating signals.
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...
1.7K