Optimization algorithms for sparse representations and applications
From MaRDI portal
Recommendations
- Analysis of Sparse Representation and Blind Source Separation
- A bilinear algorithm for sparse representations
- Identifiability Conditions and Subspace Clustering in Sparse BSS
- Underdetermined blind source separation using sparse representations
- Mixture matrix identification of underdetermined blind source separation based on plane clustering algorithm
Cited in
(9)- K-hyperline clustering learning for sparse component analysis
- DC formulations and algorithms for sparse optimization problems
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- A bilinear algorithm for sparse representations
- Optimization techniques for data representations with biomedical applications
- Analysis of Sparse Representation and Blind Source Separation
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Independent Component Analysis and Blind Signal Separation
- Robust sparse component analysis based on a generalized Hough transform
This page was built for publication: Optimization algorithms for sparse representations and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5393828)
