Random time-frequency Subdictionary design for sparse representation with greedy algorithms

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.

Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal-imt.archives-ouvertes.fr/hal-00696187
Contributor : Admin Télécom Paristech <>
Submitted on : Friday, May 11, 2012 - 1:19:54 PM
Last modification on : Thursday, July 4, 2019 - 11:00:03 AM
Long-term archiving on : Sunday, August 12, 2012 - 2:22:17 AM

File

moussall_icassp12.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00696187, version 1

Citation

Manuel Moussallam, Laurent Daudet, Gaël Richard. Random time-frequency Subdictionary design for sparse representation with greedy algorithms. ICASSP, Mar 2012, Kyoto, Japan. pp.3577-3580. ⟨hal-00696187⟩

Share

Metrics

Record views

411

Files downloads

147