基于区域增长校正的频域盲源分离排序算法

卷积盲源分离可以在频域得到有效解决,但频域盲源分离必须解决排序模糊问题。该文提出一种基于区域增长校正的频域盲源分离排序算法。首先对卷积混合信号短时傅里叶变换,在频域的各个频点处建立瞬时模型进行独立分量分析,在此基础上使用分离信号功率比的相关性,对所有频点进行逐点排序置换。其次根据阈值将排序后的结果划分为若干个小区域。最后按区域增长方式进行区域置换与合并,最终得到正确的分离信号。区域增长校正可最大限度地减少频点排序错误扩散现象,从而改善分离效果。在模拟和真实环境中分别进行语音盲源分离实验,结果表明所提算法的有效性。     

基于性能权重聚类的频域盲分离排序算法

卷积混合盲源分离可以在频域得到有效解决，但频域盲分离必须要解决排序模糊性问题。本文提出了一种基于性能权重聚类的频域盲分离排序算法，该算法利用聚类来得到顺序参考，对各频点上分离信号的准确性进行计算，根据分离结果的准确性予以不同频点不同的聚类权重，从而提高聚类结果的可靠性。通过对频点进行分段处理可以有效抑制排序错误的传播，提高算法性能。最后通过多组仿真实验验证了基于性能权重聚类的频域盲分离排序算法的普适性与性能上的优越性，同时也探究了接收端个数对算法性能的影响。仿真结果表明本文提出的基于性能权重聚类的频域盲分离排序算法相较于传统的幅度相关性排序算法在信干比上会有2 dB左右的提升。接收天线数越多，算法分离性能越好。     

基于影响因子的频域盲源分离排序算法

卷积混合信号盲源分离可以在频域得到有效解决,但频域盲源分离必须解决排序问题.本文研究了频点距离和各频点分离质量对基于相邻频点幅度相关性的排序算法的影响,提出了改进的频域盲源分离排序算法.改进算法通过影响因子来控制频点距离和各频点分离质量对排序的影响,距离小且分离质量好的频点设置较大影响因子,距离大或分离质量不好的频点则设置较小影响因子.文中详细讨论了影响因子的设定函数.最后对瞬时混合信号、卷积混合信号、实际房间采集信号分别进行盲源分离实验.实验结果表明了本文算法的有效性.     

基于相邻频点幅度相关的语音信号盲源分离

排序和幅度不一致性是在频域进行信号盲源分离的主要困难。针对语音信号邻近频点间信号幅度相关性能良好这一特点，本文提出基于相邻频点间幅度相天的盲源分离算法，用以消除卷积信号盲源分离过程中排序不确定性。本算法理论简单，稳健性好。仿真结果表明该方法对卷积混合后的语音信号能得到较好的分离效果，并且耗时较短。     

一种强混响环境下的盲语音分离算法

强混响环境下语音信号的频域盲分离问题是盲源分离领域的一个难点,主要是因为混合系统的脉冲响应时间过长,甚至超过信号的非平稳时间,导致算法性能下降。本文针对这个问题提出了一种解决方法,在用一个短时傅立叶变换将时域卷积混合信号转化为频域的过程,再在时频域上使用另一个短时傅立叶变换,将信号变换到调制谱域,这样较长的脉冲响应就被转化为调制谱域上的瞬时混合形式,而瞬时混合情形则采用独立向量分析(IVA)算法来避免排序模糊性问题。计算机仿真实验证实了该算法在强混响环境下优于传统频域盲分离算法。      

一种有效的语音信号盲分离方法

频域盲语音信号分离存在着排序模糊问题,提出一种基于相邻频点幅度相关和DOA估计相结合的解排序模糊方法,并且通过对一系列预处理（白化）、独立分量分析和后处理算法的优化和有机组合,很好地实现了卷积混合语音信号的盲分离。用真实录制的语音信号进行了仿真实验,恢复出来的源信号的信干比较分离之前提高了约13dB,证明了算法的有效性。     

基于邻近频点相关特性的水声信号盲源分离

排序和幅度不一致性是信号频域盲源分离的主要困难。该文建立了邻近频点相关特性理论,并针对水声信号进行深入研究,结论表明单个水声信号邻近频点间相关特性良好,且性能非常稳定;而两个不同水声信号邻近频点相关性非常弱。提出基于邻近频点相关特性的盲源分离算法,用于消除卷积信号盲源分离过程中排序不确定性,实验表明该方法对卷积混合形式的水声信号能取得较好分离效果。     

利用时频域稀疏性的LFM信号盲源分离方法

