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

A TIME-FREQUENCY BLIND SEPARATION METHOD FOR UNDERDETERMINED SPEECH MIXTURES

The proposed Blind Source Separation method(BSS),based on sparse representations,fuses time-frequency analysis and the clustering approach to separate underdetermined speech mixtures in the anechoic case regardless of the number of sources.The method remedies the insufficiency of the Degenerate Unmixing Estimation Technique(DUET) which assumes the number of sources a priori.In the proposed algorithm,the Short-Time Fourier Transform(STFT) is used to obtain the sparse rep-resentations,a clustering method called Unsupervised Robust C-Prototypes(URCP) which can ac-curately identify multiple clusters regardless of the number of them is adopted to replace the histo-gram-based technique in DUET,and the binary time-frequency masks are constructed to separate the mixtures.Experimental results indicate that the proposed method results in a substantial increase in the average Signal-to-Interference Ratio(SIR),and maintains good speech quality in the separation results.

BLIND SIGNAL SEPARATION BASED ON ME AND STATISTICAL ESTIMATION

There are two major approaches for Blind Signal Separation (BSS) problem: Maximum Entropy (ME) and Minimum Mutual Information (MMI) algorithms. Based on the recursive architecture and the relationship between the ME and MMI algorithms, an Extended ME(EME) algorithm is proposed by using probability density function (pdf) estimation of the outputs to deduce the corresponding iterative formulas in BSS. Based on the simulation results, it can be concluded that the proposed algorithm has better performances than the traditional ME algorithm in convolute mixture BSS problems.

BLIND SIGNAL SEPARATION OF LINEAR MIXTURE USING TRILINEAR DECOMPOSITION

This paper introduces a new source separation technique exploiting the time coherence of the source signals. The proposed approach relies only on stationary second order statistics. Blind Signal Separation (BSS) method using trilinear decomposition is proposed in this paper. Simulation results reveal that our proposed algorithm has the better blind signal separation performance than joint diagonalization method. Our proposed algorithm does not require whitening processing. Moreover, our proposed algorithm works well in the underdetermined condition, where the number of sources exceeds than the number of sensors.

BLIND SPEECH SEPARATION FOR ROBOTS WITH INTELLIGENT HUMAN-MACHINE INTERACTION

Speech recognition rate will deteriorate greatly in human-machine interaction when the speaker's speech mixes with a bystander's voice. This paper proposes a time-frequency approach for Blind Source Seperation (BSS) for intelligent Human-Machine Interaction(HMI). Main idea of the algorithm is to simultaneously diagonalize the correlation matrix of the pre-whitened signals at different time delays for every frequency bins in time-frequency domain. The prososed method has two merits: (1) fast convergence speed; (2) high signal to interference ratio of the separated signals. Numerical evaluations are used to compare the performance of the proposed algorithm with two other deconvolution algorithms. An efficient algorithm to resolve permutation ambiguity is also proposed in this paper. The algorithm proposed saves more than 10% of computational time with properly selected parameters and achieves good performances for both simulated convolutive mixtures and real room recorded speeches.

Searching-and-averaging method of underdetermined blind speech signal separation in time domain

Underdetermined blind signal separation （BSS） （with fewer observed mixtures than sources） is discussed. A novel searching-and-averaging method in time domain （SAMTD） is proposed. It can solve a kind of problems that are very hard to solve by using sparse representation in frequency domain. Bypassing the disadvantages of traditional clustering （e.g., K-means or potential-function clustering）, the durative- sparsity of a speech signal in time domain is used. To recover the mixing matrix, our method deletes those samples, which are not in the same or inverse direction of the basis vectors. To recover the sources, an improved geometric approach to overcomplete ICA （Independent Component Analysis） is presented. Several speech signal experiments demonstrate the good performance of the proposed method.

动态变化混叠模型下盲源分离中的源数估计

