Pages that link to "Item:Q741264"
From MaRDI portal
The following pages link to On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264):
Displaying 9 items.
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264) (← links)
- Learning semidefinite regularizers (Q1740575) (← links)
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning (Q1748252) (← links)
- Customized dictionary learning for subdatasets with fine granularity (Q1793292) (← links)
- An efficient algorithm for overcomplete sparsifying transform learning with signal denoising (Q1793434) (← links)
- Compressive sensing and neural networks from a statistical learning perspective (Q2106482) (← links)
- Fast overcomplete dictionary construction with probabilistic guarantees (Q2198175) (← links)
- Compressed dictionary learning (Q2310825) (← links)
- Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization (Q3179269) (← links)
