Region-Based Relaxations To Accelerate Greedy Approaches

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...

Full description

Saved in:
Bibliographic Details
Published in2019 27th European Signal Processing Conference (EUSIPCO) pp. 1 - 5
Main Authors Dorffer, Clement, Herzet, Cedric, Dremeau, Angelique
Format Conference Proceeding
LanguageEnglish
Published EURASIP 01.09.2019
Subjects
atom selection
Atomic measurements
Complexity theory
Dictionaries
Europe
low-complexity methods
Signal processing
Signal processing algorithms
Sparse approximation
Upper bound
Online AccessGet full text

Cover

More Information
Summary: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 the standard "Gaussian deconvolution" problem show the computational gain induced by the proposed approach.
ISSN:2076-1465
DOI:10.23919/EUSIPCO.2019.8902669