2020
A Greedy Sparse Approximation Algorithm Based On L1-Norm Selection Rules
ICASSP 2020accepted
We propose a new greedy sparse approximation algorithm, called SLS for Single L1 Selection, that addresses a least squares optimization problem under a cardinality constraint. The specificity and increased efficiency of SLS originate from the atom selection step, based on exploiting ℓ <sub xmlns:mml…