Iterative Bayesian Reconstruction of Non-IID Block-Sparse Signals

被引:30
作者
Korki, Mehdi [1 ]
Zhang, Jingxin [1 ]
Zhang, Cishen [1 ]
Zayyani, Hadi [2 ]
机构
[1] Swinburne Univ Technol, Dept Telecommun Elect Robot & Biomed Engn, Hawthorn, Vic 3122, Australia
[2] Qom Univ Technol, Dept Elect & Comp Engn, Qom 151937195, Iran
关键词
Block-sparse; iterative Bayesian algorithm; expectation-maximization; steepest-ascent; Bernoulli-Gaussian hidden Markov model; IMPULSIVE NOISE; RECOVERY; ALGORITHM; REPRESENTATIONS; MINIMIZATION; REGRESSION; SELECTION; PURSUIT;
D O I
10.1109/TSP.2016.2543208
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a novel Block Iterative Bayesian Algorithm (Block-IBA) for reconstructing block-sparse signals with unknown block structures. Unlike the existing algorithms for block sparse signal recovery which assume the clustered nonzero elements of the unknown signal to be independent and identically distributed (i.i.d.), we use a more adequate Bernoulli-Gaussian hidden Markov model (BGHMM) to characterize the non-i.i.d. block-sparse signals commonly encountered in practice. The Block-IBA iteratively estimates the amplitudes and positions of the block-sparse signal using the steepest-ascent based Expectation-Maximization, and effectively selects the nonzero elements of the block-sparse signal by a diminishing threshold. The global convergence of Block-IBA is analyzed and proved based on the non-i.i.d. property of BGHMM and error vector method. The effectiveness of Block-IBA is demonstrated by simulations on synthetic and real-life data.
引用
收藏
页码:3297 / 3307
页数:11
相关论文
共 40 条
  • [1] [Anonymous], 1987, Visual reconstruction
  • [2] [Anonymous], 2006, Journal of the Royal Statistical Society, Series B
  • [3] Model-Based Compressive Sensing
    Baraniuk, Richard G.
    Cevher, Volkan
    Duarte, Marco F.
    Hegde, Chinmay
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (04) : 1982 - 2001
  • [4] Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information
    Candès, EJ
    Romberg, J
    Tao, T
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) : 489 - 509
  • [5] Candès EJ, 2008, IEEE SIGNAL PROC MAG, V25, P21, DOI 10.1109/MSP.2007.914731
  • [6] Enhancing Sparsity by Reweighted l1 Minimization
    Candes, Emmanuel J.
    Wakin, Michael B.
    Boyd, Stephen P.
    [J]. JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, 2008, 14 (5-6) : 877 - 905
  • [7] Atomic decomposition by basis pursuit
    Chen, SSB
    Donoho, DL
    Saunders, MA
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) : 33 - 61
  • [8] Iteratively Reweighted Least Squares Minimization for Sparse Recovery
    Daubechies, Ingrid
    Devore, Ronald
    Fornasier, Massimo
    Guentuerk, C. Sinan
    [J]. COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2010, 63 (01) : 1 - 38
  • [9] For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution
    Donoho, DL
    [J]. COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (06) : 797 - 829
  • [10] Pattern-Coupled Sparse Bayesian Learning for Inverse Synthetic Aperture Radar Imaging
    Duan, Huiping
    Zhang, Lizao
    Fang, Jun
    Huang, Lei
    Li, Hongbin
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2015, 22 (11) : 1995 - 1999