在进行欠定盲分离时,特别是对于源信号数目及混合矩阵动态变化的情况,常规的欠定盲分离及源数估计方法不能对源信号数目的变化时刻做出判断,因此很难实现动态变化的源信号数目实时和准确的估计。针对这个问题,提出了一种动态变化混叠模型下欠定盲源分离中的源数估计方法。首先,建立动态变化混叠情形下盲源分离的数学模型及动态标识矩阵。其次,基于构建的动态标识矩阵统计和判断动态源信号数目的变化情况。最后,通过分段时间内多维观测矢量采样点聚类区间局部峰值统计,实现动态变化混叠模型下盲源分离中的源信号数目的有效估计。仿真结果表明,该方法能有效实现动态变化混叠模型下欠定盲源分离中的源数估计,并且信号估计效果良好。

Adaptive blind separation of underdetermined mixtures based on sparse component analysis

The independence priori is very often used in the conventional blind source separation （BSS）. Naturally, independent component analysis （ICA） is also employed to perform BSS very often. However, ICA is difficult to use in some challenging cases, such as underdetermined BSS or blind separation of dependent sources. Recently, sparse component analysis （SCA） has attained much attention because it is theoretically available for underdetermined BSS and even for blind dependent source separation sometimes. However, SCA has not been developed very sufficiently. Up to now, there are only few existing algorithms and they are also not perfect as well in practice. For example, although Lewicki-Sejnowski＇s natural gradient for SCA is superior to K-mean clustering, it is just an approximation without rigorously theoretical basis. To overcome these problems, a new natural gradient formula is proposed in this paper. This formula is derived directly from the cost function of SCA through matrix theory. Mathematically, it is more rigorous. In addition, a new and robust adaptive BSS algorithm is developed based on the new natural gradient. Simulations illustrate that this natural gradient formula is more robust and reliable than Lewicki-Sejnowski＇s gradient.

基于QR分解的类Jacobi联合对角化算法

为提高实矩阵集的近似联合对角化的盲源分离性能,避免平凡解,提出了一种基于QR分解的类Jacobi联合对角化算法.利用QR分解的数值稳定性,采用Jacobi旋转矩阵,将分离矩阵分解为多个初等三角矩阵和正交矩阵的乘积,利用Jacobi旋转矩阵的结构及矩阵变换后的相关元素求解最优参数,将高维矩阵最小化问题转化为一系列低维矩阵子问题,提升源信号恢复精度.通过求解简化的Frobenius范数目标函数降低算法复杂度.混合心电信号仿真结果表明,与QRJ2D,LUCJD,EGJLUD算法相比,本文算法在分离精度和收敛速度方面均有一定优势.

Improved statistical sparse decomposition principle method for underdetermined blind source signal recovery

Aiming at the statistical sparse decomposition principle(SSDP) method for underdetermined blind source signal recovery with problem of requiring the number of active signals equal to that of the observed signals, which leading to the application bound of SSDP is very finite, an improved SSDP(ISSDP) method is proposed. Based on the principle of recovering the source signals by minimizing the correlation coefficients within a fixed time interval, the selection method of mixing matrix’s column vectors used for signal recovery is modified, which enables the choose of mixing matrix’s column vectors according to the number of active source signals self-adaptively. By simulation experiments, the proposed method is validated. The proposed method is applicable to the case where the number of active signals is equal to or less than that of observed signals, which is a new way for underdetermined blind source signal recovery.

Mainlobe jamming suppression via improved BSS method for rotated array radar

This study deals with the problem of mainlobe jamming suppression for rotated array radar.The interference becomes spatially nonstationary while the radar array rotates,which causes the mismatch between the weight and the snapshots and thus the loss of target signal to noise ratio(SNR)of pulse compression.In this paper,we explore the spatial divergence of interference sources and consider the rotated array radar anti-mainlobe jamming problem as a generalized rotated array mixed signal(RAMS)model firstly.Then the corresponding algorithm improved blind source separation(BSS)using the frequency domain of robust principal component analysis(FDRPCA-BSS)is proposed based on the established rotating model.It can eliminate the influence of the rotating parts and address the problem of loss of SNR.Finally,the measured peakto-average power ratio(PAPR)of each separated channel is performed to identify the target echo channel among the separated channels.Simulation results show that the proposed method is practically feasible and can suppress the mainlobe jamming with lower loss of SNR.

