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

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

一种加权增强的欠定盲辨识方法

针对欠定盲源分离混合矩阵问题,提出了一种基于二阶统计量平行因子分解,加权增强最小二乘法的欠定混合盲辨识方法。该算法不需要源信号满足稀疏性要求,仅在源信号满足相互独立和最多一个高斯信号的条件下,将独立源信号的空间协方差矩阵构建三阶张量,采用加权增强最小二乘法实现张量的标准分解,完成混合矩阵的估计。由于平行因子分解的唯一性在欠定条件下依然成立,该算法可以解决欠定盲源分离问题。仿真实验结果表明:提出的算法在计算欠定混合时具有很好的辨识效果,而且实现简单,可满足实际应用的要求。     

基于线性阵列的欠定盲源分离几何分析

采用线性阵列对欠定盲源分离问题进行建模,研究源信号的空间分布对欠定盲源分离的影响.利用二步法和稀疏分量分析解决欠定盲源分离问题,其中,混合矩阵的估计主要利用稀疏源信号的线性混合信号沿混合矩阵列向量方向线性聚类的特性.理论分析和仿真实验结果表明,当源信号在空间处于某些特定区域时,若采用线性聚类方法,混合矩阵是不可估计的,...     

采用非负矩阵分解的语音盲分离

针对多通路语音信号的欠定卷积混合模型,提出一种基于非负矩阵分解(NMF)的语音盲分离方法。该方法使用高斯分量对源信号的短时傅里叶变换(STFT)进行表示,高斯分量由基于板仓-斋藤(Itakura-Saito(IS))散度的非负矩阵分解的因子所组成。使用极大期望值算法(EM)求解参数,并对信号进行重组。该方法被应用到双声道立体声信号的盲分离实验,实验结果表明了该方法的有效性。     

基于稀疏性的欠定语音盲分离方法研究

针对源信号增多导致语音信号稀疏性变差的问题,提出一种新的基于稀疏性的混合矩阵估计方法,利用主分量分析(PCA)检测只有一个源信号存在的时频点并用于估计混合矩阵,从而提高了估计性能,特别适用于欠定语音盲分离。同时指出了影响基于稀疏性语音盲分离方法性能的因素。仿真结果验证了上述结论。     

欠定条件下弱稀疏源信号混合矩阵盲估计

针对源信号的稀疏性影响欠定混合矩阵的估计精度, 在源信号单源频率及非单源频率分量分析的基础上,通过对观测信号频率峰值的幅值比值所 构成的列向量聚类,提出欠定条件下弱稀疏源信号混合矩阵的盲估计方法。鉴于经典聚类算 法的局部收敛性带来聚类结果的不稳定性,采用全局收敛特性较好的遗传模拟退火聚类算法 提高聚类结果的鲁棒性。仿真实验表明,本文提出的混合矩阵估计方法及采用的聚类算法 在不同欠定条件及噪声环境下具有较强的估计性能。     

基于EEMD和ICA的单通道列车信号盲分离

针对列车混合故障的诊断,提出了一种基于集合平均经验分解（EEMD）和独立分量分析（ICA）的盲分离诊断方法。通过EEMD算法将混合信号分解为包含不同源信号特征的本征模态函数（IMF）,组成新的多维信号;用主成分分析准确估计源信号个数,解决了单通道信号盲分离的欠定问题;利用快速独立分量分析（Fast-ICA）算法实现了信号的盲分离。实验信号分别采用仿真信号和列车实验信号进行实验,实验结果表明,该算法可以有效地分离出列车的单故障信号。     

弱稀疏性下的欠定语音盲分离方法

针对语音信号的弱稀疏性,提出一种新的基于混合矩阵估计的欠定语音盲分离方法。该方法通过主成分分析检测只有一个源信号存在时的时频点并用于估计混合矩阵,从而克服语音信号稀疏性变弱时的影响,提高混合矩阵估计精度。结合子空间法重构源信号,进一步提高分离性能,并从几何角度证明子空间方法,仿真结果表明该方法的分离性能优于Cluster-UBSS,且鲁棒性更好。     

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

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

病态混叠下语音信号的盲源分离

