TY - CPAPER
AB - This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via $\ell_1$ minimisation. The problem is to identify a dictionary $\dico$ from a set of training samples $\Y$ knowing that $\Y = \dico \X$ for some coefficient matrix $\X$. Using a characterisation of coefficient matrices $\X$ that allow to recover any basis as a local minimum of an $\ell_1$ minimisation problem, it is shown that certain types of sparse random coefficient matrices will ensure local identifiability of the basis with high probability. The necessary number of training samples grows up to a logarithmic factor linearly with the signal dimension.
T1 - Basis Identification from Random Sparse Samples
DA - 2009
AU - Gribonval, Remi
AU - Schnass, Karin
JF - Proc. SPARS09
PP - Saint-Malo
ID - 134108
KW - basis identification
KW - $\ell_1$ minimisation
KW - sparse samples
KW - LTS2
KW - lts2
UR - http://spars09.inria.fr/ENGLISH/ENGLISH%20INDEX/welcome1.html
UR - http://infoscience.epfl.ch/record/134108/files/spars09-56.pdf
ER -