DeepAI AI Chat
Log In Sign Up

Covering point-sets with parallel hyperplanes and sparse signal recovery

by   Lenny Fukshansky, et al.
Claremont McKenna College

Let S be a set of k > n points in a Euclidean space R^n, n ≥ 1. How many parallel hyperplanes are needed to cover the set S? We prove that any such set can covered by k-n+1 hyperplanes and construct examples of sets that cannot be covered by fewer parallel hyperplanes. We then demonstrate a construction of a family of n × d integer matrices from difference vectors of such point-sets, d ≥ n, with bounded sup-norm and the property that no ℓ column vectors are linearly dependent, ℓ≤ n. Further, if ℓ≤ (log n)^1-ε for any ε > 0, then d/n →∞ as n →∞. This is an explicit construction of a family of sensing matrices, which are used for sparse recovery of integer-valued signals in compressed sensing.


page 1

page 2

page 3

page 4


Superset Technique for Approximate Recovery in One-Bit Compressed Sensing

One-bit compressed sensing (1bCS) is a method of signal acquisition unde...

Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-rank Matrices

This paper considers compressed sensing and affine rank minimization in ...

K_1,3-covering red and blue points in the plane

We say that a finite set of red and blue points in the plane in general ...

Robust Sparse Recovery with Sparse Bernoulli matrices via Expanders

Sparse binary matrices are of great interest in the field of compressed ...

IRLS for Sparse Recovery Revisited: Examples of Failure and a Remedy

Compressed sensing is a central topic in signal processing with myriad a...

On the construction of sparse matrices from expander graphs

We revisit the asymptotic analysis of probabilistic construction of adja...