The LOST algorithm: Finding lines and separating speech mixtures
From MaRDI portal
Recommendations
- Identifiability Conditions and Subspace Clustering in Sparse BSS
- Underdetermined blind source separation using sparse representations
- MAP-based underdetermined blind source separation of convolutive mixtures by hierarchical clustering and \(\ell _{1}\)-norm minimization
- A clustering approach for the blind separation of multiple finite alphabet sequences from a single linear mixture
- Blind signal separation of underdetermined mixtures based on clustering algorithms on planes
Cites work
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Atomic Decomposition by Basis Pursuit
- Blind Separation of Speech Mixtures via Time-Frequency Masking
- Blind source separation by sparse decomposition in a signal dictionary
- Independent component analysis, a new concept?
- MAP-based underdetermined blind source separation of convolutive mixtures by hierarchical clustering and \(\ell _{1}\)-norm minimization
- Underdetermined blind source separation in echoic environments using DESPRIT
- Underdetermined blind source separation using sparse representations
- Underdetermined blind sparse source separation for arbitrarily arranged multiple sensors
This page was built for publication: The LOST algorithm: Finding lines and separating speech mixtures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955360)
