NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate

IEEE Transactions on Information Theory(2022)

引用 6|浏览25
暂无评分
摘要
The Binary Iterative Hard Thresholding (BIHT) algorithm is a popular reconstruction method for one-bit compressed sensing due to its simplicity and fast empirical convergence. Despite considerable research on this algorithm, a theoretical understanding of the corresponding approximation error and convergence rate still remains an open problem. This paper shows that the normalized ...
更多
查看译文
关键词
Compressed sensing,Approximation error,Quantization (signal),Standards,Sensors,Measurement uncertainty,Approximation algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要