共查询到19条相似文献,搜索用时 156 毫秒
1.
2.
3.
针对源信号个数未知的欠定混合盲源分离问题,本文提出了一种基于特征矩阵联合近似对角化(Joint Approximate Diagonalization of Eigenmatrices, JADE)和平行因子分解的欠定混合盲辨识算法,该算法不需要源信号满足稀疏性要求,仅在源信号满足相互独立和最多一个高斯信号的条件下,通过将JADE算法中的样本四阶协方差矩阵叠加成三阶张量,再对此三阶张量进行平行因子分解来完成源信号数和混合矩阵的估计,由于平行因子分解的唯一辨识性在欠定条件下仍然满足,该算法能够解决欠定盲源分离问题。并对该欠定混合盲辨识算法进行了深入的分析。通过仿真实验,计算估计矩阵与混合矩阵的平均相关误差,结果表明本文提出的算法在适定和欠定混合时均具有很好的辨识效果,而且实现简单,可满足实际应用的要求。 相似文献
4.
频域盲源分离算法多数基于窄带假设,该假设在长混响环境下不成立。基于卷积传递函数(Convolutive Transfer Function, CTF)的多通道非负矩阵分解(Multichannel Nonnegative Matrix Factorization, MNMF)方法不依赖窄带假设,在长混响环境下的分离性能较其他传统算法有显著提升。但是,非负矩阵分解(NMF)对源信号功率谱进行近似估计在大多数情况下是病态的,其最优解不唯一。本文提出了一种基于最小体积约束的频域卷积盲源分离方法,在多通道非负矩阵分解(CTF-MNMF)的目标函数中,引入NMF基矩阵的最小体积约束来提高问题的适定性和求解参数的可辨识性。采用Majorization-Minimization (MM)优化方法对最小体积约束的目标函数进行求解,导出了估计参数的闭式解。仿真实验表明,在长混响环境下,所提方法比CTF-MNMF具有更好的分离性能。 相似文献
5.
6.
7.
针对基于扩展信息最大化算法的盲源分离算法在分离超亚高斯混合信号时依赖于信号的峭度估计且对初始分离矩阵和步长较为敏感的问题,提出了一种基于遗传算法的盲源分离算法。该算法以分离信号之间的互信息作为代价函数,采用非多项式函数的逼近方法解决了互信息求解过程中涉及到的负熵的计算问题,用遗传算法代替梯度寻优算法最小化代价函数。仿真结果表明:在分离超亚高斯混合信号时,该算法计算简单,鲁棒性好,迭代100次时性能指数值达到0.025 5,分离性能优于基于扩展信息最大化算法的盲源分离算法。 相似文献
8.
9.
独立分量分析(ICA)已被广泛运用于线性混合模型的盲源分离问题,但却有两个重要的限制:信源统计独立和信源非高斯分布。然而更有意义的线性混合模型是:观测信号是非负信源的非负线性混合,信源之间可以统计相关且可以为高斯分布。本文针对盲源分离问题,提出了一种运用新近国际上提出的一种非负矩阵分解算法(NMF算法)进行统计相关信源的盲源分离方法,该方法没有信源统计独立和信源非高斯分布的限制,只要信源之间没有一阶原点统计相关,则可很好实现对信源的分离。大量仿真及与传统ICA进行盲源分离的比较,验证了运用NMF进行包括统计相关信源和高斯分布信源的盲源分离的可行性和有效性。 相似文献
10.
针对瞬时欠定盲源信号分离问题,提出一种四阶累积张量分解算法.首先构建观察信号四阶累积协方差,依据源信号具有相互独立且均值为零的性质,对累积协方差化简并扩展到张量域,得到四阶累积张量.采用分层交替最小二乘算法对四阶累积张量进行非负库克分解,求得非负库克模型的参数,同时获得非负混合矩阵并求其伪逆,最终估计出源信号.选用真实的语音信号和生物信号进行仿真实验,结果表明该方法提高了源信号和非负混合矩阵的估计性能. 相似文献
11.
《IEEE transactions on circuits and systems. I, Regular papers》2006,53(10):2287-2298
This paper presents a gradient-based method for simultaneous blind separation of arbitrarily linearly mixed source signals. We consider the regular case (i.e., the mixing matrix has full column rank) as well as the ill-conditioned case (i.e., the mixing matrix does not have full column rank). We provide one necessary and sufficient condition for the identifiability of simultaneous blind separation. According to our identifiability condition and the existing general identifiability condition, all source signals are separated into two categories: separable single sources and inseparable mixtures of several single sources. A sufficient condition is also derived for the existence of optimal partition of the mixing matrix which leads to a unique maximum set of separations. One sufficient condition is proved to show that each maximum partition of the mixing matrix corresponds to a unique class of separated signals and as a result we can determine the number of maximum partitions from the classes of outputs under different separation matrices. For sub-Gaussian or super-Gaussian source signals, a cost function based on fourth-order cumulants is introduced to simultaneously separate all separable single sources and all inseparable mixtures. By minimizing the cost function, a gradient-based method is developed. Finally, simulation results show the effectiveness of the present method. 相似文献
12.
该文针对混沌信号盲分离问题,提出一种改进盲分离算法。该算法利用信号分离评价指标来构造函数实现步长和动量因子的自适应调整,然后将构造函数代入盲分离算法中并引入自适应动量项。区别于大多数算法不对混合矩阵进行估计的问题,该算法用变步长函数迭代估计出混合矩阵,从而得到全局矩阵和估计评价指标,以此迭代更新步长和动量因子,最终得出分离矩阵。仿真表明,该算法依据估计评价指标构造函数调整步长和动量因子方法是有效的,在平稳和非平稳环境下对混合混沌信号分离时都能达到收敛速度快且稳态误差小的效果;在混入色噪声时,比传统算法抗噪性能好,表明该文算法在混沌信号盲分离处理中有一定应用价值。 相似文献
13.
提出了一种新的病态混叠盲源分离算法.算法首先对观察信号进行预处理,把多余的观察信号剔除,使预处理后的混叠矩阵 A 是行满秩的;然后,通过把恢复信号的部分和的协方差与恢复信号的协方差之比的对数作为代价函数,使优化代价函数转化为求解一个广义特征值问题.在较弱的条件下,证明了该算法能够恢复出所有理论上能被分离出的源信号.数值仿真表明该算法非常有效. 相似文献
14.
15.
16.
This paper considers the complex mixing matrix estimation in under-determined blind source separation problems. The proposed estimation algorithm is based on single source points contributed by only one source. First, the problem of complex matrix estimation is transformed to that of real matrix estimation to lay the foundation for detecting single source points. Secondly, a detection algorithm is adopted to detect single source points. Then, a potential function clustering method is proposed to process single source points in order to get better performance. Finally, we can get the complex mixing matrix after derivation and calculation. The algorithm can estimate the complex mixing matrix when the number of sources is more than that of sensors, which proves it can solve the problem of under-determined blind source separation. The experimental results validate the efficiency of the proposed algorithm. 相似文献
17.
在基于解广义特征方程的线性混合信号盲分离方法的基础上,结合核特征空间给出了一种基于特征选择的非线性混合信号盲分离算法。该算法首先将非线性混合信号映射到高维特征空间,根据适应度函数选出一组完备的特征向量基。其次,通过这组特征向量基将高维特征空间的信号映射到参数空间,从而把非线性混合信号盲分离问题转化为特征空间的线性混合信号盲分离问题。在特征空间中,应用基于解广义特征方程的线性混合信号盲分离方法对信号进行分离。该方法稳定性好,收敛精度高,计算量小。仿真结果表明该算法具有良好的分离性能。 相似文献
18.
This paper considers mixing matrix estimation for underdetermined blind source separation. First, we propose an effective detection algorithm to identify single source points where only one source occurs. The detection algorithm finds single source points by utilizing the time–frequency coefficients of mixed signals and the complex conjugates of the coefficients. Then, a method based on probability density is proposed in order to find more reliable single source points and cluster them. Finally, the mixing matrix is obtained through re-selecting and clustering single source points. The experimental results indicate that the algorithm can accurately estimate the mixing matrix when there are fewer sensors than sources. 相似文献