New one-bit compressed sensing schemes recover the support of k-sparse signals with near-optimal measurements and sublinear decoding time via group testing adaptations.
A fast binary splitting appro ach to non-adaptive group testing
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2verdicts
UNVERDICTED 2representative citing papers
Derives improved probabilistic lower bounds on rates of d-SM, bar d-SM, (d, n^{1/d})-LDSM and (bar d, n^{1/d})-LDSM for d >= 3.
citing papers explorer
-
Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
New one-bit compressed sensing schemes recover the support of k-sparse signals with near-optimal measurements and sublinear decoding time via group testing adaptations.
-
Improved Probabilistic Lower Bounds for Separable Matrices
Derives improved probabilistic lower bounds on rates of d-SM, bar d-SM, (d, n^{1/d})-LDSM and (bar d, n^{1/d})-LDSM for d >= 3.