IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/6489917.html
   My bibliography  Save this article

An Adaptive Sparsity Estimation KSVD Dictionary Construction Method for Compressed Sensing of Transient Signal

Author

Listed:
  • Mingchi Ju
  • Tailin Han
  • Rongkang Yang
  • Man Zhao
  • Hong Liu
  • Bo Xu
  • Xuan Liu
  • Bogdan Dumitrescu

Abstract

Overcomplete dictionaries occupy an essential position in the sparse representation of signals. The dictionary construction method typically represented by K singular value decomposition (KSVD) is widely used because of its concise and efficient features. In this paper, based on the background of transient signal detection, an adaptive sparse estimation KSVD (ASE-KSVD) dictionary training method is proposed to solve the redundant iteration problem caused by fixed sparsity in existing KSVD dictionary construction. The algorithm features an adaptive sparsity estimation strategy in the sparse coding stage, which adjusts the number of iterations required for dictionary training based on the pre-estimation of the sample signal characteristics. The aim is to decrease the number of solutions of the underdetermined system of equations, reduce the overfitting error under the finite sparsity condition, and improve overall training efficiency. We compare four similar algorithms under the speech signal and actual shock wave sensor network data conditions, respectively. The results show that the proposed algorithm has obvious performance advantages and can be applied to real-life scenarios.

Suggested Citation

  • Mingchi Ju & Tailin Han & Rongkang Yang & Man Zhao & Hong Liu & Bo Xu & Xuan Liu & Bogdan Dumitrescu, 2022. "An Adaptive Sparsity Estimation KSVD Dictionary Construction Method for Compressed Sensing of Transient Signal," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-12, July.
  • Handle: RePEc:hin:jnlmpe:6489917
    DOI: 10.1155/2022/6489917
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/6489917.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/6489917.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/6489917?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
    ---><---

    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:hin:jnlmpe:6489917. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.