Underdetermined blind signal separation with smooth approximation function for insufficiently sparse sources
From MaRDI portal
Cites work
- A time-frequency blind signal separation method applicable to underdetermined mixtures of dependent sources
- An algorithm for mixing matrix estimation in instantaneous blind source separation
- An improved underdetermined blind source separation method for insufficiently sparse sources
- Estimation of Basis Frequencies for Time-Varying SIMO Channels: A Second-Order Method
- Finite-Time Distributed Linear Equation Solver for Solutions With Minimum $l_1$-Norm
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Independent component analysis, a new concept?
- Large-scale non-negative subspace clustering based on Nyström approximation
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Nonorthogonal Joint Diagonalization/Zero Diagonalization for Source Separation Based on Time-Frequency Distributions
- On the entropic regularization method for solving min-max problems with applications
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Underdetermined Blind Separation of Nondisjoint Sources in the Time-Frequency Domain
- Underdetermined Blind Source Separation Based on Relaxed Sparsity Condition of Sources
- Underdetermined blind source separation based on sparse representation
This page was built for publication: Underdetermined blind signal separation with smooth approximation function for insufficiently sparse sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6900166)