针对稀疏信号盲源分离势函数法需要过多参数,以及聚类算法需要知道源信号个数的缺陷,采用基于拉普拉斯模型的势函数法估计源信号数目和混合矩阵。将混合信号重新聚类,对每一类信号的协方差矩阵进行奇异值分解,混合矩阵得到更精确的估计,进而源信号也得到更精确的估计。通过计算机仿真,表明了该算法的优越性。     

基于核技巧和超图正则的稀疏非负矩阵分解

针对传统的非负矩阵分解（NMF）应用于聚类时,没有同时考虑到鲁棒性和稀疏性,导致聚类性能较低的问题,提出了基于核技巧和超图正则的稀疏非负矩阵分解算法（KHGNMF）。首先,在继承核技巧的良好性能的基础上,用L_2,1范数改进标准非负矩阵分解中的F范数,并添加超图正则项以尽可能多地保留原始数据间的内在几何结构信息;其次,引入L_2,1/2伪范数和L_1/2正则项作为稀疏约束合并到NMF模型中;最后,提出新算法并将新算法应用于图像聚类。在6个标准的数据集上进行验证,实验结果表明,相对于非线性正交图正则非负矩阵分解方法,KHGNMF使聚类性能（精度和归一化互信息）成功地提升了39%~54%,有效地改善和提高了算法的稀疏性和鲁棒性,聚类效果更好。     

Underdetermined mixing matrix estimation based on joint density-based clustering algorithms

Multimedia Tools and Applications - In underdetermined blind source separation (UBSS), the estimation of the mixing matrix is crucial because it directly affects the performance of UBSS. To improve...     

基于Hessian图正则稀疏NMF的高光谱解混

基于非负矩阵分解(Nonnegative Matrix Factorization, NMF)的高光谱解混(Hyperspectral Unmixing,HU)方法引起了大家的关注,因为可以将一个非负高光谱图像(Hyperspectral Imagery, HSI)数据矩阵分解为两个非负矩阵的乘积,分别对应于端元矩阵和丰度系数矩阵。目前,图约束的NMF算法已经被证明对高光谱解混是有效的,因为它们可以捕获HSI的几何特性。为了挖掘数据在混合过程中的几何结构和稀疏性,提出了一种稀疏的Hessian图正则化NMF(SHGNMF)算法。SHGNMF算法是将丰度矩阵的L1/2正则化器和Hessian图正则化项都添加到每个NMF模型中,同时采用乘法更新规则。最后用模拟数据和真实数据进行实验,验证了所提出的SHGNMF算法相对于其他NMF算法的优越性。     

密度空间与密度峰值聚类的欠定混合矩阵估计

针对欠定盲源分离问题, 提出了增强信号稀疏性的方法,并把具有噪声的基于密度空间聚类与寻找密度峰值聚类相结合用于估计混合矩阵。首先,把时域观测信号变换成时频域的稀疏信号,通过单源点检测突出信号的线性聚类特性,并采用镜像映射将线性聚类转变成致密聚类以便于进行密度基的聚类分析;然后,利用密度空间聚类搜寻密集数据堆中高密度的点和与之相应的邻域,以自动形成聚类簇的数量和初步聚类中心;最后,把获得的聚类数量作为密度峰值聚类的输入参数,在数据簇的范围内搜索其密度峰值以实现对聚类中心位置的进一步修正。以上方法不仅可提高混合矩阵的估计精度,而且估计量具有较高的一致性。     

Source separation using regularized NMF with MMSE estimates under GMM priors with online learning for the uncertainties

