SCIENCE CHINA Information Sciences, Volume 64 , Issue 9 : 199101(2021) https://doi.org/10.1007/s11432-019-9945-2

Semi-blind compressed sensing via adaptive dictionary learning and one-pass online extension

More info
  • ReceivedJan 25, 2019
  • AcceptedJun 22, 2019
  • PublishedJul 17, 2020


There is no abstract available for this article.


This work was supported by Key Program of National Natural Science Foundation of China (Grant No. 61732006).


Appendixes A–C.


[1] Donoho D L. Compressed sensing. IEEE Trans Inform Theor, 2006, 52: 1289-1306 CrossRef Google Scholar

[2] Zhao J, Bai X, Tao R. Improved RIP-based performance guarantees for multipath matching pursuit. Sci China Inf Sci, 2018, 61: 102303 CrossRef Google Scholar

[3] Testa M, Magli E. Compressive Bayesian K-SVD. Signal Processing-Image Communication, 2018, 60: 1-5 CrossRef Google Scholar

[4] Gleichman S, Eldar Y C. Blind Compressed Sensing. IEEE Trans Inform Theor, 2011, 57: 6958-6975 CrossRef Google Scholar

[5] Serra J G, Testa M, Molina R. Bayesian K-SVD Using Fast Variational Inference. IEEE Trans Image Process, 2017, 26: 3344-3359 CrossRef PubMed ADS Google Scholar

[6] Aghagolzadeh M, Radha H. New guarantees for blind compressed sensing. In: Proceedings of the 53rd Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2015. 1227--1234. Google Scholar

[7] Ristin M, Guillaumin M, Gall J. Incremental Learning of Random Forests for Large-Scale Image Classification.. IEEE Trans Pattern Anal Mach Intell, 2016, 38: 490-503 CrossRef PubMed Google Scholar

[8] Beck A, Teboulle M. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems. SIAM J Imag Sci, 2009, 2: 183-202 CrossRef Google Scholar

[9] Gorski J, Pfeuffer F, Klamroth K. Biconvex sets and optimization with biconvex functions: a survey and extensions. Math Meth Oper Res, 2007, 66: 373-407 CrossRef Google Scholar

  • Figure 1

    (Color online) Illustration of the transition process from the prior sparsity basis ${\boldsymbol~D}_0$ to the task-dependent sparsity basis ${\boldsymbol~D}_T$. $\{\Delta{\boldsymbol~D}_t\}_{t=0}^{T-1}$ characterize the gradual transition between the dictionaries.


Contact and support