Title
NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
Abstract
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 ...
Year
DOI
Venue
2022
10.1109/TIT.2021.3124598
IEEE Transactions on Information Theory
Keywords
DocType
Volume
Compressed sensing,Approximation error,Quantization (signal),Standards,Sensors,Measurement uncertainty,Approximation algorithms
Journal
68
Issue
ISSN
Citations 
2
0018-9448
1
PageRank 
References 
Authors
0.37
0
4
Name
Order
Citations
PageRank
Michael P. Friedlander110.37
Halyun Jeong210.37
Yaniv Plan3117457.19
Özgür Yilmaz468551.36