An Intelligent Approach for Bearing Fault Diagnosis: Combination of 1D-LBP and GRA
Melih Kuncan
IEEE Access · 2020
doi:10.1109/access.2020.3011980 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Bearings are vital automation machine elements that are used quite frequently for power transmission and shaft bearing in rotating machines. The healthy operation of the bearings directly affects the performance of the rotating machines. Bearing faults may cause more vibration than normal in rotating machines, which wastes power. However, further bearing failures can cause vital damage to rotating machines. In this study, bearing vibration values are obtained through a special test setup. Different types and different sizes of artificial faults have been created in the bearings for the testing process. Data on these bearings are collected at different speeds. The purpose of the study is to diagnose faults in the bearings. In this context, a new approach is proposed. First, the one-dimensional local binary pattern (1D-LBP) method is applied to vibration signals, and all signal data are carried to the 1D-LBP plane. Statistical features are obtained from the signals in the 1D-LBP plane by using these features, and then the vibrational signals are classified by the gray relational analysis (GRA) model. Four different data sets are organized to test the proposed approach. The results of the test process with this proposed model have an accuracy of 99.044% for Dataset1 (different speed -300 rpm intervals), 94.224% for Dataset2 (different speed -60 rpm intervals), and 99.584% for Dataset3 (fault size (mm)); a 100% average success rate is observed for Dataset4 (fault type - error free bearing (EFB), inner ring fault (IRF), outer ring fault (ORF), and ball fault (BF)).
Abstract licence: CC BY-NC-ND
References50
40 more references, whose wording the paper’s licence keeps private.
All 50 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.