.png){kind=icon}
.png){kind=icon}
Return
A nonconvex penalty function with integral convolution approximation for compressed sensing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2019.01.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a novel nonconvex penalty function for compressed sensing using integral convolution approximation. It is well known that an unconstrained optimization criterion based on l(1)-norm easily underestimates the large component in signal recovery. Moreover, most methods either perform well only under the Gaussian random measurement matrix satisfying restricted isometry property or the highly coherent measurement matrix, which both can not be established at the same time. We introduce a new solver to address both of these concerns by adopting a frame of the difference between two convex functions with integral convolution approximation. What's more, to better boost the recovery performance, a weighted version of it is also provided. Experimental results suggest the effectiveness and robustness of our methods through several signal reconstruction examples in term of success rate and signal-to-noise ratio. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Compressed sensing
Penalty function
Integral convolution
Restricted isometry property
Coherence
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W