含噪BSS模型的BJD-Hough算法*

当噪声存在时,信号和混合阵的盲估计变得相当困难。针对信号源噪声污染情形,假设信号和噪声的时频谱不同,提出了一种时频去噪盲源分离方法。该方法以Born-Jordan分布计算混合信号的时频矩阵并将信号的时频分布看作图像,利用广义Hough变换将信号检测转换为在参数空间寻找局部极大值的问题,再运用自项点理论选择合适的时频阵进行对角化,进而估计源信号和混合阵。该方法扩展了盲源分离的限制条件,能有效分离各种非平稳源信号、非独立源信号,且通过把噪声能量扩展到整个时频面而只选择信号能量占主导的时频点,对噪声具有一定的抑制能力。     

基于时频分布的非平稳信号盲分离算法

针对传统的盲源分离方法往往忽略信号非平稳性的问题,基于从瞬时线性混合模型的观测信号中分离出相互独立的源信号,并针对信号具有非平稳性,结合时频分析和盲源分离各自的特点,对非平稳信号盲分离进行了研究,并提出了一种新的具有不同空间时频分布的非平稳盲分离算法.仿真实验表明,通过采用维纳全时频域搜索来寻找局部最大值的平滑伪Wigner-Ville分布,该算法可以抑制交叉项而且能够保持时频聚集性,并达到了很好的分离效果.     

使用时频盲源分离和小波包去噪的胎儿心电信号提取

提出一种使用时频盲源分离(TFBSS)和小波包去噪的胎儿心电信号提取新方法。首先通过重排时频谱时频盲源分离方法进行胎儿心电信号的初次提取,并将初次提取得到的母体心电信号和噪声对应的各路分量置零,其余分量由混合矩阵进行重构;然后再利用重排时频谱的时频盲源分离方法对重构信号进行胎儿心电信号的二次提取,得到含噪声的胎儿心电信号;最后通过小波包去噪抑制胎儿心电信号中的基线漂移和噪声。在胎儿心电信号和母体心电信号的QRS波无重叠、部分重叠或完全重叠的情况下,通过该方法能有效抑制母体心电信号和噪声的干扰,提取胎儿心电信号。实验结果表明该方法能提取清晰的胎儿心电信号。     

小波变换结合盲源分离的EEG情感识别

由于脑电信号独立源数目的不确定性以及其他噪声的干扰,使得采集的脑电信号各导信号之间产生串扰、源信号难以估计以及噪声混杂等问题,严重影响了对脑电信号的分析研究。将小波变换与盲源分离算法相结合,并对盲源分离算法中维格纳分布存在的交叉项干扰现象进行重排处理。主要思路是首先将每一导信号进行小波变换,提取出特征波β波,然后对这些β波信号进行基于重排光滑伪维格纳分布的盲源分离,分离出关联性极大的β波成分。实验结果表明,所用方法分离出了各导信号中关联性大的脑电信号成分,并在一定程度上解决了源信号难以估计等问题,使识别结果有明显的提升。     

一种应用于水声目标检测的盲源分离算法

提出了一种新的盲源分离方法.该方法基于独立分量(ICA)理论,可以有效去除噪声,提高目标检测的性能.针对在盲源分离中噪声消除比较困难这一问题,利用水声信号半盲的特点,引入了虚拟信号的概念.通过添加虚拟信号,成功地分离了混合信号.高斯噪声和K分布噪声的仿真表明,该算法在强背景噪声下较匹配滤波算法有明显的检测优势.     

多特征值分解的稀疏混沌信号盲源分离算法研究

针对受到噪声干扰的激光混沌源信号高精度重构的问题,本文提出了一种基于相位空间重构混沌流信号的盲源分离算法。该算法首先对分离信号的相位空间进行时间延迟重构,然后将分离矩阵作为待优化参数,通过在相空间中构建目标函数,将盲源分离问题转换为优化问题,应用粒子群优化算法求解最优分离矩阵,进而将观测数据乘以最优分离矩阵来重构源信号。实验结果表明,该算法不仅具有快速收敛的特点,其精度明显优于各种噪声强度下现有的独立分量分析方法。     

融合极点对称模态分解与时频分析的单通道振动信号盲分离方法

针对单通道振动信号盲源分离的观察信号少于源信号,且传统的盲源分离方法往往忽视信号非平稳性的问题,提出一种基于极点对称模态分解和时频分析的盲分离算法（ESMD-TFA-BSS）。首先,采用极点对称模态分解方法将观察信号分解成不同的模态,采用贝叶斯信息准则（BIC）估计源信号个数并利用相关系数法选取最优观察信号,由原观察信号与最优观察信号组成新的观察信号;其次,根据新的观察信号计算白化矩阵并将其白化,利用平滑伪Wigner-Ville分布将白化后的信号拓展到时频域,采用矩阵联合对角化方法计算酉矩阵;最后,根据白化矩阵和酉矩阵估计源信号。在盲源分离仿真实验中,ESMD-TFA-BSS的估计源信号与仿真信号的相关系数分别为0.9771、0.9784、0.9660,基于经验模态分解和时频分析的盲分离算法（EMD-TFA-BSS）的相关系数分别为0.8697、0.9706、0.8548,ESMD-TFA-BSS比EMD-TFA-BSS的相关系数分别提高了12.35%、0.80%、13.00%。实验结果表明,ESMD-TFA-BSS在实际工程中能够有效地提高源信号分离精度。     

