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

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

Source number estimation and separation algorithms of underdetermined blind separation

Recently, sparse component analysis （SCA） has become a hot spot in BSS research. Instead of independent component analysis （ICA）, SCA can be used to solve underdetermined mixture efficiently. Two-step approach （TSA） is one of the typical methods to solve SCA based BSS problems. It estimates the mixing matrix before the separation of the sources. K-means clustering is often used to estimate the mixing matrix. It relies on the prior knowledge of the source number strongly. However, the estimation of the source number is an obstacle. In this paper, a fuzzy clustering method is proposed to estimate the source number and mixing matrix simultaneously. After that, the sources are recovered by the shortest path method （SPM）. Simulations show the availability and robustness of the proposed method.     

一种欠定盲源分离新算法

提出了一种基于两步法的欠定盲源分离新算法。在混合矩阵估计阶段,采用基于势函数的聚类方法,在源信号恢复阶段,提出一种快速的稀疏信号重构算法,通过定义一个连续可微函数来近似[?0]范数,使得[?0]范数可解。该算法的特点是实现简单、速度快。仿真实验表明,与现有的采用快速[?1]范数最小化和OMP算法的欠定盲源分离方法相比,提出的算法在保证分离性能的前提下大幅度提高了算法的运行速度。     

估计盲信源分离混合矩阵的通用方法

混合矩阵的估计是解决盲信源分离问题的关键一步,但现有研究中缺乏一种同时适用于适定、超定及欠定情况下混合矩阵估计的通用方法。根据张量标准分解的因子矩阵和盲信源分离混合矩阵的估计均存在幅值和排列顺序的不确定性这一性质,将混合矩阵的估计转化为观测信号统计量所组成张量的标准分解问题,标准分解采用循环最小化方法,通过交替最小二乘算法实现。理论分析和仿真实验表明,所提方法可有效解决适定、超定和欠定混合矩阵的估计,是一种估计盲信源分离混合矩阵的通用方法。     

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.     

一种新的用于语音分离的盲源分离算法

提出了一种基于自然梯度的语音盲分离改进算法。该算法首先使用奇异值分解（SVD）的方法对观测信号进行预白化处理,而后使用自然梯度算法对预白化处理后的观测信号进行分离。通过计算机模拟试验,结果显示该算法能够有效地分离随机混合的自然语音信号。     

基于Hough变换的时频盲源分离算法

1998年,Belouchrani,A和Amin,M.G基于时频分布提出了一种经典的时频盲源算法,不足是当有噪声存在时,性能会下降。主要考虑源噪声的盲源分离问题,以Wigner分布计算观测信号的时频阵并将其看做图像,利用Hough变换将信号检测转换为在参数空间寻找局部极大值的问题,运用自项点理论选择合适的矩阵进行联合近似对角化估计源信号。该方法扩展了盲源分离的限制条件,且通过把噪声能量扩展到整个参数平面而只选择信号能量占主导的时频点,对噪声具有一定的抑制能力。     

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

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

Grading learning for blind source separation

By generalizing the learning rate parameter to a learning rate matrix, this paper proposes a grading learning algorithm for blind source separation. The whole learning process is divided into three stages: initial stage, capturing stage and tracking stage. In different stages, different learning rates are used for each output component, which is determined by its dependency on other output components. It is shown that the grading learning algorithm is equivariant and can keep the separating matrix from becoming singular. Simulations show that the proposed algorithm can achieve faster convergence, better steady-state performance and higher numerical robustness, as compared with the existing algorithms using fixed, time-descending and adaptive learning rates.     

基于频域卷积信号盲源分离的乐曲数据库构建*

将通过频域卷积信号盲源分离算法从MP3歌曲音频信号中分离出人声主唱信号,再从人声主唱信号中提取出能够表征歌曲的旋律特征构建哼唱检索系统的歌曲数据库。盲源分离要求观测信号数目不小于源信号数目,因此先用小波多分辨率分析构造一路观测信号,再用频域独立成分分析(FDICA)实现MP3歌曲音频信号的盲源分离(BSS)。实验证明,采用FDICA-based BSS从歌曲MP3中分离出的人声主唱信号的旋律特征与待检索的人声哼唱信号的旋律特征有较高的相似度,可以用歌曲MP3构建哼唱检索系统的歌曲数据库。     

基于盲分离的图像去噪算法研究

图像去噪是图像处理中一个重要而又富有挑战性的课题。已有的图像去噪算法对噪声模型作出假设,在达到假设条件时取得较好的去噪效果。这类算法不能完全去除噪声,而且会削弱图像信号的细节。把图像和噪声看作是互相独立的两个信号源,把去噪过程作为信号分离过程来处理。在初步从污染图像中估计出一个虚拟观测图像后,用基于独立分量分析的盲分离来达到去噪目的。实验结果表明,该算法相比传统的基于滤波的去噪方法,在噪声强度很大的情况下,依然能得到较好的去噪效果。     

