Submodular Sparse Sensing for Gaussian Detection With Correlated Observations

DOI10.1109/TSP.2018.2846220MaRDI QIDQ4622298zbMATH OpenFDO

Authors Mario Coutino, Sundeep Prabhakar Chepuri, G. Leus

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.09676

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Detection of a signal under noise is a classical signal processing problem. When monitoring spatial phenomena under a fixed budget, i.e., either physical, economical or computational constraints, the selection of a subset of available sensors, referred to as sparse sensing, that meets both the budget and performance requirements is highly desirable. Unfortunately, the subset selection problem for detection under dependent observations is combinatorial in nature and suboptimal subset selection algorithms must be employed. In this work, different from the widely used convex relaxation of the problem, we leverage submodularity, the diminishing returns property, to provide practical near optimal algorithms suitable for large-scale subset selection. This is achieved by means of low-complexity greedy algorithms, which incur a reduced computational complexity compared to their convex counterparts.

This page was built for publication: Submodular Sparse Sensing for Gaussian Detection With Correlated Observations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622298)