Shift-invariant dictionary learning for sparse representations: extending K-SVD

Abstract : Shift-invariant dictionaries are generated by taking all the possible shifts of a few short patterns. They are helpful to represent long signals where the same pattern can appear several times at different positions. We present an algorithm that learns shift invariant dictionaries from long training signals. This algorithm is an extension of K-SVD. It alternates a sparse decomposition step and a dictionary update step. The update is more difficult in the shift-invariant case because of occurrences of the same pattern that overlap. We propose and evaluate an unbiased extension of the method used in K-SVD, i.e. a method able to exactly retrieve the original dictionary in a noiseless case.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download
Contributor : Boris Mailhé <>
Submitted on : Tuesday, January 6, 2009 - 10:11:51 AM
Last modification on : Thursday, June 27, 2019 - 12:22:15 PM
Long-term archiving on : Tuesday, June 8, 2010 - 6:36:14 PM


Files produced by the author(s)


  • HAL Id : hal-00350165, version 1


Boris Mailhé, Sylvain Lesage, Rémi Gribonval, Frédéric Bimbot, Pierre Vandergheynst. Shift-invariant dictionary learning for sparse representations: extending K-SVD. EUropean SIgnal Processing COnference (EUSIPCO'08), Aug 2008, Lausanne, Switzerland. 5 p. ⟨hal-00350165⟩



Record views


Files downloads