On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying K-SVD

DMCA

On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying K-SVD (2013)

Cached

Download Links

[arxiv.org]

by Karin Schnass

Citations:

8 - 1 self

Citations

3581	Compressed sensing - Donoho - 2006
2695	Atomic decomposition by basis pursuit - Chen, Donoho, et al. - 1998
2591	Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information - Candes, Romberg, et al.
1298	Emergence of simple-cell receptive field properties by learning a sparse code for natural images - Olshausen, Field - 1996
926	K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation - Aharon, Elad, et al. - 2006
904	Greed is good: Algorithmic results for sparse approximation - Tropp - 2004
760	Cosamp: iterative signal recovery from incomplete and inaccurate samples - Needell, Tropp
458	Stable recovery of sparse overcomplete representations in the presence of noise - Donoho, Elad, et al.
347	Introduction to the non-asymptotic analysis of random matrices - Vershynin - 2012
332	Probability in Banach spaces: Isoperimetry and processes. Series of modern surveys in mathematics - Ledoux, Talagrand - 2010
272	Blind source separation by sparse decomposition in a signal dictionary - Zibulevsky, Pearlmutter - 2001
200	Fast discrete curvelet transforms”, Multiscale Modelling and Simulation - Candès, Demanet, et al. - 2005
187	Adaptive greedy approximations - Davis, Mallat, et al. - 1997
185	An Introduction to Frames and Riesz Bases (Birkh• auser, - Christensen - 2003
183	Dictionary learning algorithms for sparse representation - Kreutz-Delgado, Murray, et al.
151	Iteratively reweighted least squares minimization for sparse recovery - Daubechies, DeVore, et al.
150	Iterative thresholding for sparse approximations - Blumensath, Davies - 2008
107	Dictionaries for Sparse Representation Modeling - Rubinstein, Bruckstein, et al.
93	On the conditioning of random subdictionaries - Tropp
85	Task-driven dictionary learning - Mairal, Bach, et al. - 2012
81	Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms - Gribonval, Rauhut, et al.
74	Sparse component analysis and blind source separation of underdetermined mixtures - Georgiev, Theis, et al. - 2005
52	On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them - Aharon, Elad, et al.
47	Dictionary learning for sparse approximations with majorization method - Yaghoobi, Blumensath, et al. - 2009
25	Average performance analysis for thresholding - Schnass, Vandergheynst - 2007
23	Recursive least squares dictionary learning algorithm - Skretting, Engan
19	Local stability and robustness of sparse dictionary learning in the presence of noise - Jenatton, Gribonval, et al. - 2012
15	FOCUSS-based dictionary learning algorithms - Kreutz-Delgado, Rao - 2000
8	On the local correctness of `1 minimization for dictionary learning,” arXiv - Geng, Wang, et al. - 2011
5	Dictionary identifiability - sparse matrix-factorisation via l1-minimisation - Gribonval, Schnass - 2010
2	Dictionary learning for `1-exact sparse coding - Plumbley - 2007
1	Compressive sensing resources. http://www.compressedsensing.com - University
1	Average best m-term approximation - Vybı́ral - 2012