IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v58y2020i13p3931-3943.html
   My bibliography  Save this article

Performance degradation assessment of rolling bearing based on convolutional neural network and deep long-short term memory network

Author

Listed:
  • Zheng Wang
  • Hongzhan Ma
  • Hansi Chen
  • Bo Yan
  • Xuening Chu

Abstract

Many traditional approaches for performance degradation assessment of rolling bearings, using sensor data, make assumptions about how they degrade or fault evolve. However, the sequential sensor data cannot be directly taken as input in the traditional models since the data always contain noise and change in length. To solve these problems, a convolutional neural network and deep long-short term memory (CNN-DLSTM) based architecture is proposed to obtain an unsupervised H-statistic for performance degradation assessment of rolling bearing using sensor time-series data. Firstly, a CNN is applied to extract local abstract features from raw sensor data. Secondly, a deep LSTM is explored to extract temporal features. CNN-DLSTM is trained to reconstruct the time-series sensor signal reflecting the health condition of rolling bearing. The D- and Q-statistic are used to compute H-statistic which is then used for performance degradation assessment. The proposed approach is evaluated on an experiment with rolling bearings and the results are presented on a public dataset of rolling bearing, verifying that the proposed approach outperforms several state-of-the-art methods.

Suggested Citation

  • Zheng Wang & Hongzhan Ma & Hansi Chen & Bo Yan & Xuening Chu, 2020. "Performance degradation assessment of rolling bearing based on convolutional neural network and deep long-short term memory network," International Journal of Production Research, Taylor & Francis Journals, vol. 58(13), pages 3931-3943, July.
  • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:13:p:3931-3943
    DOI: 10.1080/00207543.2019.1636325
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1636325
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2019.1636325?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:58:y:2020:i:13:p:3931-3943. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.