A new -means singular value decomposition method based on self-adaptive matching pursuit and its application in fault diagnosis of rolling bearing weak fault
Sparse decomposition has excellent adaptability and high flexibility in describing arbitrary complex signals based on redundant and over-complete dictionary, thus having the advantage of being free from the limitations of traditional signal processing methods such as wavelet and fast Fourier transfo...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-05-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147720920781 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832553244286517248 |
|---|---|
| author | Hongchao Wang Wenliao Du |
| author_facet | Hongchao Wang Wenliao Du |
| author_sort | Hongchao Wang |
| collection | DOAJ |
| description | Sparse decomposition has excellent adaptability and high flexibility in describing arbitrary complex signals based on redundant and over-complete dictionary, thus having the advantage of being free from the limitations of traditional signal processing methods such as wavelet and fast Fourier transform being imposed by orthogonal basis. Sparse decomposition provides an effective approach for feature extraction of intricate vibration signals collected from rotating machinery. Self-learning over-complete dictionary and pre-defined over-complete dictionary are the two dictionary construction modes of sparse decomposition. Normally, the former mode owns the virtues of much more adaptive and flexible than the latter one, and several kinds of classical self-learning over-complete dictionary methods have been arising in recent years. K -means singular value decomposition is a classical self-learning over-complete dictionary method and has been used in image processing, speech processing, and vibration signal processing. However, K -means singular value decomposition has relative low reconstruction accuracy and poor stability to enhance the desired features. To overcome the above-mentioned shortcomings of K -means singular value decomposition, a new K -means singular value decomposition sparse representation method based on traditional K -means singular value decomposition method was proposed in this article, which uses the sparse adaptive matching pursuit algorithm and an iterative method based on the minimum similarity of atomic structure. The effectiveness and advantage of the proposed method were verified through simulation and experiment. |
| format | Article |
| id | doaj-art-1ed4ef2acabe430c89a0dfbd6644e933 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2020-05-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-1ed4ef2acabe430c89a0dfbd6644e9332025-02-03T05:54:33ZengWileyInternational Journal of Distributed Sensor Networks1550-14772020-05-011610.1177/1550147720920781A new -means singular value decomposition method based on self-adaptive matching pursuit and its application in fault diagnosis of rolling bearing weak faultHongchao Wang0Wenliao Du1Mechanical and Electrical Engineering Institute, Zhengzhou University of Light Industry, Zhengzhou, ChinaHenan Key Laboratory of Intelligent Manufacturing of Mechanical Equipment, Zhengzhou University of Light Industry, Zhengzhou, ChinaSparse decomposition has excellent adaptability and high flexibility in describing arbitrary complex signals based on redundant and over-complete dictionary, thus having the advantage of being free from the limitations of traditional signal processing methods such as wavelet and fast Fourier transform being imposed by orthogonal basis. Sparse decomposition provides an effective approach for feature extraction of intricate vibration signals collected from rotating machinery. Self-learning over-complete dictionary and pre-defined over-complete dictionary are the two dictionary construction modes of sparse decomposition. Normally, the former mode owns the virtues of much more adaptive and flexible than the latter one, and several kinds of classical self-learning over-complete dictionary methods have been arising in recent years. K -means singular value decomposition is a classical self-learning over-complete dictionary method and has been used in image processing, speech processing, and vibration signal processing. However, K -means singular value decomposition has relative low reconstruction accuracy and poor stability to enhance the desired features. To overcome the above-mentioned shortcomings of K -means singular value decomposition, a new K -means singular value decomposition sparse representation method based on traditional K -means singular value decomposition method was proposed in this article, which uses the sparse adaptive matching pursuit algorithm and an iterative method based on the minimum similarity of atomic structure. The effectiveness and advantage of the proposed method were verified through simulation and experiment.https://doi.org/10.1177/1550147720920781 |
| spellingShingle | Hongchao Wang Wenliao Du A new -means singular value decomposition method based on self-adaptive matching pursuit and its application in fault diagnosis of rolling bearing weak fault International Journal of Distributed Sensor Networks |
| title | A new -means singular value decomposition method based on self-adaptive matching pursuit and its application in fault diagnosis of rolling bearing weak fault |
| title_full | A new -means singular value decomposition method based on self-adaptive matching pursuit and its application in fault diagnosis of rolling bearing weak fault |
| title_fullStr | A new -means singular value decomposition method based on self-adaptive matching pursuit and its application in fault diagnosis of rolling bearing weak fault |
| title_full_unstemmed | A new -means singular value decomposition method based on self-adaptive matching pursuit and its application in fault diagnosis of rolling bearing weak fault |
| title_short | A new -means singular value decomposition method based on self-adaptive matching pursuit and its application in fault diagnosis of rolling bearing weak fault |
| title_sort | new means singular value decomposition method based on self adaptive matching pursuit and its application in fault diagnosis of rolling bearing weak fault |
| url | https://doi.org/10.1177/1550147720920781 |
| work_keys_str_mv | AT hongchaowang anewmeanssingularvaluedecompositionmethodbasedonselfadaptivematchingpursuitanditsapplicationinfaultdiagnosisofrollingbearingweakfault AT wenliaodu anewmeanssingularvaluedecompositionmethodbasedonselfadaptivematchingpursuitanditsapplicationinfaultdiagnosisofrollingbearingweakfault AT hongchaowang newmeanssingularvaluedecompositionmethodbasedonselfadaptivematchingpursuitanditsapplicationinfaultdiagnosisofrollingbearingweakfault AT wenliaodu newmeanssingularvaluedecompositionmethodbasedonselfadaptivematchingpursuitanditsapplicationinfaultdiagnosisofrollingbearingweakfault |