Sparse Representation of Vibration Signals Using Trained Dictionary
Jun Feng Guo, Xiao Hui Zheng, Xing Chun Wei, Ruicheng Feng
Abstract
Jun Feng Guo, Xiao Hui Zheng, Xing Chun Wei, Ruicheng Feng
Abstract
The sparsity of a signal is critical for compression and high compression performance is obtained by utterly sparse signal. But real signals are not sparse commonly, so sparse transformation is considered. In addition, the sparse degree of coefficients is mainly determined by the quality of transform base. Therefore, this paper constructs a transform base (trained dictionary) by K-SVD algorithm for rolling element bearing vibration signals and uses the Orthogonal Matching Pursuit (OMP) algorithm to conduct sparse representation and simulation. Results show that the trained dictionary can be more fitted with the features of signals, the residual components are smaller and the reconstruct similarity is higher compared to the untrained dictionaries, obtaining better representation.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The sparsity of a signal is critical for compression and high compression performance is obtained by utterly sparse signal. But real signals are not sparse commonly, so sparse transformation is considered. In addition, the sparse degree of coefficients is mainly determined by the quality of transform base. Therefore, this paper constructs a transform base (trained dictionary) by K-SVD algorithm for rolling element bearing vibration signals and uses the Orthogonal Matching Pursuit (OMP) algorithm to conduct sparse representation and simulation. Results show that the trained dictionary can be more fitted with the features of signals, the residual components are smaller and the reconstruct similarity is higher compared to the untrained dictionaries, obtaining better representation.
Key concepts: Matching pursuit, Sparse approximation, K-SVD, Pattern recognition (psychology), Transformation (genetics), Computer science, Representation (politics), Residual