A Sparse Recovery Algorithm Using the Neurodynamic System With Predefined Time Convergence

被引:5
作者
Zhu, Yiyue [1 ]
He, Xing [2 ]
机构
[1] Southwest Univ, Westa Coll, Chongqing 400715, Peoples R China
[2] Southwest Univ, Coll Elect & Informat Engn, Chongqing Key Lab Nonlinear Circuits & Intelligent, Chongqing 400715, Peoples R China
关键词
Index Terms-Compressed sensing; l1-norm; predefined local competitive algorithm; predefined time local competitive algo-rithm; sliding mode control technique;
D O I
10.1109/TCSII.2023.3253130
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Compressed sensing aims to compress sparse signals losslessly into significantly smaller samples and recover them if needed. One of the most critical approaches to recovering the sparse signal is minimizing $l_{1}$ -norm, the convex relaxation of $l_{0}$ -norm with the limit of linear measurement. However, sometimes such as the recovery of piecewise constant sparse signal, the need for controlling the convergence time has become an inevitable problem to solve. To solve this problem, the predefined time pseudo-inverse locally competitive algorithm (PPLCA) based on a nonlinear neurodynamic system is proposed in this brief, which is exceptionally effective if the signal is piecewise constant. Further, under the restricted isometry property (RIP), the predefined-time convergence rate of the proposed PPLCA is proven using Lyapunov's stability theory. Finally, the numerical simulations show that the PPLCA could converge to the stationary point within the predefined time.
引用
收藏
页码:3029 / 3033
页数:5
相关论文
共 21 条
  • [1] K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    Aharon, Michal
    Elad, Michael
    Bruckstein, Alfred
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) : 4311 - 4322
  • [2] Convergence Speed of a Dynamical System for Sparse Recovery
    Balavoine, Aurele
    Rozell, Christopher J.
    Romberg, Justin
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (17) : 4259 - 4269
  • [3] Decoding by linear programming
    Candes, EJ
    Tao, T
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) : 4203 - 4215
  • [4] Rejoinder:: The Dantzig selector:: Statistical estimation when p is much larger than n
    Candes, Emmanuel
    Tao, Terence
    [J]. ANNALS OF STATISTICS, 2007, 35 (06) : 2392 - 2404
  • [5] Candès EJ, 2008, IEEE SIGNAL PROC MAG, V25, P21, DOI 10.1109/MSP.2007.914731
  • [6] Chen SSB, 2001, SIAM REV, V43, P129, DOI [10.1137/S003614450037906X, 10.1137/S1064827596304010]
  • [7] An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
    Daubechies, I
    Defrise, M
    De Mol, C
    [J]. COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2004, 57 (11) : 1413 - 1457
  • [8] Sánchez-Tones JD, 2015, P AMER CONTR CONF, P5842, DOI 10.1109/ACC.2015.7172255
  • [9] Adaptive Predefined-Time Attitude Stabilization Control of Space Continuum Robot
    Ding, Meng
    Wu, Hailei
    Zheng, Xianjie
    Guo, Yu
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2024, 71 (02) : 647 - 651
  • [10] CAPPA: Continuous-Time Accelerated Proximal Point Algorithm for Sparse Recovery
    Garg, Kunal
    Baranwal, Mayank
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2020, 27 (27) : 1760 - 1764