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.
| Original language | English (US) |
|---|---|
| Title of host publication | 2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP) |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Pages | 1-5 |
| Number of pages | 5 |
| ISBN (Print) | 9781538612514 |
| DOIs | |
| State | Published - Mar 12 2018 |
| Externally published | Yes |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledged KAUST grant number(s): OSR-2015-Sensors-2700
Acknowledgements: This research is supported in part by the ASPIRE project (project 14926 within the STWOTP programme), financed by the Netherlands Organization for Scientific Research (NWO), and the KAUST-MIT-TUD consortium under grant OSR-2015-Sensors-2700. Mario Coutino is partially supported by CONACYT.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.