A first step to convolutive sparse representation

H. Firouzi (1) , Massoud Babaie-Zadeh (1) , A. Ghasemian Sahebi (1) , Christian Jutten (2)

1 EE department of SUT [Tehran] - Department of Electrical Engineering [Tehran]
2 GIPSA-SIGMAPHY - GIPSA - Signal Images Physique

In this paper an extension of the sparse decomposition problem is considered and an algorithm for solving it is presented. In this extension, it is known that one of the shifted versions of a signal X (not necessarily the original signal itself) has a sparse representation on an overcomplete dictionary, and we are looking for the sparsest representation among the representations of all the shifted versions of X. Then, the proposed algorithm finds simultaneously the amount of the required shift, and the sparse representation. Experimental results emphasize on the performance of our algorithm.

Mots clés: sparse representation; overcomplete signal representation; sparse source separation; sparse decomposition; atomic decomposition

Domaines: Traitement du signal et de l'image [eess.SP]; Traitement du signal et de l'image [eess.SP]

H. Firouzi, Massoud Babaie-Zadeh, A. Ghasemian Sahebi, Christian Jutten. A first step to convolutive sparse representation. ICASSP 2008 - IEEE International Conference on Acoustics, Speech and Signal Processing, Mar 2008, Las Vegas, Nevada, United States. pp.1921-1924. ⟨hal-00271358⟩