arXiv · 1812.01932
Efficient atom selection strategy for iterative sparse approximations
Abstract
We propose a low-computational strategy for the efficient implementation of the "atom selection step" in sparse representation algorithms. The proposed procedure is based on simple tests enabling to identify subsets of atoms which cannot be selected. Our procedure applies on both discrete or continuous dictionaries. Experiments performed on DOA and Gaussian deconvolution problems show the computational gain induced by the proposed approach.
Explore related subjects
Keep this discovery
Clément Dorffer, Angélique Drémeau, Cedric Herzet. 2018-12-05. Efficient atom selection strategy for iterative sparse approximations. https://arxiv.org/abs/1812.01932
Cite the original work for its findings. Save a collection to share your selection of sources.