Sensitivity to Basis Mismatch in Compressed Sensing

被引:671
|
作者
Chi, Yuejie [1 ]
Scharf, Louis L. [2 ,3 ]
Pezeshki, Ali [2 ,3 ]
Calderbank, A. Robert [4 ]
机构
[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[2] Colorado State Univ, Dept Elect & Comp Engn, Ft Collins, CO 80523 USA
[3] Colorado State Univ, Dept Stat, Ft Collins, CO 80523 USA
[4] Duke Univ, Dept Comp Sci, Durham, NC 27708 USA
基金
美国国家科学基金会;
关键词
Compressed sensing; image inversion; modal analysis; sensitivity to basis mismatch; sparse recovery; RESTRICTED ISOMETRY PROPERTY; PROJECTIONS; PARAMETERS; ESPRIT;
D O I
10.1109/TSP.2011.2112650
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The theory of compressed sensing suggests that successful inversion of an image of the physical world (broadly defined to include speech signals, radar/sonar returns, vibration records, sensor array snapshot vectors, 2-D images, and so on) for its source modes and amplitudes can be achieved at measurement dimensions far lower than what might be expected from the classical theories of spectrum or modal analysis, provided that the image is sparse in an apriori known basis. For imaging problems in spectrum analysis, and passive and active radar/sonar, this basis is usually taken to be a DFT basis. However, in reality no physical field is sparse in the DFT basis or in any apriori known basis. No matter how finely we grid the parameter space the sources may not lie in the center of the grid cells and consequently there is mismatch between the assumed and the actual bases for sparsity. In this paper, we study the sensitivity of compressed sensing to mismatch between the assumed and the actual sparsity bases. We start by analyzing the effect of basis mismatch on the best k-term approximation error, which is central to providing exact sparse recovery guarantees. We establish achievable bounds for the l(1) error of the best k-term approximation and show that these bounds grow linearly with the image (or grid) dimension and the mismatch level between the assumed and actual bases for sparsity. We then derive bounds, with similar growth behavior, for the basis pursuit l(1) recovery error, indicating that the sparse recovery may suffer large errors in the presence of basis mismatch. Although, we present our results in the context of basis pursuit, our analysis applies to any sparse recovery principle that relies on the accuracy of best k-term approximations for its performance guarantees. We particularly highlight the problematic nature of basis mismatch in Fourier imaging, where spillage from off-grid DFT components turns a sparse representation into an incompressible one. We substantiate our mathematical analysis by numerical examples that demonstrate a considerable performance degradation for image inversion from compressed sensing measurements in the presence of basis mismatch, for problem sizes common to radar and sonar.
引用
收藏
页码:2182 / 2195
页数:14
相关论文
共 50 条
  • [41] Matrix Optimization for Poisson Compressed Sensing
    Mordechay, Moran
    Schechner, Yoav Y.
    2014 IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (GLOBALSIP), 2014, : 684 - 688
  • [42] A geometrical stability condition for compressed sensing
    Flinth, Axel
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 504 : 406 - 432
  • [43] Semi-tensor compressed sensing
    Xie, Dong
    Peng, Haipeng
    Li, Lixiang
    Yang, Yixian
    DIGITAL SIGNAL PROCESSING, 2016, 58 : 85 - 92
  • [44] A Probabilistic and RIPless Theory of Compressed Sensing
    Candes, Emmanuel J.
    Plan, Yaniv
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (11) : 7235 - 7254
  • [45] An Improved Reweighted Method for Optimizing the Sensing Matrix of Compressed Sensing
    Shi, Lei
    Qu, Gangrong
    IEEE ACCESS, 2024, 12 : 50841 - 50848
  • [46] OAM-Basis Wavefront Single-Pixel Imaging via Compressed Sensing
    Gao, Lei
    Zhao, Wenjing
    Zhai, Aiping
    Wang, Dong
    JOURNAL OF LIGHTWAVE TECHNOLOGY, 2023, 41 (07) : 2131 - 2137
  • [47] Reducing Power Consumption in LNA by Utilizing EEG Signals as Basis Matrix in Compressed Sensing
    Matsubara, Riku
    Kanemoto, Daisuke
    Hirose, Tetsuya
    2024 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, ISCAS 2024, 2024,
  • [48] On the efficiency of the Orthogonal Matching Pursuit in compressed sensing
    Livshits, E. D.
    SBORNIK MATHEMATICS, 2012, 203 (02) : 183 - 195
  • [49] Sure independence screening and compressed random sensing
    Xue, Lingzhou
    Zou, Hui
    BIOMETRIKA, 2011, 98 (02) : 371 - 380
  • [50] Compressed Sensing of ΔΣ Streams
    Callegari, Sergio
    Mangia, Mauro
    Rovatti, Riccardo
    Setti, Gianluca
    2019 26TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS (ICECS), 2019, : 835 - 838