盲源分离的一种时频比方法

在M.Puigt和Y.Deville提出的时频盲源分离算法基础上,引入S变换来获取非平稳信号的多分辨率特性。首先通过S变换将一维混叠信号映射到二维时频平面,然后构造不同混叠信号的时频比矩阵,通过在时频比矩阵范围内搜索单源分析域计算混合阵的每个元素,进而估计源信号。该方法能有效分离非平稳信号且具备多分辨率特性。     

几种盲源分离算法的比较

文章研究了基于高阶统计量的FastlCA算法、基于信息理论的Infomax算法和基于四阶统计量的JADE算法等几种典型盲源分离算法在噪声环境下的分离性能.比较结果显示各种算法分离噪声信号的性能是不同的.对于某些混有一定噪声的特定信号,某些算法的分离性能要优于其他信号.研究结果还表明,基于信噪比和信号的特性来选择盲源分离算法能够给出令人满意的分离效果.     

基于时变自回归模型的FAJD盲源分离算法

为实现多高斯源和相关源信号的盲分离,在快速近似联合对角化(FAJD)算法的基础上,将故障诊断领域的时变自回归理论成功地应用于相关源信号的盲分离和多高斯源信号的盲分离.首先采用时变自回归模型(TVAR)对源信号建模,并通过白化预处理使得建模后的源信号具有可联合对角化的结构;然后,通过基函数加权和的方法将时变参数近似为已知基函数的加权和的形式,将其变成时不变的参数,再通过递推最小二乘法求解出模型系数矩阵组;最后,将所求出的系数矩阵组作为快速近似联合对角化的目标矩阵组,通过FAJD算法实现混合信号的分离.Matlab仿真实验验证了所提出的算法对于相关源信号和多高斯源信号的分离是行之有效的.由于算法中TVAR模型的优良特性,此算法非常适用于混合通信信号的盲分离.     

Blind source separation based on high-resolution time-frequency distributions

Blind source separation (BSS) based on time-frequency distributions (TFDs) exploits the underlying diagonal or off-diagonal structure of TFD matrices to separate the source signals. In this paper, we propose a new signal-independent kernel which is defined in both the time-lag and the Doppler-lag domain and satisfies most of the desirable properties of a TFD. The main objective of this research is to achieve the high resolution and the maximum cross-term reduction with the preferable diagonal or off-diagonal structure of TFD matrices in BSS applications. Moreover, a BSS approach is developed which includes first whitening mixed signals, then constructing a set of TFD matrices using the proposed TFD and the Hough transform, finally a joint diagonalization of a combined set of TFD matrices to estimate the mixing matrix and the source signals. By use of the techniques proposed in this paper, the improved performance of BSS of nonstationary signals has been achieved.     

Blind separation of non-stationary sources using continuous density hidden Markov models

Blind source separation (BSS) has attained much attention in signal processing society due to its ‘blind’ property and wide applications. However, there are still some open problems, such as underdetermined BSS, noise BSS. In this paper, we propose a Bayesian approach to improve the separation performance of instantaneous mixtures with non-stationary sources by taking into account the internal organization of the non-stationary sources. Gaussian mixture model (GMM) is used to model the distribution of source signals and the continuous density hidden Markov model (CDHMM) is derived to track the non-stationarity inside the source signals. Source signals can switch between several states such that the separation performance can be significantly improved. An expectation-maximization (EM) algorithm is derived to estimate the mixing coefficients, the CDHMM parameters and the noise covariance. The source signals are recovered via maximum a posteriori (MAP) approach. To ensure the convergence of the proposed algorithm, the proper prior densities, conjugate prior densities, are assigned to estimation coefficients for incorporating the prior information. The initialization scheme for the estimates is also discussed. Systematic simulations are used to illustrate the performance of the proposed algorithm. Simulation results show that the proposed algorithm has more robust separation performance in terms of similarity score in noise environments in comparison with the classical BSS algorithms in determined mixture case. Additionally, since the mixing matrix and the sources are estimated jointly, the proposed EM algorithm also works well in underdetermined case. Furthermore, the proposed algorithm converges quickly with proper initialization.     

Blind source separation with time series variational Bayes expectation maximization algorithm