We propose a new method to incorporate priors on the solution of nonnegative matrix factorization (NMF). The NMF solution is guided to follow the minimum mean square error (MMSE) estimates of the weight combinations under a Gaussian mixture model (GMM) prior. The proposed algorithm can be used for denoising or single-channel source separation (SCSS) applications. NMF is used in SCSS in two main stages, the training stage and the separation stage. In the training stage, NMF is used to decompose the training data spectrogram for each source into a multiplication of a trained basis and gains matrices. In the separation stage, the mixed signal spectrogram is decomposed as a weighted linear combination of the trained basis matrices for the source signals. In this work, to improve the separation performance of NMF, the trained gains matrices are used to guide the solution of the NMF weights during the separation stage. The trained gains matrix is used to train a prior GMM that captures the statistics of the valid weight combinations that the columns of the basis matrix can receive for a given source signal. In the separation stage, the prior GMMs are used to guide the NMF solution of the gains/weights matrices using MMSE estimation. The NMF decomposition weights matrix is treated as a distorted image by a distortion operator, which is learned directly from the observed signals. The MMSE estimate of the weights matrix under the trained GMM prior and log-normal distribution for the distortion is then found to improve the NMF decomposition results. The MMSE estimate is embedded within the optimization objective to form a novel regularized NMF cost function. The corresponding update rules for the new objectives are derived in this paper. The proposed MMSE estimates based regularization avoids the problem of computing the hyper-parameters and the regularization parameters. MMSE also provides a better estimate for the valid gains matrix. Experimental results show that the proposed regularized NMF algorithm improves the source separation performance compared with using NMF without a prior or with other prior models.     

Regularized nonnegative matrix factorization using Gaussian mixture priors for supervised single channel source separation

We introduce a new regularized nonnegative matrix factorization (NMF) method for supervised single-channel source separation (SCSS). We propose a new multi-objective cost function which includes the conventional divergence term for the NMF together with a prior likelihood term. The first term measures the divergence between the observed data and the multiplication of basis and gains matrices. The novel second term encourages the log-normalized gain vectors of the NMF solution to increase their likelihood under a prior Gaussian mixture model (GMM) which is used to encourage the gains to follow certain patterns. In this model, the parameters to be estimated are the basis vectors, the gain vectors and the parameters of the GMM prior. We introduce two different ways to train the model parameters, sequential training and joint training. In sequential training, after finding the basis and gains matrices, the gains matrix is then used to train the prior GMM in a separate step. In joint training, within each NMF iteration the basis matrix, the gains matrix and the prior GMM parameters are updated jointly using the proposed regularized NMF. The normalization of the gains makes the prior models energy independent, which is an advantage as compared to earlier proposals. In addition, GMM is a much richer prior than the previously considered alternatives such as conjugate priors which may not represent the distribution of the gains in the best possible way. In the separation stage after observing the mixed signal, we use the proposed regularized cost function with a combined basis and the GMM priors for all sources that were learned from training data for each source. Only the gain vectors are estimated from the mixed data by minimizing the joint cost function. We introduce novel update rules that solve the optimization problem efficiently for the new regularized NMF problem. This optimization is challenging due to using energy normalization and GMM for prior modeling, which makes the problem highly nonlinear and non-convex. The experimental results show that the introduced methods improve the performance of single channel source separation for speech separation and speech–music separation with different NMF divergence functions. The experimental results also show that, using the GMM prior gives better separation results than using the conjugate prior.     

L1范数约束正交子空间非负矩阵分解

针对非负矩阵分解（NMF）相对稀疏或局部化描述原数据时导致的稀疏能力和程度比较弱的问题,提出了L1范数约束正交子空间非负矩阵分解方法.通过将L1范数约束引入到正交子空间非负矩阵分解的目标函数中,提升了分解结果的稀疏性.同时给出累乘迭代规则.在UCI、ORL和Yale三个数据库上进行的实验结果表明,该算法在聚类效果以及稀疏表达方面优于其他算法.     

基于K-SCA假设的欠定盲源分离

传统稀疏算法对信号的稀疏程度要求高、抗噪能力差。针对该问题,从K-SCA假设出发,提出一种基于超平面隶属度函数的欠定盲源分离算法。该函数基于局部统计,具有良好的抗噪性能,适用于噪声和信号稀疏程度较低条件下的信号分离。实验结果表明,相比同类算法,该算法对信号稀疏要求低、分离精度高、容噪能力强。     

基于网络分量分析的盲源分离方法

提出了用先验混合矩阵对盲源进行分离的网络分量分析方法(NCA).该方法在统计独立性假设不成立的条件下,也能实现对源信号的分离.通过计算机仿真与FastlCA和JADE算法进行了性能比较分析,证实了在无统计独立性的假设下,NCA具有更理想的盲源分离效果.