基于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.

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.

基于约束NMF的欠定盲信号分离算法

提出一种约束非负矩阵分解方法用于解决欠定盲信号分离问题。非负矩阵分解直接用于求解欠定盲信号分离时,分解结果不唯一,无法正确分离源信号。在基本非负矩阵分解算法基础上,对分解得到的混合矩阵施加行列式约束,保证分解结果的唯一性;对分解得到的源信号同时施加稀疏性约束和最小相关约束,实现混合信号的唯一分解,提高源信号分离性能。仿真实验证明了算法的有效性。

欠定和非完全稀疏性的盲信号提取

两步策略已成为欠定盲信号分离的基本方法,混叠矩阵的估计是源恢复的先决条件.本文针对非完全稀疏性情况,提出一个两步的盲提取方法.该方法先利用信号的单源区间样本,估计部分源的基矢量(混叠矩阵的列矢量),后最小干扰地提取所对应的源;除它所对应的基矢量外,它不依赖的其它的基矢量,故回避了混叠矩阵可识别的必要条件.几个仿真实验结果显示了该算法的性能和实用性.

基于独立分量分析的欠定盲源分离方法

针对欠定盲分离算法只能分离稀疏信号,对不稀疏信号分离效果不理想,而经典独立分量分析算法中扩展Infomax算法能分离超高斯信号及亚高斯信号,却只能应用于观测数不少于源数的超定盲源分离等问题,结合扩展In-fomax算法,提出欠定ICA算法,通过生成隐藏数据将欠定盲分离问题转化为超定盲分离问题,应用经典的扩展Infomax算法进行分析,并对实测齿轮箱混合故障信号进行分离,用包络阶次方法对分离出的信号进行分析,成功识别出齿轮箱不同故障特征。验证该算法在齿轮箱故障诊断中的有效性。

基于支持向量机的欠定盲分离

该文提出了信号稀疏性的新度量方式,在估算出有效源信号的个数后,提取源信号到达方向角度的特征作为训练样本,利用支持向量机理论构造分类超平面,从而实现对观测信号的最优分类。采用加权系数法获得每一类信号的聚类中心,其中对系数权重的学习是自适应的,同时避免了K-均值聚类等方法对初值的敏感性。此外,针对大规模样本点,该文还提供了在线算法。仿真效果说明了此方法的稳定性和鲁棒性。

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

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

基于超平面法矢量的欠定盲信号分离算法

探讨欠定情况下(观测信号少于源数目)的盲信号分离.首先给出了m维超平面的法矢量的计算公式,提出了一个基于超平面法矢量的矩阵恢复算法.其次针对语音分离,提出了k源区间及其检测方法,从而使k-SCA条件下的算法推广到了非稀疏信号的盲分离.在源信号重建上,提出了一个简化l^1范数解的新算法.几个仿真实验(含语音信号实验)证实了所提出算法的性能.

稀疏盲源信号分离的新算法

针对以往通常采用线性规划或最短路径法计算相对复杂这一稀疏盲信号分离瓶颈,提出了一种新的算法,通过方向投影合理设置迭代初始值,结合最速下降法寻优估计源信号。新算法容易实现,分离速度快,能够很好地满足盲分离对速度的要求。

基于两步法稀疏分量分析的欠定盲源分离

分析了解决欠定盲源分离问题的稀疏分量分析方法。首先讨论了数据矩阵稀疏表示(分解)的方法,其次重点讨论了基于稀疏因式分解方法的盲源分离。该盲源分离技术分两步,一步是估计混合矩阵,第二步是估计源矩阵。如源信号是高度稀疏的,盲分离可直接在时域内实现。否则,对观测的混合矩阵运用小波包变换预处理后才能进行。仿真结果证明了理论分析的正确性。

基于欠定盲分离的多目标微多普勒特征提取

连续波雷达多目标回波中多种微多普勒特征分离问题采用独立成分分析方法实现,该方法在使用中存在较大局限性,要求待分离的微多普勒特征之间必须是统计独立的,且仅局限于恰定和超定的方程组求解问题。然而,在多目标雷达观测场景下,雷达接收的混叠回波的个数通常少于目标的个数,各目标的微多普勒特征可能存在相关性。为此,提出了一种基于欠定盲分离的多目标回波微多普勒特征分离方法。该方法可以从少数原始混叠回波中分离出多个目标的微多普勒特征,对待分离的微多普勒特征限制性弱。通过数值仿真,证实了该方法的可行性。

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

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

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

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

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

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

欠定情形下语音信号盲分离的新方法

提出了一种新的两步法来实现欠定情形下语音信号的盲分离。第一步,采用一种重构观测信号采样点搜索法来估计混合矩阵;第二步,提出了一种伪提取矢量的概念,通过伪提取矢量来提取取值占优的源信号的采样值来恢复源信号。在源信号的恢复过程中,还使用了经典的基于线性规划的欠定盲源分离方法。结果表明:该方法由于在信号的各采样点处无须优化,在源信号的分离过程中,分离速度要比基于线性规划的方法快数倍,且分离精度不低于基于线性规划的方法。仿真结果表明了该算法的良好性能。

频域单源区间和欠定的盲信号分离

探讨在感知器个数少于源信号个数时的盲分离问题,提出频域中的单源区间矩阵恢复方法,以实现时域检索平均法在频域中的扩展,与传统的聚类算法相比,该算法计算简单、精度高,在理论上能够无偏差地估计混叠矩阵。在源信号的恢复上,根据稀疏的原则,在仅m个源在频域中较大、其余源可近似为0的假设下,得出求解L1范数的简化方法。语音信号仿真实验展示了该方法的性能和实用性。