IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i9p834-d265687.html
   My bibliography  Save this article

Sparse Recovery Algorithm for Compressed Sensing Using Smoothed l 0 Norm and Randomized Coordinate Descent

Author

Listed:
  • Dingfei Jin

    (Central South University, CAD/CAM Institute, Changsha 410075, China)

  • Guang Yang

    (Zhengzhou Railway Vocational & Technical College, College of Railway Engineering, Zhengzhou 450000, China)

  • Zhenghui Li

    (Zhengzhou Railway Vocational & Technical College, Department of Foreign Affairs & Scientific Research, Zhengzhou 450000, China)

  • Haode Liu

    (Central South University, CAD/CAM Institute, Changsha 410075, China)

Abstract

Compressed sensing theory is widely used in the field of fault signal diagnosis and image processing. Sparse recovery is one of the core concepts of this theory. In this paper, we proposed a sparse recovery algorithm using a smoothed l 0 norm and a randomized coordinate descent (RCD), then applied it to sparse signal recovery and image denoising. We adopted a new strategy to express the ( P 0 ) problem approximately and put forward a sparse recovery algorithm using RCD. In the computer simulation experiments, we compared the performance of this algorithm to other typical methods. The results show that our algorithm possesses higher precision in sparse signal recovery. Moreover, it achieves higher signal to noise ratio (SNR) and faster convergence speed in image denoising.

Suggested Citation

  • Dingfei Jin & Guang Yang & Zhenghui Li & Haode Liu, 2019. "Sparse Recovery Algorithm for Compressed Sensing Using Smoothed l 0 Norm and Randomized Coordinate Descent," Mathematics, MDPI, vol. 7(9), pages 1-13, September.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:9:p:834-:d:265687
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/9/834/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/9/834/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Andrei Patrascu & Ion Necoara, 2015. "Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization," Journal of Global Optimization, Springer, vol. 61(1), pages 19-46, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hao Wang & Ruibin Feng & Chi-Sing Leung & Hau Ping Chan & Anthony G. Constantinides, 2022. "A Lagrange Programming Neural Network Approach with an ℓ 0 -Norm Sparsity Measurement for Sparse Recovery and Its Circuit Realization," Mathematics, MDPI, vol. 10(24), pages 1-22, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ion Necoara & Yurii Nesterov & François Glineur, 2017. "Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks," Journal of Optimization Theory and Applications, Springer, vol. 173(1), pages 227-254, April.
    2. Niu, Yi-Shuai & Júdice, Joaquim & Le Thi, Hoai An & Pham, Dinh Tao, 2019. "Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 353(C), pages 95-113.
    3. Sergiy Butenko, 2016. "Journal of Global Optimization Best Paper Award for 2015," Journal of Global Optimization, Springer, vol. 66(4), pages 595-596, December.
    4. Brás, Carmo P. & Fischer, Andreas & Júdice, Joaquim J. & Schönefeld, Klaus & Seifert, Sarah, 2017. "A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 294(C), pages 36-48.
    5. Andrea Cristofari, 2019. "An almost cyclic 2-coordinate descent method for singly linearly constrained problems," Computational Optimization and Applications, Springer, vol. 73(2), pages 411-452, June.
    6. Ching-pei Lee & Stephen J. Wright, 2020. "Inexact Variable Metric Stochastic Block-Coordinate Descent for Regularized Optimization," Journal of Optimization Theory and Applications, Springer, vol. 185(1), pages 151-187, April.
    7. R. Lopes & S. A. Santos & P. J. S. Silva, 2019. "Accelerating block coordinate descent methods with identification strategies," Computational Optimization and Applications, Springer, vol. 72(3), pages 609-640, April.
    8. I. V. Konnov, 2016. "Selective bi-coordinate variations for resource allocation type problems," Computational Optimization and Applications, Springer, vol. 64(3), pages 821-842, July.

    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:gam:jmathe:v:7:y:2019:i:9:p:834-:d:265687. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.