稳健性(进化)
压缩传感
计算机科学
算法
缩小
符号(数学)
趋同(经济学)
梯度下降
噪音(视频)
信号重构
信号处理
数学
人工智能
数字信号处理
人工神经网络
计算机硬件
生物化学
化学
基因
数学分析
经济
图像(数学)
程序设计语言
经济增长
作者
Xiao Peng Li,Zhang-Lei Shi,Lei Huang,Anthony Man–Cho So,Hing Cheung So
标识
DOI:10.1109/tsp.2024.3387346
摘要
One-bit compressed sensing (1-bit CS) inherits the merits of traditional CS and further reduces the cost and burden on the hardware device via employing the 1-bit analog-to-digital converter. When the measurements do not involve sign flips caused by additive noise, most contemporary algorithms can attain excellent signal restoration. However, their recovery performance might significantly degrade if there is even a small portion of sign flips. In order to increase the estimation accuracy in noisy scenarios, we devise a new signal model for 1-bit CS to attain robustness against sign flips. Then, we give a double-sparsity optimization formulation of the restoration problem. Subsequently, we combine proximal alternating minimization and projected gradient descent to tackle the problem. Different from existing robust methodologies, our approach, referred to as robust one-bit CS (ROCS), does not require the number of sign flips. Furthermore, we analyze the convergence behavior of ROCS and show that the objective value and variable sequences converge. Numerical results using synthetic data demonstrate that ROCS is superior to the competing methods in terms of reconstruction error in noisy environments. ROCS is also applied to direction-of-arrival estimation and outperforms state-of-the-art approaches.
科研通智能强力驱动
Strongly Powered by AbleSci AI