Sparse sensing for composite matched subspace detection

Abstract

In this paper, we propose sensor selection strategies, based on convex and greedy approaches, for designing sparse samplers for composite detection. Particularly, we focus our attention on sparse samplers for matched subspace detectors. Differently from previous works, that mostly rely on random matrices to perform compression of the sub-spaces, we show how deterministic samplers can be designed under a Neyman-Pearson-like setting when the generalized likelihood ratio test is used. For a less stringent case than the worst case design, we introduce a submodular cost that obtains comparable results with its convex counterpart, while having a linear time heuristic for its near optimal maximization.