SCIENCE CHINA Information Sciences, Volume 64 , Issue 11 : 219303(2021) https://doi.org/10.1007/s11432-020-3051-9

Two dimensional sparse signal reconstruction via 2D inverse-free sparse Bayesian learning

More info
  • ReceivedMar 26, 2020
  • AcceptedSep 1, 2020
  • PublishedOct 13, 2021


There is no abstract available for this article.


This work was supported by National Natural Science Foundation of China (Grant Nos. 61801484, 61921001) and China Postdoctoral Science Foundation (Grant No. 2019TQ0072)


[1] Huggins P S, Zucker S W. Greedy Basis Pursuit. IEEE Trans Signal Process, 2007, 55: 3760-3772 CrossRef ADS Google Scholar

[2] Tropp J A, Gilbert A C. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit. IEEE Trans Inform Theor, 2007, 53: 4655-4666 CrossRef Google Scholar

[3] 10.1162/15324430152748236. CrossRef Listing Deleted DOIs, 2000, 1 CrossRef Google Scholar

[4] Wipf D P, Rao B D. Sparse Bayesian Learning for Basis Selection. IEEE Trans Signal Process, 2004, 52: 2153-2164 CrossRef ADS Google Scholar

[5] Duan H, Yang L, Fang J. Fast Inverse-Free Sparse Bayesian Learning via Relaxed Evidence Lower Bound Maximization. IEEE Signal Process Lett, 2017, 24: 774-778 CrossRef ADS Google Scholar

[6] Ghaffari A, Babaie-Zadeh M, Jutten C. Sparse decomposition of two dimensional signals. In: Proceedings of 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, Taipei, 2009. 3157--3160. Google Scholar

[7] Mohimani H, Babaie-Zadeh M, Jutten C. A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell~^{0}$ Norm. IEEE Trans Signal Process, 2009, 57: 289-301 CrossRef ADS arXiv Google Scholar

  • Figure 1

    (Color online) Monte-Carlo experimental results. (a) Relative error versus $P$, (b) relative error versus SNR, and protectłinebreak (c) computational time versus $N$ of three algorithms.


Contact and support