Next Article in Journal
Simultaneous State and Parameter Estimation Methods Based on Kalman Filters and Luenberger Observers: A Tutorial & Review
Previous Article in Journal
FloCyT: A Flow-Aware Centroid Tracker for Cell Analysis in High-Speed Capillary-Driven Microfluidic Flow
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Robust Sparse Non-Negative Matrix Factorization for Identifying Signals of Interest in Bearing Fault Detection

1
Tony Davies High Voltage Laboratory, School of Electronics and Computer Science, Faculty of Engineering and Physical Sciences, University of Southampton, Southampton SO17 1BJ, UK
2
Faculty of Geoengineering, Mining and Geology, Wroclaw University of Science and Technology, Na Grobli 15, 50-421 Wrocław, Poland
*
Author to whom correspondence should be addressed.
Sensors 2025, 25(22), 7041; https://doi.org/10.3390/s25227041 (registering DOI)
Submission received: 10 October 2025 / Revised: 3 November 2025 / Accepted: 11 November 2025 / Published: 18 November 2025
(This article belongs to the Section Fault Diagnosis & Sensors)

Abstract

Bearings are among the most failure-prone components in rotating systems, making early fault detection crucial in industrial applications. While recent publications have focused on this issue, challenges remain, particularly in dealing with heavy-tailed or non-cyclic impulsive noise in recorded signals. Such noise poses significant challenges for classical fault selectors like kurtosis-based methods. Moreover, many deep-learning approaches struggle in these environments, as they often assume Gaussian or stationary noise and rely on large labeled datasets that are rarely available in practice. To address this, we propose a robust sparse non-negative matrix factorization (NMF) method based on the maximum-correntropy criterion, which is known for its robustness in the presence of heavy-tailed noise. This methodology is applied to identify fault frequency bands in the spectrogram of the signal. The effectiveness of the approach is validated using simulated fault signals under both Gaussian and heavy-tailed noise conditions through Monte Carlo simulations. A statistical efficiency analysis confirms robustness to random perturbations. Additionally, three real datasets are used to evaluate the performance of the proposed method. Results from both simulations and real-world data demonstrate the effectiveness of the proposed approach.
Keywords: bearing fault detection; heavy-tailed noise; non-cyclic impulsive noise; robust sparse non-negative matrix factorization; maximum-correntropy criterion; fault frequency band; Monte Carlo simulation bearing fault detection; heavy-tailed noise; non-cyclic impulsive noise; robust sparse non-negative matrix factorization; maximum-correntropy criterion; fault frequency band; Monte Carlo simulation

Share and Cite

MDPI and ACS Style

Shiri, H.; Michalak, A. Robust Sparse Non-Negative Matrix Factorization for Identifying Signals of Interest in Bearing Fault Detection. Sensors 2025, 25, 7041. https://doi.org/10.3390/s25227041

AMA Style

Shiri H, Michalak A. Robust Sparse Non-Negative Matrix Factorization for Identifying Signals of Interest in Bearing Fault Detection. Sensors. 2025; 25(22):7041. https://doi.org/10.3390/s25227041

Chicago/Turabian Style

Shiri, Hamid, and Anna Michalak. 2025. "Robust Sparse Non-Negative Matrix Factorization for Identifying Signals of Interest in Bearing Fault Detection" Sensors 25, no. 22: 7041. https://doi.org/10.3390/s25227041

APA Style

Shiri, H., & Michalak, A. (2025). Robust Sparse Non-Negative Matrix Factorization for Identifying Signals of Interest in Bearing Fault Detection. Sensors, 25(22), 7041. https://doi.org/10.3390/s25227041

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Article metric data becomes available approximately 24 hours after publication online.
Back to TopTop