3,192 research outputs found
Compressed Sensing - A New mode of Measurement
After introducing the concept of compressed sensing as a complementary
measurement mode to the classical Shannon-Nyquist approach, I discuss some of
the drivers, potential challenges and obstacles to its implementation. I end with a
speculative attempt to embed compressed sensing as an enabling methodology
within the emergence of data-driven discovery. As a consequence I predict the
growth of non-nomological sciences where heuristic correlations will find
applications but often bypass conventional pure basic and use-inspired basic
research stages due to the lack of verifiable hypotheses
Deterministic Constructions of Binary Measurement Matrices from Finite Geometry
Deterministic constructions of measurement matrices in compressed sensing
(CS) are considered in this paper. The constructions are inspired by the recent
discovery of Dimakis, Smarandache and Vontobel which says that parity-check
matrices of good low-density parity-check (LDPC) codes can be used as
{provably} good measurement matrices for compressed sensing under
-minimization. The performance of the proposed binary measurement
matrices is mainly theoretically analyzed with the help of the analyzing
methods and results from (finite geometry) LDPC codes. Particularly, several
lower bounds of the spark (i.e., the smallest number of columns that are
linearly dependent, which totally characterizes the recovery performance of
-minimization) of general binary matrices and finite geometry matrices
are obtained and they improve the previously known results in most cases.
Simulation results show that the proposed matrices perform comparably to,
sometimes even better than, the corresponding Gaussian random matrices.
Moreover, the proposed matrices are sparse, binary, and most of them have
cyclic or quasi-cyclic structure, which will make the hardware realization
convenient and easy.Comment: 12 pages, 11 figure
- β¦