.png){kind=icon}
返回
One-bit compressed sensing via total variation minimization method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2023.108939.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The goal of standard one-bit compressed sensing (1-bit CS) is to recover sparse signals with high fidelity from binary measurements that retain only their sign information. Besides sparsity, there are numerous signals consisting of other structures, such as signals consisting of piecewise constants (i.e., its gradient is sparse). This paper aims to address the recovery of such signals from one-bit measurements. Motivated by the superior performance of total variation (TV) minimization in conventional CS methods, this paper proposes the TV minimization in the 1-bit CS case. The proposed approaches can recover the direction of gradient sparse signals from ordinary one-bit measurements and the magnitude of gradient sparse signals from the thresholded one-bit measurements. We theoretically provide the upper bounds on the recovery errors, ensuring the effectiveness of the proposed methods. In practice, three algorithms: hard thresh-olding taut-string (HTTS), 1-bit total variation ADMM (TV-ADMM) and Second-Order Cone Programming (SOCP) are proposed to solve the proposed models. The promising performance of the new approach is supported by a series of simulated and real data examples.Crown Copyright (c) 2023 Published by Elsevier B.V. All rights reserved.
Keyword:
One -bit compressed sensing
Gradient sparse signals
Total variation minimization
HTTS
ADMM And SOCP algorithms
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
Protecting EFIE-based scattering computations from effects of interior resonances保护基于EFIE的散射计算免受内部谐振效应的影响
.png){kind=icon}
PREAI
分享收藏
查看更多内容