基于ICEEMDAN-盲源分离联合的微震信号降噪方法研究

针对黔西南锦丰金矿巷道施工采集的微震信号非平稳特征和背景噪声干扰问题,引入一种基于完善的自适应噪声完备集成经验模态分解(ICEEMDAN)与盲源分离联合的降噪方法。该方法通过ICEEMDAN算法对微震信号进行初步分解,再利用MATLAB平台计算出信号的相关系数和边际频谱,筛选出含噪模态分量和信号的主频率分量,最后通过FastICA算法进行盲源分离,实现降噪。实际应用结果表明,与经验模态分解(EMD)和小波包阈值传统方法相比,该方法信噪比更大(24.142 5 dB)、标准误差更小(0.012 18)、降噪效果更好。

基于密度峰值和模糊聚类的欠定混叠矩阵估计

传统聚类算法进行混叠矩阵估计时存在的聚类中心个数不确定和初始聚类中心的随机选取导致陷入局部最优的问题,为此提出一种基于密度峰值的改进模糊聚类算法进行欠定盲源分离的混叠矩阵估计。通过短时傅里叶变换提取信号在频域中的稀疏特性,利用寻找密度峰值聚类算法(clustering by fast search and find of density peaks,CFSFDP)自动获取聚类簇的数目和初始聚类中心;将获得的聚类数目和聚类结果作为模糊聚类算法(fuzzy c-means clustering,FCM)的初始输入参数,提高FCM聚类结果的精度。实验结果表明,该算法可以准确估计源信号的数目,相比传统FCM、层次聚类、基于密度峰值改进的粒子群等聚类算法,可以有效提高欠定盲源分离的混叠矩阵估计精度。

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

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

基于SVD降噪和盲信号分离的滚动轴承故障诊断

滚动轴承早期微弱故障特征信号往往淹没于系统噪声信号中而难于识别,奇异值分解技术(SVD)可以有效降低噪声水平,提高周期成分的提取能力,盲源分离技术可以分离故障源信号并提取故障特征。将奇异值分解技术和盲信号分离技术的优势应用于滚动轴承故障诊断,利用奇异值分解降噪特性消除系统信号中的混合噪声,对降噪后的信号通过盲信号分离技术进行盲源分离,提取出原始故障信号。数值仿真及实验结果表明,该方法可以成功地分离出滚动轴承实测信号的典型故障,提高滚动轴承故障诊断的效果。

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

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

基于四阶累积量的稳健的通信信号盲分离算法

该文针对有噪环境中的通信信号盲分离问题,提出了一种在噪声环境下性能良好的盲分离算法,该算法将稳健的白化算法与四阶累积量矩阵的联合对角化相结合。仿真结果表明,该算法分离性能比一般的近似联合对角化(JAD)算法有很大改善,干信比可降低近10dB,而算法的运算量没有太多增加。

基于ICA的雷达信号欠定盲分离算法

该文针对源信号时域和频域不充分稀疏的情况,提出了欠定盲源分离中估计混合矩阵的一种新方法。该方法对等间隔分段的观测信号应用独立分量分析(ICA)的盲分离算法获得多个子混合矩阵,然后对其分选剔除了不属于原混合矩阵的元素,最后利用C均值聚类的学习算法获得对混合矩阵的精确估计,解决了源信号在时域和频域不充分稀疏的情况下准确估计混合矩阵的问题。在估计出混合矩阵的基础上,利用基于稀疏分解的统计量算法分离出源信号。由仿真结果,以及与传统的K均值聚类,时域检索平均算法对比的实验结果说明了该文算法的有效性和鲁棒性。

基于Gabor变换的盲信号分离方法

提出了一种基于Gabor变换的盲信号分离方法。与传统的盲信号分离方法相比,该方法考虑到了不同类型信号的时频分布特点,通过估计混合矩阵从而能够较为准确地对源信号进行分离,而且突破了传统盲信号分离方法中要求源信号相互独立以及源信号最多只能有一个高斯信号的限制。仿真结果验证了该方法的有效性,为盲信号分离技术提供一种新的研究方向。