A first step to convolutive sparse representation

Abstract : 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.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00271358
Contributor : Christian Jutten <>
Submitted on : Tuesday, April 8, 2008 - 7:14:30 PM
Last modification on : Monday, July 8, 2019 - 3:09:09 PM
Long-term archiving on : Friday, May 21, 2010 - 1:31:15 AM

File

Firouzi-Icassp.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00271358, version 1

Citation

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

Share

Metrics

Record views

357

Files downloads

102