Pages that link to "Item:Q4569698"
From MaRDI portal
The following pages link to Dictionary Learning for Sparse Approximations With the Majorization Method (Q4569698):
Displaying 13 items.
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264) (← links)
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning (Q1748252) (← links)
- Structured overcomplete sparsifying transform learning with convergence guarantees and applications (Q1799975) (← links)
- Sparse and Spurious: Dictionary Learning With Noise and Outliers (Q2977139) (← links)
- Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging (Q3454501) (← links)
- Dictionary Learning for L1-Exact Sparse Coding (Q3608579) (← links)
- An MDL Framework for Sparse Coding and Dictionary Learning (Q4573755) (← links)
- Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model (Q4578387) (← links)
- An improved analysis of the ER-SpUD dictionary learning algorithm (Q4598183) (← links)
- Optimal dictionary for least squares representation (Q4637030) (← links)
- A tree-based dictionary learning framework (Q5137935) (← links)
- FRIST—flipping and rotation invariant sparsifying transform learning and applications (Q5348009) (← links)
- A Fast Algorithm for Learning Overcomplete Dictionary for Sparse Representation Based on Proximal Operators (Q5380322) (← links)
