On Selection of Search Space Dimension in Compressive Sampling Matching Pursuit

被引:0
|
作者
Ambat, Sooraj K. [1 ]
Chatterjee, Saikat [2 ]
Hari, K. V. S. [1 ]
机构
[1] Indian Inst Sci, Dept Elect Commun Engg, Stat Signal Proc Lab, Bangalore 560012, Karnataka, India
[2] KTH Royal Inst Technol, Sch Elect Engn, Commun Theory Lab, S-10044 Stockholm, Sweden
关键词
Compressed sensing; Sparse Recovery; Greedy Pursuit Algorithms; SIGNAL RECOVERY; RECONSTRUCTION;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Compressive Sampling Matching Pursuit (CoSaMP) is one of the popular greedy methods in the emerging field of Compressed Sensing (CS). In addition to the appealing empirical performance, CoSaMP has also splendid theoretical guarantees for convergence. In this paper, we propose a modification in CoSaMP to adaptively choose the dimension of search space in each iteration, using a threshold based approach. Using Monte Carlo simulations, we show that this modification improves the reconstruction capability of the CoSaMP algorithm in clean as well as noisy measurement cases. From empirical observations, we also propose an optimum value for the threshold to use in applications.
引用
收藏
页数:5
相关论文
共 50 条
  • [21] A dual-mesh microwave reconstruction method based on compressive sampling matching pursuit algorithm
    Zhou H.
    Narayanan R.M.
    Progress in Electromagnetics Research, 2019, 166 : 43 - 57
  • [22] BI-CosampSE: Block Identification based Compressive Sampling Matching Pursuit for Speech Enhancement
    Wu, Dalei
    Zhu, Wei-ping
    Swamy, M. N. S.
    CONFERENCE RECORD OF THE 2014 FORTY-EIGHTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, 2014, : 1396 - 1399
  • [23] MATCHING PURSUIT WITH STOCHASTIC SELECTION
    Peel, Thomas
    Emiya, Valentin
    Ralaivola, Liva
    Anthoine, Sandrine
    2012 PROCEEDINGS OF THE 20TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO), 2012, : 879 - 883
  • [24] ONLINE SEARCH ORTHOGONAL MATCHING PURSUIT
    Weinstein, Alejandro J.
    Wakin, Michael B.
    2012 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP (SSP), 2012, : 584 - 587
  • [25] Tree structure search for matching pursuit
    Shoa, A
    Shirani, S
    2005 International Conference on Image Processing (ICIP), Vols 1-5, 2005, : 2821 - 2824
  • [26] MULTI-TARGET LOCALIZATION IN UNDERWATER ACOUSTIC SENSOR NETWORKS BASED ON COMPRESSIVE SAMPLING MATCHING PURSUIT
    Wang, Biao
    Zhu, Zhihui
    Ge, Huilin
    Dai, Yuewei
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2014, 10 (06): : 2167 - 2177
  • [27] A Novel Data Compression Methodology Focused on Power Quality Signals Using Compressive Sampling Matching Pursuit
    Ruiz, Milton
    Jaramillo, Manuel
    Aguila, Alexander
    Ortiz, Leony
    Varela, Silvana
    ENERGIES, 2022, 15 (24)
  • [28] Cryptography With Compressive Sensing Orthogonal Matching Pursuit Method
    Atar, Ertan
    Ersoy, Okan K.
    Ozyilmaz, Lale
    2015 23RD SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2015, : 216 - 219
  • [29] GPU Implementation of Orthogonal Matching Pursuit for Compressive Sensing
    Fang, Yong
    Chen, Liang
    Wu, Jiaji
    Huang, Bormin
    2011 IEEE 17TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2011, : 1044 - 1047
  • [30] A sparsity adaptive subspace pursuit algorithm for compressive sampling
    Yang, Cheng
    Feng, Wei
    Feng, Hui
    Yang, Tao
    Hu, Bo
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2010, 38 (08): : 1914 - 1917