Pages that link to "Item:Q5281419"

The following pages link to Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization (Q5281419):

Displaying 16 items.

• A hierarchical approach for sparse source blind signal separation problem (Q336833) (← links)
• Average best \(m\)-term approximation (Q443892) (← links)
• 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)
• 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)
• Low Complexity Regularization of Linear Inverse Problems (Q2799919) (← links)
• Lower Bounds for Sparse Coding (Q2805739) (← links)
• Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization (Q3179269) (← links)
• Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging (Q3454501) (← links)
• (Q4558493) (← links)
• (Q4969112) (← links)
• Multilinear Compressive Sensing and an Application to Convolutional Linear Networks (Q5025785) (← links)
• NETT: solving inverse problems with deep neural networks (Q5113628) (← links)