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. Due to its noniterative nature, our algorithm is hundreds of times faster than $\ell_1$-norm minimization, and methods based on expander graphs, both of which require multiple iterations. Our algorithm can accommodate nearly sparse vectors, in which case it recovers index set of the largest components, and can also accommodate burst noise measurements. Compared to compressive sensing methods that are guaranteed to achieve exact recovery of all sparse vectors, our method requires fewer measurements However, methods that achieve statistical recovery, that is, recovery of almost all but not all sparse vectors, can require fewer measurements than our method.
Code (0)
등록된 구현이 없습니다.
Tasks
AllCompressive SensingSimilar Papers 제목 키워드 기반
Robust Binary Fused Compressive Sensing using Adaptive Outlier Pursuit
We propose a new method, {\it robust binary fused compressive sensing} (RoBFCS), to recover sparse piece-wise smooth signals from 1-bit compressive measurements. The proposed method is a modification of our previous {\it…
Compressive SensingBinary Fused Compressive Sensing: 1-Bit Compressive Sensing meets Group Sparsity
We propose a new method, {\it binary fused compressive sensing} (BFCS), to recover sparse piece-wise smooth signals from 1-bit compressive measurements. The proposed algorithm is a modification of the previous {\it binar…
Compressive SensingDeepBinaryMask: Learning a Binary Mask for Video Compressive Sensing
In this paper, we propose a novel encoder-decoder neural network model referred to as DeepBinaryMask for video compressive sensing. In video compressive sensing one frame is acquired using a set of coded masks (sensing m…
Compressive SensingDecoderVideo Compressive SensingVideo ReconstructionBinary Compressive Sensing via Smoothed $\ell_0$ Gradient Descent
We present a Compressive Sensing algorithm for reconstructing binary signals from its linear measurements. The proposed algorithm minimizes a non-convex cost function expressed as a weighted sum of smoothed $\ell_0$ norm…
Compressive SensingSample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors
The goal of standard 1-bit compressive sensing is to accurately recover an unknown sparse vector from binary-valued measurements, each indicating the sign of a linear function of the vector. Motivated by recent advances …
Compressive Sensing