A First Step to Convolutive Sparse Representation

Simple item page
dc.creatorFirouzi, Hamed
dc.creatorBabaie-Zadeh, Massoud
dc.creatorGhasemian, Aria
dc.creatorJutten, Christian
dc.date2008-09-20
dc.date.accessioned2026-07-07T10:04:15Z
dc.date.available2026-07-07T10:04:15Z
dc.descriptionIn 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 s (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 s. 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.
dc.description4 Pages-In Proceeding of ICASSP 2008
dc.identifierhttps://arxiv.org/abs/0809.3485
dc.identifierhttp://arxiv.org/abs/0809.3485
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/169604
dc.subjectMultimedia
dc.subjectOther Computer Science
dc.titleA First Step to Convolutive Sparse Representation
dc.typetext

Files

Collections

arXiv