Overcomplete blind source separation based on generalized Gaussian function and SL0 norm
From MaRDI portal
Publication:736930
DOI10.1007/s00034-014-9952-9zbMath1358.94032OpenAlexW1981914339MaRDI QIDQ736930
Rui Qi, Yu-Jie Zhang, Hong-Wei Li
Publication date: 5 August 2016
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-014-9952-9
sparse representationgeneralized Gaussian function (GGF)overcomplete blind source separationsmoothed \(l_0\) norm
Cites Work
- Unnamed Item
- K-hyperline clustering learning for sparse component analysis
- An algorithm for mixing matrix estimation in instantaneous blind source separation
- Blind Identification of Overcomplete MixturEs of sources (BIOME)
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Underdetermined Blind Source Separation Based on Subspace Representation
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- Analysis of Sparse Representation and Blind Source Separation
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Underdetermined blind source separation using sparse representations
This page was built for publication: Overcomplete blind source separation based on generalized Gaussian function and SL0 norm