DocumentCode :
3159523
Title :
Random time-frequency subdictionary design for sparse representations with greedy algorithms
Author :
Moussallam, Manuel ; Daudet, Laurent ; Richard, Gaël
Author_Institution :
Inst. Telecom, Telecom ParisTech, Paris, France
fYear :
2012
fDate :
25-30 March 2012
Firstpage :
3577
Lastpage :
3580
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 :
audio coding; computational complexity; greedy algorithms; signal resolution; sparse matrices; audio signals; bit rate compression; bit-rate coding scheme; computational complexity; greedy algorithms; greedy decomposition process; nonadaptive random sequence; random time-frequency subdictionary design; sparse representations; sparse signal approximation; Abstracts; Tin; Transform coding; Matching Pursuits; Random Subdictionaries; Sparse Audio Coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech and Signal Processing (ICASSP), 2012 IEEE International Conference on
Conference_Location :
Kyoto
ISSN :
1520-6149
Print_ISBN :
978-1-4673-0045-2
Electronic_ISBN :
1520-6149
Type :
conf
DOI :
10.1109/ICASSP.2012.6288689
Filename :
6288689
Link To Document :
بازگشت