.png){kind=icon}
.png){kind=icon}
Return
Computing One-Bit Compressive Sensing via Alternating Proximal Algorithm
.png){kind=icon}
OA
AI
DOI：10.3390/math13182926.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
It is challenging to recover a real sparse signal using one-bit compressive sensing. Existing methods work well when there is no noise (sign flips) in the measurements or the noise level or a priori information about signal sparsity is known. However, the noise level and a priori information about signal sparsity are not always known in practice. In this paper, we propose a robust model with a non-smooth and non-convex objective function. In this model, the noise factor is considered without knowing the noise level or a priori information about the signal sparsity. We develop an alternating proximal algorithm and prove that the sequence generated from the algorithm converges to a local minimizer of the model. Our algrithm possesses high time efficiency and recovery accuracy. It performs better than other algorithms tested in our experiments when the the noise level and the sparsity of the signal is known.
Keywords:
one-bit compressive sensing
sparse signal reconstruction
alternating proximal algorithm
local convergence
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.2
Papers:
2.4K
Citations:
3.6W
Organization
No organization information available