.png){kind=icon}
Return
Sparse recovery using expanders via hard thresholding algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2024.109715.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Expanders play an important role in combinatorial compressed sensing. Via expanders measurements, we propose the expander normalized heavy ball hard thresholding algorithm (ENHB-HT) based on expander iterative hard thresholding (E-IHT) algorithm. We provide convergence analysis of ENHB-HT, and it turns out that ENHB-HT can recover an s-sparse signal if the measurement matrix A E {0, , 1} m x n satisfies some mild conditions. Numerical experiments are simulated to support our two main theorems which describe the convergence rate and the accuracy of the proposed algorithm. Simulations are also performed to compare the performance of ENHB-HT and several existing algorithms under different types of noise, the empirical results demonstrate that our algorithm outperform a few existing ones in the presence of outliers.
Keywords:
Combinatorial compressed sensing
Sparse signal recovery
Heavy ball method
Lossless expanders
Hard thresholding
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveHomogeneous catalytic reduction of nitric oxide by olefins in the presence of palladium(II) chloride
PREAI
ShareSave
ShareSaveShareSave
View more