A fast global matching pursuit algorithm for sparse reconstruction by $$l_{0}$$ minimization
Crossref DOI link: https://doi.org/10.1007/s11760-019-01555-9
Published Online: 2019-08-26
Published Print: 2020-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Li, Dan
Wu, Zhaojun
Funding for this research was provided by:
National Natural Science Foundation of China (61801214)
Text and Data Mining valid from 2019-08-26
Version of Record valid from 2019-08-26
Article History
Received: 1 March 2019
Revised: 21 June 2019
Accepted: 19 August 2019
First Online: 26 August 2019