Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
From MaRDI portal
Publication:5281419
DOI10.1109/TIT.2010.2048466zbMath1366.62104OpenAlexW2127114523MaRDI QIDQ5281419
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2010.2048466
Directional data; spatial statistics (62H11) Ridge regression; shrinkage estimators (Lasso) (62J07) Random matrices (probabilistic aspects) (60B20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (16)
Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging ⋮ Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization ⋮ A hierarchical approach for sparse source blind signal separation problem ⋮ Unnamed Item ⋮ Fast overcomplete dictionary construction with probabilistic guarantees ⋮ NETT: solving inverse problems with deep neural networks ⋮ Average best \(m\)-term approximation ⋮ Convergence radius and sample complexity of ITKM algorithms for dictionary learning ⋮ Unnamed Item ⋮ An efficient algorithm for overcomplete sparsifying transform learning with signal denoising ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Lower Bounds for Sparse Coding ⋮ On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD ⋮ Compressed dictionary learning ⋮ Compressive sensing and neural networks from a statistical learning perspective ⋮ Multilinear Compressive Sensing and an Application to Convolutional Linear Networks
This page was built for publication: Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
