Crossmark

A new greedy sparse recovery algorithm for fast solving sparse representation

Crossref DOI link: https://doi.org/10.1007/s00371-021-02121-6

Published Online: 2021-04-17

Published Print: 2022-07

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Bannour Lahaw, Zied https://orcid.org/0000-0002-8302-6139
Seddik, Hassene
License Information

Text and Data Mining valid from 2021-04-17

Version of Record valid from 2021-04-17
More Information

Article History

Accepted: 22 March 2021

First Online: 17 April 2021

Declarations

:

: The authors declare that they have no competing interests.