  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.
