Search Results for author:
Found 2 papers, 1 papers with code
Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions
Next we derive universal \textit{lower} bounds on the number of measurements that any binary matrix needs to have in order to satisfy the weaker sufficient condition based on the RNSP and show that bipartite graphs of girth six are optimal.
A Fast Noniterative Algorithm for Compressive Sensing Using Binary Measurement Matrices
In this paper we present a new algorithm for compressive sensing that makes use of binary measurement matrices and achieves exact recovery of ultra sparse vectors, in a single pass and without any iterations.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
