MoTIF : an Efficient Algorithm for Learning Translation Invariant Dictionaries

Philippe Jost 1 Pierre Vandergheynst 1 Sylvain Lesage 2 Rémi Gribonval 2
2 METISS - Speech and sound data modeling and processing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : The performances of approximation using redundant expansions rely on having dictionaries adapted to the signals. In natural high-dimensional data, the statistical dependencies are, most of the time, not obvious. Learning fundamental patterns is an alternative to analytical design of bases and is nowadays a popular problem in the field of approximation theory. In many situations, the basis elements are shift invariant, thus the learning should try to find the best matching filters. We present a new algorithm for learning iteratively generating functions that can be translated at all positions in the signal to generate a highly redundant dictionary.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download
Contributor : Rémi Gribonval <>
Submitted on : Tuesday, February 8, 2011 - 9:23:58 PM
Last modification on : Friday, November 16, 2018 - 1:22:27 AM
Long-term archiving on : Monday, May 9, 2011 - 2:50:45 AM


Files produced by the author(s)



Philippe Jost, Pierre Vandergheynst, Sylvain Lesage, Rémi Gribonval. MoTIF : an Efficient Algorithm for Learning Translation Invariant Dictionaries. Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on, May 2006, Toulouse, France. pp.V -V, ⟨10.1109/ICASSP.2006.1661411⟩. ⟨inria-00544911⟩



Record views


Files downloads