信号分离是雷达电子对抗的重要环节。考虑到雷达信号在时频域具有稀疏性的特点,在独立分量分析的基础上,提出了一种基于时频域稀疏性的线性调频雷达信号盲源分离方法。首先对混合信号进行短时傅里叶变换,在每个频点利用自然梯度算法分离信号,由分离信号幅度的比值作为对源信号后验概率的估计;然后根据相邻频点后验概率序列的相关性进行排序,确保各个频点的分离信号属于同一个源信号;最后设计时频掩码分离信号。进行了线性调频雷达信号卷积混合的盲分离实验,所提方法分离结果明显优于传统独立分量分析方法的分离结果,验证了该方法的有效性。     

基于频域子带的语音调幅-调频分解模型

提出了一种按频域子带对语音信号进行幅度调制和频率调制联合分解的分析方法.该方法首先使用动态规划的算法将语音的频谱划分为多个互不重叠的频域子带,每个子带内只含有一个共振峰即是单成分信号,然后在各频带内使用能量分离算法做调幅-调频分解,解决了以往方法中用于多成分分离的带通滤波器参数的经验选择问题.并将此方法用于共振峰估计实验,实验结果表明不仅准确地估计出了共振峰频率,而且避免了复杂的共振峰轨迹跟踪过程.     

一种新的基于数据场的语音增强算法

语音增强是消除噪声干扰的主要手段,在语音处理系统中得到广泛应用。传统语音增强算法认为相邻帧语音幅度谱之间是相互独立的,而研究表明语音幅度谱时频点之间存在相互依赖关系。缺乏对邻域时频结构信息的利用使得传统增强算法的性能难以进一步提高。本文首次将数据场引入到对语音的听觉感知领域,用数据场对语音的时频依赖性进行建模,提出一种新的基于数据场的语音增强算法。该算法通过最小化势场分布的熵确定了时频点之间的相互作用力程,在带噪语音数据场中估计噪声的最小统计量得到二值时频掩蔽值,最后利用二值时频掩蔽消除噪声干扰。实验测试表明,与Martin算法相比,基于数据场的语音增强算法在提高去噪效果的同时能有效减少语音的失真。      

A Novel and Fast Algorithm for Solving Permutation in Convolutive BSS,Based on Real and Imaginary Decomposition

In this paper, a new fast method for solving the permutation problem in convolutive BSS is presented. Typically, by transferring signals to the frequency domain, the convolutive BSS problem is converted to an instantaneous BSS, and deconvolution takes place in each frequency bin. However, another major problem arises which is permutation ambiguity in the frequency domain. Solving the permutation ambiguity for N sources in frequency domain needs N! comparisons between adjacent frequency bins. This drastically increases the overall computational complexity of the convolutive BSS. In our new approach, the complex-valued signals are decomposed into real and imaginary parts in each frequency bin. We show that the ideal mixing matrix has to possess a simple and symmetric structure. Accordingly, the structure can be exploited for solving the permutation ambiguity in frequency domain. Although separation in subband is accomplished by the FastICA algorithm, the proposed method requires modification of the separation algorithm, and a new structure is imposed on the mixing matrix. After that signals are separated by means of the FastICA, the permutation correction takes place only by N comparisons, decreasing the computational complexity. Comparing to five competitive methods, we experimentally demonstrate that permutation ambiguity is resolved accurately by this very fast approach while substantially decreasing the order of calculations. In terms of the separation performance and signal quality, the proposed method is superior to four of the compared methods and almost similar to the best of them.     

Automatic Pattern Extraction and Classification for Chromosome Images

Chromosome image analysis and pattern classification is one of the essential tasks in genetic syndrome diagnoses. An automatic procedure is introduced for chromosome image analysis. The pale-path algorithm is proposed to segment touching and overlapping chromosomes. Medial axis is extracted by the middle point algorithm. Chromosome band is enhanced by the algorithm based on multiscale wavelets Bi-spline, and extracted by average gray profile, gradient profile and shape profile. The multilayer classifier is used to classify the chromosome pattern calculated by weighted density distribution algorithm. Experiment results demonstrate that the algorithms perform well.     

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.     

快速扫描机载气象雷达多普勒解模糊算法

本文针对机载气象雷达前视快速扫描下的多普勒模糊问题,提出了两种多普勒解模糊算法：基于改进方位向波束形成算法和基于阻塞矩阵算法。基于改进方位向波束形成算法在传统的Capon波束形成的基础上,利用空间谱积分的方法对非期望信号协方差矩阵进行重构和对导向矢量进行估计,进一步提高了算法的鲁棒性,降低方位角估计误差;基于阻塞矩阵算法需要估计导向矢量,并利用导向矢量计算阻塞矩阵,将接收信号进行多普勒模糊相消预处理,阻塞每个多普勒频点的模糊多普勒分量,以达到解模糊的目的。通过仿真实验证明,两种方法均可以有效地恢复信号的多普勒信息,其中基于阻塞矩阵算法与基于改进方位向波束形成算法相比,有更优良的性能,并有更小的运算量。     

