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）.

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.

基于UBSS算法的电力系统低频振荡辨识方法

低频振荡监测和分析对电力系统故障诊断和电网恢复至关重要。该文提出一种基于欠定盲源分离原理的低频振荡模式辨识方法,包括欠定盲源分离(underdetermined blind source separation,UBSS)和希尔伯特变换(Hilbert transform,HT)。首次系统地提出并论证含欠定盲源分离、模式定阶和振荡参数的辨识方法。提出的UBSS-HT方法利用能量比函数确定故障时刻,利用贝叶斯信息准则(Bayesian information criterion,BIC)实现模式定阶,阐述维度空间理论,论证构建虚拟多通道的可行性,通过盲源分离来实现源信号分离,最后通过HT在希尔伯特空间来辨识振荡参数。通过大量的系统建模仿真和现场录波数据试验评估所提方法的性能,验证该方法的有效性、准确性和抗干扰能力。

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.

基于行列式和稀疏性约束的NMF的欠定盲分离方法

非负矩阵分解(NMF)要求分解得到的左矩阵为列满秩,这限制了它在欠定盲分离(UBSS)中的应用。针对此问题,提出基于带行列式和稀疏性约束的NMF的欠定盲分离算法———DSNMF。该算法在基本NMF的基础上,对NMF得到的左矩阵进行行列式准则约束,对右矩阵进行稀疏性约束,平衡了重构误差、混合矩阵的唯一性以及分离信号的稀疏特性,实现了对混合矩阵和源信号的欠定盲分离。仿真结果表明,在源信号稀疏性较好和较差两种情况下,DSNMF都能取得良好的分离效果。

基于密度的空间聚类与霍夫变换相结合的欠定盲源分离混合矩阵估计

为解决欠定盲源分离中混合矩阵估计问题,提出了一种基于密度的空间聚类与霍夫变换相结合的混合矩阵估计算法。该算法首先通过基于相角的单源时频点处理增强信号的稀疏性,然后针对K-means算法需预先设置聚类个数的问题,采用基于密度的空间聚类算法对单源点进行自动分类以估计源信号个数,进而估计得到混合矩阵。为提高估计混合矩阵的精度,采用霍夫变换方法修正聚类中心。基于密度的空间聚类算法的运用也克服了霍夫变换峰值簇拥问题。实验结果表明,基于密度的空间聚类与霍夫交换相结合的方法能在源信号数量未知情况下准确估计混合矩阵,且估计精度高于K-means算法和基于密度的空间聚类算法。

基于SCA的欠定跳频网台分选方法

针对组网跳频信号在欠定条件下网台分选效果不佳的问题,提出了一种基于稀疏成分分析(sparse component analysis,SCA)的欠定跳频网台分选方法。在估计混合矩阵时,首先利用观测信号的实部与虚部方向一致性检测时频单源点,在采用S变换构造时频比矩阵的基础上,利用方差法实现了混合矩阵估计;在源信号恢复时,利用改进的子空间投影法得到源信号的时频域分离,最后可通过S逆变换得到时域分离信号,从而实现了欠定条件下的跳频网台分选。仿真结果表明,该方法有效实现了混合跳频信号在欠定条件下的网台分选且适用于跳频同步或异步组网方式,提高了分选性能和抗噪性能。

基于欠定盲分离的同步/异步跳频网台分选方法

研究无线通信网台分选优化问题,现有的跳频网台分选大多要求阵元数必须大于信号数,由于在实际应用中常常很难满足,为了用有限的阵元数分选尽可能多的跳频信号,提出了一种基于欠定盲分离的跳频信号分选方法。根据跳频信号具有良好的时频稀疏性,依据稀疏分量分析的"两步法"思路,首先用单源点聚类方法估计混合矩阵;然后利用子空间投影方法分离各跳频信号,从而实现了跳频信号的欠定盲分离。仿真结果表明了改进方法的有效性,为通信网分选优化提供了参考。

基于改进DBSCAN算法估计欠定混合矩阵的应用研究

针对欠定盲源分离(Underdetermined blind source separation,UBSS)问题,采用基于密度的空间聚类(Density based spatial clustering of applications with noise,DBSCAN)算法估计聚类中心时易陷入局部最优,因此由聚类中心坐标构成的混合矩阵的精度降低,导致信号分离结果不理想。本文在DBSCAN基础上提出布谷鸟自适应搜索群优化算法(Cuckoo adaptive search swarm optimization of density based spatial clustering of applications with noise,CASSO-DBSCAN),该算法依据Levy飞行策略增强全局自适应搜索能力,并利用群体学习思想精细寻优得到最优解,从而更加精准地估计聚类中心。通过语音信号的盲源分离仿真实验对该算法进行验证,结果表明,该算法能够有效改善欠定混合矩阵的估计精度,具有良好的鲁棒性,证明了其可行性。

基于改进蜂群聚类的欠定盲源分离

针对欠定盲分离中混合矩阵估计精度不高的问题,采用了改进的人工蜂群(ABC)聚类算法。从观测信号的线性聚类特点和蜂群的多样性考虑,改进雇佣蜂的搜索策略,从而加快算法的收敛速度。同时,引入基于Levy飞行的局部搜索方法,进一步对当前最优解的邻域进行搜索,提高ABC算法局部开发能力。仿真结果表明,该方法在源个数较多的情况下仍然有较高的混合矩阵估计精度。

一种欠定盲源分离算法通用模型

针对传感器数目小于源信号数目的欠定情形,研究了基于压缩感知(CS)的欠定盲源分离(UBSS)问题。从欠定盲源分离和压缩感知的数学模型入手,在源信号具有稀疏性的前提下,将其转化为CS理论中的稀疏信号重构问题。在Sparco框架下建立了CS-UBSS两步法算法通用模型,并理论证明了该模型的有限等距特性(RIP)。仿真结果说明了该算法模型针对语音信号和图像信号的可行性与适用性,拓宽了UBSS问题的解决思路,尤其是CS理论中性能优越的重构算法可以直接应用于源信号的恢复。