Measurement design for detecting sparse signals

We consider the problem of testing for the presence (or detection) of an unknown sparse signal in additive white noise. Given a fixed measurement budget, much smaller than the dimension of the signal, we consider the general problem of designing compressive measurements to maximize the measurement signal-to-noise ratio (SNR), as increasing SNR improves the detection performance in a large class of detectors. We use a lexicographic optimization   approach, where the optimal measurement design for sparsity level kk is sought only among the set of measurement matrices that satisfy the optimality conditions for sparsity level k−1k−1. We consider optimizing two different SNR criteria, namely a worst-case SNR measure, over all possible realizations of a kk-sparse signal, and an average SNR measure with respect to a uniform distribution on the locations of up to kk nonzero entries in the signal. We establish connections between these two criteria and certain classes of tight frames. We constrain our measurement matrices to the class of tight frames to avoid coloring the noise covariance matrix. For the worst-case problem, we show that the optimal measurement matrix is a Grassmannian line packing for most–and a uniform tight frame for all–sparse signals. For the average SNR problem, we prove that the optimal measurement matrix is a uniform tight frame with minimum sum-coherence for most–and a tight frame for all–sparse signals.