Source Recovery in Underdetermined Blind Source Separation Based on Artificial Neural Network

We propose a novel source recovery algorithm for underdetermined blind source separation, which can result in better accuracy and lower computational cost. On the basis of the model of underdetermined blind source separation, the artificial neural network with single-layer perceptron is introduced into the proposed algorithm. Source signals are regarded as the weight vector of single-layer perceptron, and approximate ι~0-norm is taken into account for output error decision rule of the perceptron, which leads to the sparse recovery. Then the procedure of source recovery is adjusting the weight vector of the perceptron. What's more, the optimal learning factor is calculated and a descent sequence of smoothed parameter is used during iteration, which improves the performance and significantly decreases computational complexity of the proposed algorithm. The simulation results reveal that the algorithm proposed can recover the source signal with high precision, while it requires lower computational cost.

Algorithm for source recovery in underdetermined blind source separation based on plane pursuit

In order to achieve accurate recovery signals under the underdetermined circumstance in a comparatively short time,an algorithm based on plane pursuit(PP) is proposed. The proposed algorithm selects the atoms according to the correlation between received signals and hyper planes, which are composed by column vectors of the mixing matrix, and uses these atoms to recover source signals. Simulation results demonstrate that the PP algorithm has low complexity and higher accuracy as compared with basic pursuit(BP), orthogonal matching pursuit(OMP), and adaptive sparsity matching pursuit(ASMP) algorithms.

Mixing matrix estimation of underdetermined blind source separation based on the linear aggregation characteristic of observation signals

Under the underdetermined blind sources separation(UBSS) circumstance,it is difficult to estimate the mixing matrix with high-precision because of unknown sparsity of signals.The mixing matrix estimation is proposed based on linear aggregation degree of signal scatter plot without knowing sparsity,and the linear aggregation degree evaluation of observed signals is presented which obeys generalized Gaussian distribution(GGD).Both the GGD shape parameter and the signals' correlation features affect the observation signals sparsity and further affected the directionality of time-frequency scatter plot.So a new mixing matrix estimation method is proposed for different sparsity degrees,which especially focuses on unclear directionality of scatter plot and weak linear aggregation degree.Firstly,the direction of coefficient scatter plot by time-frequency transform is improved and then the single source coefficients in the case of weak linear clustering is processed finally the improved K-means clustering is applied to achieve the estimation of mixing matrix.The proposed algorithm reduces the requirements of signals sparsity and independence,and the mixing matrix can be estimated with high accuracy.The simulation results show the feasibility and effectiveness of the algorithm.

Underdetermined DOA estimation and blind separation of non-disjoint sources in time-frequency domain based on sparse representation method

This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency （TF） disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation （BSS） and DOA estimation.

A robust clustering algorithm for underdetermined blind separation of sparse sources

In underdetermined blind source separation, more sources are to be estimated from less observed mixtures without knowing source signals and the mixing matrix. This paper presents a robust clustering algorithm for underdetermined blind separation of sparse sources with unknown number of sources in the presence of noise. It uses the robust competitive agglomeration （RCA） algorithm to estimate the source number and the mixing matrix, and the source signals then are recovered by using the interior point linear programming. Simulation results show good performance of the proposed algorithm for underdetermined blind sources separation （UBSS）.

UBSS and blind parameters estimation algorithms for synchronous orthogonal FH signals

By using the sparsity of frequency hopping（FH） signals,an underdetermined blind source separation（UBSS） algorithm is presented. Firstly, the short time Fourier transform（STFT） is performed on the mixed signals. Then, the mixing matrix, hopping frequencies, hopping instants and the hooping rate can be estimated by the K-means clustering algorithm. With the estimated mixing matrix, the directions of arrival（DOA） of source signals can be obtained. Then, the FH signals are sorted and the FH pattern is obtained. Finally, the shortest path algorithm is adopted to recover the time domain signals. Simulation results show that the correlation coefficient between the estimated FH signal and the source signal is above 0.9 when the signal-to-noise ratio（SNR） is higher than 0 d B and hopping parameters of multiple FH signals in the synchronous orthogonal FH network can be accurately estimated and sorted under the underdetermined conditions.