A robust algorithm for automatic extraction of an unknown number of clusters from noisy data
Pattern Recognition Letters
Pattern Recognition Letters
A Similarity-Based Robust Clustering Method
IEEE Transactions on Pattern Analysis and Machine Intelligence
Identifying Single Source Data for Mixing Matrix Estimation in Instantaneous Blind Source Separation
ICANN '08 Proceedings of the 18th international conference on Artificial Neural Networks, Part I
K-hyperline clustering learning for sparse component analysis
Signal Processing
Underdetermined blind source separation based on subspace representation
IEEE Transactions on Signal Processing
-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
IEEE Transactions on Signal Processing
Underdetermined Blind Separation of Nondisjoint Sources in the Time-Frequency Domain
IEEE Transactions on Signal Processing
Underdetermined blind source separation based on sparse representation
IEEE Transactions on Signal Processing
Survey of clustering algorithms
IEEE Transactions on Neural Networks
Sparse component analysis and blind source separation of underdetermined mixtures
IEEE Transactions on Neural Networks
Mixing Matrix Estimation From Sparse Mixtures With Unknown Number of Sources
IEEE Transactions on Neural Networks
A fast mixing matrix estimation method in the wavelet domain
Signal Processing
Hi-index | 0.01 |
This paper considers the problem of mixing matrix estimation in underdetermined blind source separation (UBSS). We propose a simple and effective detection algorithm which detects the time-frequency (TF) points occupied by only a single source for each source. The detection algorithm identifies the single source points by comparing the normalized real and imaginary parts of the TF coefficient vectors of the mixed signals, which is simpler than previously reported algorithms. Then we propose a modified similarity-based robust clustering method (MSCM) to estimate the number of sources and the mixing matrix using these detected single source points. Experimental results show the efficiency of the proposed algorithm, especially in the cases where the number of sources is unknown.