Pages that link to "Item:Q5025788"
From MaRDI portal
The following pages link to Identifiability of Complete Dictionary Learning (Q5025788):
Displaying 4 items.
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264) (← links)
- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms (Q4999395) (← links)
- $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials (Q5088657) (← links)
- Identification and Lossy Reconstruction in Noisy Databases (Q5346095) (← links)