Compressed Sensing with Basis Mismatch: Performance Bounds and Sparse-Based Estimator

Compressed sensing (CS) is a promising emerging domain that outperforms the classical limit of the Shannon sampling theory if the measurement vector can be approximated as the linear combination of few basis vectors extracted from a redundant dictionary matrix. Unfortunately, in realistic scenario, the knowledge of this basis or equivalently of the entire dictionary is often uncertain, i.e., corrupted by a Basis Mismatch (BM) error. The consequence of the BM problem is that the estimation accuracy in terms of Bayesian Mean Square Error (BMSE) of popular sparse-based estimators collapses even if the support is perfectly estimated and in the high Signal to Noise Ratio (SNR) regime. This saturation effect considerably limits the effective viability of these estimation schemes. In the first part of this work, the Bayesian Cramer-Rao Bound (BCRB) is derived for CS model with unstructured BM. We show that the BCRB foresees the saturation effect of the estimation accuracy of standard sparse-based estimators as for instance the OMP, Cosamp or the BP. In addition, we provide an approximation of this BMSE threshold. In the second part and in the context of the structured BM model, a new estimation scheme called Bias-Correction Estimator (BiCE) is proposed and its statistical properties are studied. The BiCE acts as a post-processing estimation layer for any sparse-based estimator and mitigates considerably the BM degradation. Finally, the BiCE i) is a blind algorithm, i.e., is unaware of the uncorrupted dictionary matrix, ii) is generic since it can be associated to any sparse-based estimator, iii) is fast, i.e., the additional computational cost remains low, and iv) has good statistical properties. To illustrate our results and propositions, the BiCE is applied in the challenging context of the compressive sampling of non-bandlimited impulsive signals.