盲源分离在单通道语音增强算法中的应用

提出一种单通道语音增强算法。首先由接收到的单声道语音信号的含噪部分构造一个假想噪声源,将这一噪声源和含噪的信号作为多通道自适应去相关（MAD）盲分离算法的输入,得到增强的语音信号。进一步将这一增强的语音作为输入,利用Daubechies小波对其进行分解,在小波域中选取合适的阈值函数进行滤波,然后合成时域语音信号。根据以上步骤得到的增强语音有较高的信噪比及可懂度。     

Maximum contrast analysis for nonnegative blind source separation

In this paper, we propose a maximum contrast analysis (MCA) method for nonnegative blind source separation, where both the mixing matrix and the source signals are nonnegative. We first show that the contrast degree of the source signals is greater than that of the mixed signals. Motivated by this observation, we propose an MCA-based cost function. It is further shown that the separation matrix can be obtained by maximizing the proposed cost function. Then we derive an iterative determinant maximization algorithm for estimating the separation matrix. In the case of two sources, a closed-form solution exists and is derived. Unlike most existing blind source separation methods, the proposed MCA method needs neither the independence assumption, nor the sparseness requirement of the sources. The effectiveness of the new method is illustrated by experiments using X-ray images, remote sensing images, infrared spectral images, and real-world fluorescence microscopy images.     

HT-LSM的欠定混合盲信号分离方法的研究

利用Hough变换可以检测观测空间中的直线方向从而确定混叠矩阵的方法,提出了欠定盲源分离中估计混叠矩阵的一种新算法——HT-LSM算法。该算法在介绍欠定盲信号分离基本原理的基础上,介绍基于Hough变换的盲信道估计算法,并将改进后的Hough变换与最小二乘法相结合,在不影响检测结果速度的同时又进一步提高了检测精度,应用到欠定语音信号分离中,取得了良好的实验效果。     

具有非奇异约束的线性卷积混合信号盲分离联合对角化方法

联合对角化能够成功解决盲分离问题, 但在求解时会得到非期望的奇异解, 从而无法完全分离出源信号. 鉴于此, 提出一种用于线性卷积混合盲分离的联合对角化方法, 将卷积混合模型变换为瞬时模型, 并对变换后的模型应用联合对角化求取分离矩阵. 在求解过程中, 引入约束条件对解的范围进行限定, 避免了奇异解的出现. 仿真结果表明, 所提出的方法能够成功实现卷积混合信号盲分离.

     

An approach for solving the permutation problem in blind source separation based on microphone sub-arrays

In this paper, we present a new algorithm for solving the permutation ambiguity in convolutive blind source separation. Transformed to the frequency domain, existing algorithms can efficiently solve the reduction of the source separation problem into independent instantaneous separation in each frequency bin. However, this independency leads to the problem of correctly aligning these single bins. We present a new method for solving the permutation problem using microphone sub-arrays. It is based on the combination of two approaches： direction of arrival （DOA） estimation for sources and the inter-frequency correlation of signal envelopes. The performance of the algorithm will be demonstrated on real-world data.     

NGA实现互信息量最小化的盲源分离

提出了一种新的盲源分离算法,该算法通过自然梯度算法实现互信息量最小化,从而达到盲源分离的最佳效果。由于互信息量具有度量分离信号的循环相关矩阵和单位阵的相似程度的特性,最小互信量标志着分离矩阵最佳的状态。通过自然梯度寻优算法来实现互信息量的最小化,从而得到理想的分离矩阵。仿真结果表明算法对具有循环平稳特性的源信号分离效果显著,且收敛速度快。     

后非线性混叠信号盲源分离算法综述

结合非线性盲源分离研究不断发展的现状,选取最常见的后非线性混叠信号盲源分离问题为对象,综述其算法,介绍了解混叠模型,说明了基于广义Gram-Schmit正交化构造解的存在性及非唯一性.在此基础上,阐释了分离方法和思路,概述了基于互信息最小化的独立性测度,并分析评述了不断涌现的后非线性盲源分离典型算法.最后指出,目前关于后非线性盲源分离算法的研究存在的共性问题,并对进一步的研究方向进行了展望.     

Natural gradient-based recursive least-squares algorithm for adaptive blind source separation

This paper focuses on the problem of adaptive blind source separation (BSS). First, a recursive least-squares (RLS) whitening algorithm is proposed. By combining it with a natural gradient-based RLS algorithm for nonlinear principle component analysis (PCA), and using reasonable approximations, a novel RLS algorithm which can achieve BSS without additional pre-whitening of the observed mixtures is obtained. Analyses of the equilibrium points show that both of the RLS whitening algorithm and the natural gradient-based RLS algorithm for BSS have the desired convergence properties. It is also proved that the combined new RLS algorithm for BSS is equivariant and has the property of keeping the separating matrix from becoming singular. Finally, the effectiveness of the proposed algorithm is verified by extensive simulation results.     

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.