Joint blind source separation by generalized joint diagonalization of cumulant matrices

In this paper, we show that the joint blind source separation (JBSS) problem can be solved by jointly diagonalizing cumulant matrices of any order higher than one, including the correlation matrices and the fourth-order cumulant matrices. We introduce an efficient iterative generalized joint diagonalization algorithm such that a series of orthogonal procrustes problems are solved. We present simulation results to show that the new algorithms can reliably solve the permutation ambiguity in JBSS and that they offer superior performance compared with existing multiset canonical correlation analysis (MCCA) and independent vector analysis (IVA) approaches. Experiment on real-world data for separation of fetal heartbeat in electrocardiogram (ECG) data demonstrates a new application of JBSS, and the success of the new algorithms for a real-world problem.     

宽带恒定束宽盲波束形成算法

针对传统盲源分离算法对宽带阵列信号适用性较差的问题,提出一种基于时频分析的宽带恒定束宽盲波束形成算法。该算法首先将接收信号变换到时频域上并提取出单源点。然后,对单源点聚类并求解信号在不同频点上的导向矢量。最后,通过提出一种信号来向未知的空间响应变化约束方法,实现宽带恒定束宽盲波束形成。该算法避免了将宽带盲波束形成转换为卷积混合的盲源分离,因而不存在时域盲源分离算法中系统参数随滤波器阶数急剧增加的问题,也不存在频域算法中排序和幅度模糊的问题。仿真结果表明,算法能够较好地实现宽带信号的盲分离,且输出信干噪比高于时域、频域以及时频域盲源分离算法,实测数据的处理结果验证了该算法的实用性。      

Cooperative wireless localization based on weighting for vector‐addition error

Localization error occurrence due to a position ambiguity is a very critical problem in wireless distributed cooperative localization, which may, in turn, affect the reliability of the localization of the whole or a major portion of the network. In this paper, we formulate a two‐dimensional cooperative localization model via graph partition in arbitrary topologies while considering the cooperative node's (or neighbor's) position ambiguity. Based on this model, we establish a robust algorithm, named weighted factor graph (FG)‐based cooperative localization algorithm, by mapping local topologies into the FG and by incorporating the vector‐addition error as the weight. The vector‐addition error includes the measurement error and the neighbor's position ambiguity, simultaneously. The optimal weight is derived theoretically according to the statistic properties of the vector errors and the joint probability density function. Theoretical analysis and numerical results indicate that the proposed algorithm can acquire higher level of accuracy for localization in various topology scenarios in comparison with some typical algorithms. Copyright © 2014 John Wiley & Sons, Ltd.     

基于相关矩阵的频域盲分离排序方法

排列模糊性和幅度模糊性一直是在频域上分离卷积混合信号所面临的主要问题,针对该问题,给出了一种基于相邻频点的幅度相关之和的、快速有效地解决频域分离算法中排列模糊性的方法;即通过定义相邻频点的相关矩阵并通过其置换形式来解决排列模糊问题,从而在频域上有效的分离源信号,仿真证明,该算法可以对卷积混合信号实行快速有效分离,分离效果理想,并大幅减少计算量。     

基于LTE信号的外辐射源雷达副峰特性及抑制方法研究

针对基于LTE信号的外辐射源雷达,首先根据LTE信号结构分析了其模糊函数的特性,解释了不同类型副峰的产生机理。然后,针对对探测性能有影响的两类副峰,提出相应的抑制算法:对于循环前缀副峰,提出数据非连续分块的快速互模糊算法;对于频谱不连续产生的副峰,提出频带合成和频域加窗的抑制算法。最终通过两种抑制算法的综合处理,得到LTE信号图钉状的模糊函数。该文工作为基于LTE信号的外辐射源雷达副峰抑制提供了新的方法。     

一种基于并行结构的快速VQ编码算法

为提高编码速度，本文提出了一种新的快速矢量量化编码搜索算法。文中首先讨论了码书矢量平均值与失真测度之间的变化关系，并根据其结果提出基本的四分法均值排序搜索算法；然后结合并行硬件的优点，提出一种基于并行结构的四分法均值排序搜索VQ编码算法。测试结果表明，与传统的完全搜索算法及部分快速搜索算法相比，本文算法大大减少了编码时间。