Sequential Sensing with Model Mismatch
arXiv:1501.06241 · doi:10.1109/ISIT.2015.7282736
Abstract
We characterize the performance of sequential information guided sensing, Info-Greedy Sensing, when there is a mismatch between the true signal model and the assumed model, which may be a sample estimate. In particular, we consider a setup where the signal is low-rank Gaussian and the measurements are taken in the directions of eigenvectors of the covariance matrix in a decreasing order of eigenvalues. We establish a set of performance bounds when a mismatched covariance matrix is used, in terms of the gap of signal posterior entropy, as well as the additional amount of power required to achieve the same signal recovery precision. Based on this, we further study how to choose an initialization for Info-Greedy Sensing using the sample covariance matrix, or using an efficient covariance sketching scheme.
arXiv commentSubmitted to IEEE for publication
References in corpus (7)
- Sequential Compressed Sensing
- Task-Driven Adaptive Statistical Compressive Sensing of Gaussian Mixture Models
- Exact and Stable Covariance Estimation from Quadratic Sampling via Convex Programming
- A short note on the tail bound of Wishart distribution
- Adaptive Sensing for Estimation of Structured Sparse Signals
- Compressive binary search
- Scalable multiscale density estimation