A Comparison of Signal Compression Methods by Sparse Solution of Linear Systems

Authors:
Davide Mattera;Francesco Palmieri;Michele Di Monte
Affiliations:
-;-;-
Venue:
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
Year:
2002

Citing 4
Cited 0

Sparse Approximate Solutions to Linear Systems

SIAM Journal on Computing
Atomic Decomposition by Basis Pursuit

SIAM Journal on Scientific Computing
An affine scaling methodology for best basis selection

IEEE Transactions on Signal Processing
Optimized signal expansions for sparse representation

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper deals with the problem of signal compression by linearly expanding the signal to be compressed along the elements of an overcomplete dictionary. The compression is obtained by selecting a few elements of the dictionary for the expansion. Therefore, signal description is realized by specifying the selected elements of the dictionary as well as their coefficients in the linear expansion. A crucial issue in this approach is the algorithm for selecting, in correspondence of each realization of the signal, the elements of the dictionary to be used for the expansion. In this paper we consider different possible algorithms for basis selection and compare their performances in a practical case of speech signal.