This paper presents a variational Bayes expectation maximization algorithm for time series based on Attias? variational Bayesian theory. The proposed algorithm is applied in the blind source separation (BSS) problem to estimate both the source signals and the mixing matrix for the optimal model structure. The distribution of the mixing matrix is assumed to be a matrix Gaussian distribution due to the correlation of its elements and the inverse covariance of the sensor noise is assumed to be Wishart distributed for the correlation between sensor noises. The mixture of Gaussian model is used to approximate the distribution of each independent source. The rules to update the posterior hyperparameters and the posterior of the model structure are obtained. The optimal model structure is selected as the one with largest posterior. The source signals and mixing matrix are estimated by applying LMS and MAP estimators to the posterior distributions of the hidden variables and the model parameters respectively for the optimal structure. The proposed algorithm is tested with synthetic data. The results show that: (1) the logarithm posterior of the model structure increases with the accuracy of the posterior mixing matrix; (2) the accuracies of the prior mixing matrix, the estimated mixing matrix, and the estimated source signals increase with the logarithm posterior of the model structure. This algorithm is applied to Magnetoencephalograph data to localize the source of the equivalent current dipoles.     

基于Givens矩阵和联合非线性不相关的盲源分离新算法

针对源信号统计独立的盲源分离(Blind Source Separation,BSS)问题,提出了一种基于Givens矩阵和联合非线性不相关的盲源分离新算法.由于分离信号独立性的度量是影响算法有效性的重要因素,因此首先提出了一种改进的度量独立性的方法,该方法以独立源信号的联合非线性不相关来度量独立性;其次,结合Givens矩阵可以对分离矩阵施加正交性约束且能减少要估计参数个数的性质,将盲源分离问题转化成无约束优化问题,并利用拟牛顿法中的BFGS算法求解该无约束优化问题,得到分离矩阵;最后,通过模拟混合信号和真实语音混合信号的分离实验验证了该算法的有效性.     

Blind source separation with unknown and dynamically changing number of source signals

The contrast function remains to be an open problem in blind source separation (BSS) when the number of source signals is unknown and/or dynamically changed. The paper studies this problem and proves that the mutual information is still the contrast function for BSS if the mixing matrix is of full column rank. The mutual information reaches its minimum at the separation points, where the random outputs of the BSS system are the scaled and permuted source signals, while the others are zero outputs. Using the property that the transpose of the mixing matrix and a matrix composed by m observed signals have the indentical null space with probability one, a practical method, which can detect the unknown number of source signals n, ulteriorly traces the dynamical change of the sources number with a few of data, is proposed. The effectiveness of the proposed theorey and the developed novel algorithm is verified by adaptive BSS simulations with unknown and dynamically changing number of source signals.     

Blind source separation based on constant modulus criterion and signal mutual information

We address the problem of adaptive blind source separation (BSS) from instantaneous multi-input multi-output (MIMO) channels. It is known that the constant modulus (CM) criterion can be used to extract unknown source signals. However, the existing CM-based algorithms normally extract the source signals in a serial manner. Consequently, the accuracy in extracting each source signal, except for the first one, depends on the accuracy of previous source extraction. This estimation error propagation (accumulation) will cause severe performance degradation. In this letter, we propose a new adaptive separation algorithm that can separate all source signals simultaneously by directly updating the separation matrix. The superior performance of the new algorithm is demonstrated by simulation examples.     

Harmonic retrieval by period blind source extraction method: Model and algorithm

A frequently encountered problem in signal processing field is harmonic retrieval in additive colored Gaussian or non-Gaussian noise, especially when the frequencies of the harmonic signals are closely spaced in frequency domain. The purpose of this paper is to develop novel harmonic retrieval algorithm based on blind source extraction (BSE) method from linear mixtures of harmonic signals using only one observed channel signal. First, we establish the blind source separation (BSS) based harmonic retrieval model in additive noise using the only one observed channel, at the same time, the fundamental principle of BSE based harmonics retrieval algorithm is analyzed in detail. Then, based on the established harmonic BSS model, we propose a BSE approach to the harmonic retrieval using the concept of period BSE method, as a result, the harmonic retrieval algorithm using only one channel mixed signals is derived. Simulation results show that the proposed algorithm is able to separate the harmonic source signals and yield ideal performance.     

基于核估计的超定混合共轭盲信号分离方法

当混合信号的个数多于源信号时,盲源分离模型中的混合矩阵被描述为一个超定矩阵,因此不能直接通过估计逆矩阵的方法来得到分离矩阵。针对该线性超定混合情况提出了一种基于共轭梯度的盲源分离方法。该方法基于最小互信息准则,通过对行满秩分离矩阵的奇异值分解而引入了超定盲源分离的代价函数。利用共轭梯度优化算法推导出了迭代计算分离矩阵的更新公式。在每次迭代计算中,利用随机变量概率密度估计的核函数法在线估计分离信号的评价函数。避免了诸多传统盲分离算法中只能凭经验选取特定的非线性函数来代替评价函数的问题。仿真结果验证了所提算法的有效性。