Near-optimal Binary Compressed Sensing Matrix
arXiv:1304.4071
Abstract
Compressed sensing is a promising technique that attempts to faithfully recover sparse signal with as few linear and nonadaptive measurements as possible. Its performance is largely determined by the characteristic of sensing matrix. Recently several zero-one binary sensing matrices have been deterministically constructed for their relative low complexity and competitive performance. Considering the complexity of implementation, it is of great practical interest if one could further improve the sparsity of binary matrix without performance loss. Based on the study of restricted isometry property (RIP), this paper proposes the near-optimal binary sensing matrix, which guarantees nearly the best performance with as sparse distribution as possible. The proposed near-optimal binary matrix can be deterministically constructed with progressive edge-growth (PEG) algorithm. Its performance is confirmed with extensive simulations.
References in corpus (5)
- Construction of a Large Class of Deterministic Sensing Matrices that Satisfy a Statistical Isometry Property
- LDPC Codes for Compressed Sensing
- Cavity approach to the first eigenvalue problem in a family of symmetric random sparse matrices
- The statistical restricted isometry property and the Wigner semicircle distribution of incoherent dictionaries
- Sparse Vector Distributions and Recovery from Compressed Sensing