Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions
نویسندگان
چکیده
منابع مشابه
Near-optimal Binary Compressed Sensing Matrix
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. Considerin...
متن کاملCompressed Sensing with Sparse Binary Matrices: Instance Optimal Error Guarantees in Near-Optimal Time
A compressed sensing method consists of a rectangular measurement matrix, M ∈ R m×N with m ≪ N , together with an associated recovery algorithm, A : R → R . Compressed sensing methods aim to construct a high quality approximation to any given input vector x ∈ R using onlyMx ∈ R as input. In particular, we focus herein on instance optimal nonlinear approximation error bounds for M and A of the f...
متن کاملFast binary embeddings, and quantized compressed sensing with structured matrices
This paper deals with two related problems, namely distance-preserving binary embeddings and quantization for compressed sensing . First, we propose fast methods to replace points from a subset X ⊂ Rn, associated with the Euclidean metric, with points in the cube {±1}m and we associate the cube with a pseudo-metric that approximates Euclidean distance among points in X . Our methods rely on qua...
متن کاملAdaptive Compressed Sensing Using Sparse Measurement Matrices
Compressed sensing methods using sparse measurement matrices and iterative message-passing recovery procedures are recently investigated due to their low computational complexity and excellent performance. The design and analysis of this class of methods is inspired by a large volume of work on sparsegraph codes such as Low-Density Parity-Check (LDPC) codes and the iterative Belief-Propagation ...
متن کاملSemi-Universal Convolutional Compressed Sensing Using (Nearly) Perfect Sequences
In this paper, a new class of circulant matrices for compressed sensing are proposed by introducing nearly perfect sequences into the random convolution framework. Measurements are obtained by circularly convolving the signal not with a random sequence, but with a well-designed deterministic sequence, followed by random subsampling. Both uniform recovery and non-uniform recovery of sparse signa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2020
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2020.2990154