Dictionary Identification - Sparse Matrix-Factorisation via $\ell_1$-Minimisation

Probability inequalities for the sum of independent random variables

G. Bennett · 1962

Earlier work this paper cites.

Entropy-based algorithms for best basis selection

R. Coifman and M.V. Wickerhauser · 1992

Earlier work this paper cites.

Independent component analysis, a new concept?

P. Comon · 1994

Earlier work this paper cites.

Sparse approximate solutions to linear systems

B. Natarajan · 1995

Earlier work this paper cites.

Emergence of simple-cell receptive field properties by learning a sparse code for natural images

D. J. Field and B. A. Olshausen · 1996

Earlier work this paper cites.

Adaptive greedy approximations

G. Davis, S. Mallat, and M. Avellaneda · 1997

Earlier work this paper cites.

Extension of the pisarenko method to sparse linear arrays

J. J. Fuchs · 1997

Earlier work this paper cites.

Blind signal separation: statistical principles

J.-F. Cardoso · 1998

Earlier work this paper cites.

G. Pisier, The volume of convex bodies and Banach space geometry, 2nd edition, Cambridge University Press

1999

Earlier work this paper cites.

Uncertainty principles and ideal atomic decompositions

D. L. Donoho and X. Huo · 2001

Earlier work this paper cites.

Blind source separation by sparse decomposition in a signal dictionary

M. Zibulevsky and B. A. Pearlmutter · 2001

Cited alongside, same era.

Optimally sparse representation in general (non-orthogonal) dictionaries via ℓ 1 \ell_{1} minimization

D. Donoho and M. Elad · 2003

Cited alongside, same era.

Sparse representations in unions of bases

R. Gribonval and M. Nielsen · 2003

Cited alongside, same era.

Dictionary learning algorithms for sparse representation

K. Kreutz-Delgado, J.F. Murray, B.D. Rao, K. Engan, T. Lee, and Sejnowski T.J · 2003

Cited alongside, same era.

Greed is good: Algorithmic results for sparse approximation

J. Tropp · 2004

Cited alongside, same era.

Stable signal recovery from incomplete and inaccurate measurements

E. Candès, J. Romberg, and T. Tao · 2005

Cited alongside, same era.

On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them

M. Aharon, M. Elad, and A.M. Bruckstein · 2006

Later among the works it cites.

Motif: An efficient algorithm for learning translation invariant dictionaries

P. Jost, S. Lesage, P. Vandergheynst, and R. Gribonval · 2006

Later among the works it cites.

Linear program differentiation for single-channel speech separation

B. A. Pearlmutter and R. K. Olsson · 2006

Later among the works it cites.

Just relax: Convex programming methods for subset selection and sparse approximation

J. Tropp · 2006

Later among the works it cites.

Dictionary learning for ℓ 1 \ell_{1} -exact sparse coding

M.D. Plumbley · 2007

Later among the works it cites.

Uniform uncertainty principle for Bernoulli and subgaussian ensembles

S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann · 2008