Name
Abstract | ||
|---|---|---|
The traditional approaches for condition monitoring of roller bearings are almost always achieved under Shannon sampling theorem conditions, leading to a big-data problem. The compressed sensing (CS) theory provides a new solution to the big-data problem. However, the vibration signals are insufficiently sparse and it is difficult to achieve sparsity using the conventional techniques, which impedes the application of CS theory. Therefore, it is of great significance to promote the sparsity when applying the CS theory to fault diagnosis of roller bearings. To increase the sparsity of vibration signals, a sparsity-promoted method called the tunable Q-factor wavelet transform based on decomposing the analyzed signals into transient impact components and high oscillation components is utilized in this work. The former become sparser than the raw signals with noise eliminated, whereas the latter include noise. Thus, the decomposed transient impact components replace the original signals for analysis. The CS theory is applied to extract the fault features without complete reconstruction, which means that the reconstruction can be completed when the components with interested frequencies are detected and the fault diagnosis can be achieved during the reconstruction procedure. The application cases prove that the CS theory assisted by the tunable Q-factor wavelet transform can successfully extract the fault features from the compressed samples. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.3390/s16091524 | SENSORS |
Keywords | Field | DocType |
roller bearing,fault diagnosis,compressed sensing,sparsity,fault feature,tunable Q-factor wavelet transform | Electronic engineering,Bearing (mechanical),Condition monitoring,Reconstruction procedure,Nyquist–Shannon sampling theorem,Engineering,Vibration,Almost surely,Compressed sensing,Wavelet transform | Journal |
Volume | Issue | ISSN |
16 | 9.0 | 1424-8220 |
Citations | PageRank | References |
3 | 0.46 | 9 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huaqing Wang | 1 | 20 | 4.03 |
| Yanliang Ke | 2 | 6 | 0.92 |
| Liuyang Song | 3 | 24 | 6.13 |
| Gang Tang | 4 | 18 | 3.27 |
| Peng Chen | 5 | 127 | 19.10 |