Random time-frequency Subdictionary design for sparse representation with greedy algorithmsReport as inadecuate




Random time-frequency Subdictionary design for sparse representation with greedy algorithms - Download this document for free, or read online. Document in PDF available to download.

1 LTCI - Laboratoire Traitement et Communication de l-Information 2 LOA - Laboratoire ondes et acoustique

Abstract : Sparse signal approximation can be used to design efficient low bit-rate coding schemes. It heavily relies on the ability to design appropriate dictionaries and corresponding decomposition algorithms. The size of the dictionary, and therefore its resolution, is a key parameter that handles the tradeoff between sparsity and tractability. This work proposes the use of a non adaptive random sequence of subdictionaries in a greedy decomposition process, thus browsing a larger dictionary space in a probabilistic fashion with no additional projection cost nor parameter estimation. This technique leads to very sparse decompositions, at a controlled computational complexity. Experimental evaluation is provided as proof of concept for low bit rate compression of audio signals.

Keywords : Sparse Representation Greedy Algorithm Random Matching Pursuit





Author: Manuel Moussallam - Laurent Daudet - Gaël Richard -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents