欠定和非完全稀疏性的盲信号提取

两步策略已成为欠定盲信号分离的基本方法,混叠矩阵的估计是源恢复的先决条件.本文针对非完全稀疏性情况,提出一个两步的盲提取方法.该方法先利用信号的单源区间样本,估计部分源的基矢量（混叠矩阵的列矢量）,后最小干扰地提取所对应的源;除它所对应的基矢量外,它不依赖的其它的基矢量,故回避了混叠矩阵可识别的必要条件.几个仿真实验结果显示了该算法的性能和实用性.     

基于时频分布的欠定混叠盲分离

针对欠定混合信号的盲分离问题,提出了基于时频分布的欠定盲分离算法,首先计算信号的时频分布矩阵并找出信号的自源时频点,然后把自源点对应的时频分布矩阵表示成三阶张量并通过张量分解估计出混合矩阵,最后通过计算矩阵的伪逆和时频合成来完成源信号的恢复.该算法不需要假设源信号是稀疏的或相互独立的.仿真结果表明与已有算法相比本文方法...     

旋转变换和欠定盲分离的DUET算法

DUET是采用时频掩码求解欠定问题的著名算法.本文讨论旋转变换对DUET算法的影响,提出了一个改进的DUET算法.该算法利用混叠矩阵的任意两列作为旋转矩阵,先旋转接收信号和混叠矩阵,后执行DUET算法.因为DUET算法在不同的旋转变换下有不同的结果,所以需要将这些结果相加,以弥补DUET算法的失真.最后,几个语音信号的实验结果显示算法的性能和实用.     

弱稀疏语音信号的欠定盲分离

为解决弱稀疏语音信号的欠定盲分离问题,根据语音信号的部分W-分离正交性,提出一种基于单源主导区间的混合矩阵盲估计方法。该方法根据单源主导区间的性质,通过二元行矢量提取单源观测样本,对单源观测样本进行K均值聚类和主成分分析来估计混合矩阵。仿真结果表明,提出的方法可有效提高分离语音的性能,与直接利用K-PCA方法相比,分离语音的平均信噪比提高了10 dB左右。     

一种鲁棒的病态混叠信号欠定盲源分离算法

噪声环境下的病态混叠信号具有较强的空间复共线性,因此基于聚类的稀疏分量分析(SCA)方法难以在欠定条件下对其进行有效的分离。针对这一问题,该文首先建立了噪声环境下病态混叠信号欠定盲源分离问题的数学模型,分析了基于线性聚类的SCA方法在解决该问题时的局限性,提出了一种基于SCA和非正交联合对角化(NJD)的分离算法,该方法利用NJD不要求混叠矩阵为酉矩阵的特性,较好地解决了欠定盲源分离中的病态混叠问题。仿真实验表明,该方法在信号分离效果、噪声鲁棒性以及病态混叠鲁棒性上都明显优于基于启发式聚类粒子群优化的(CGPSO)的SCA方法。     

稀疏分量分析在欠定盲源分离问题中的研究进展及应用

伴随着国内外对盲源分离问题研究的日益深入,在独立分量分析等经典算法之外逐步发展出了许多新的算法.稀疏分量分析就是其中有效的方法之一,它利用信号的稀疏分解,克服了独立分量分析非欠定性的要求,解决了欠定情况下的盲源分离问题.本文将以稀疏分量分析为主要对象,归纳总结了近期的研究进展.     

基于源信号数目估计的欠定盲分离

该文利用欠定盲分离下稀疏源信号的特点,估计源信号的数目且恢复源信号。通常在用两步法来解决欠定盲分离时,首先利用K-均值算法对观测信号聚类估计出混叠矩阵,最后利用最短路径法来恢复源信号,但是在以往的算法中,第1步估计混叠矩阵时,通常假设源信号数目是已知的,从而进行K-均值聚类,而事实上源信号数目根本无法知道,因此对源信号数目的估计对两步法有很重要的影响。因此本文提出了一种新的两步法算法,其中第1步利用稀疏源信号反映在观测信号中的特征来准确地估计出稀疏源信号的数目,且能得到混叠矩阵,从而恢复源信号。最后的仿真结果,以及与通常的K-均值聚类算法对比的仿真结果说明了此算法的可行性和优异的性能。     

基于谐波提取的欠定语音盲分离方法

现有的欠定语音信号盲分离算法往往不能同时兼顾分离性能及效率。针对此问题,本文提出一种基于谐波提取的欠定盲分离方法。首先,利用频谱校正从混合信号的短时傅立叶变换中提取谐波参数,其次利用相位一致性准则甄别这些参数的单源属性,进而用自适应K-均值方法对单源模式做聚类而获得源数估计和混合矩阵估计,最后再用子空间投影法恢复源信号。其中谐波提取和单源参数筛选可保证低复杂度地精确估计出混合矩阵。仿真实验表明,相比于原始子空间投影算法,本文方法可获得更高的信号恢复质量,且在谐波相关领域也具有潜在应用价值。      

基于欠定盲分离的多目标微多普勒特征提取

连续波雷达多目标回波中多种微多普勒特征分离问题采用独立成分分析方法实现,该方法在使用中存在较大局限性,要求待分离的微多普勒特征之间必须是统计独立的,且仅局限于恰定和超定的方程组求解问题。然而,在多目标雷达观测场景下,雷达接收的混叠回波的个数通常少于目标的个数,各目标的微多普勒特征可能存在相关性。为此,提出了一种基于欠定盲分离的多目标回波微多普勒特征分离方法。该方法可以从少数原始混叠回波中分离出多个目标的微多普勒特征,对待分离的微多普勒特征限制性弱。通过数值仿真,证实了该方法的可行性。     

基于ICA的雷达信号欠定盲分离算法

该文针对源信号时域和频域不充分稀疏的情况,提出了欠定盲源分离中估计混合矩阵的一种新方法。该方法对等间隔分段的观测信号应用独立分量分析(ICA)的盲分离算法获得多个子混合矩阵,然后对其分选剔除了不属于原混合矩阵的元素,最后利用C均值聚类的学习算法获得对混合矩阵的精确估计,解决了源信号在时域和频域不充分稀疏的情况下准确估计混合矩阵的问题。在估计出混合矩阵的基础上,利用基于稀疏分解的统计量算法分离出源信号。由仿真结果,以及与传统的K均值聚类,时域检索平均算法对比的实验结果说明了该文算法的有效性和鲁棒性。     

Blind separation of speech mixtures via time-frequency masking

Binary time-frequency masks are powerful tools for the separation of sources from a single mixture. Perfect demixing via binary time-frequency masks is possible provided the time-frequency representations of the sources do not overlap: a condition we call W-disjoint orthogonality. We introduce here the concept of approximate W-disjoint orthogonality and present experimental results demonstrating the level of approximate W-disjoint orthogonality of speech in mixtures of various orders. The results demonstrate that there exist ideal binary time-frequency masks that can separate several speech signals from one mixture. While determining these masks blindly from just one mixture is an open problem, we show that we can approximate the ideal masks in the case where two anechoic mixtures are provided. Motivated by the maximum likelihood mixing parameter estimators, we define a power weighted two-dimensional (2-D) histogram constructed from the ratio of the time-frequency representations of the mixtures that is shown to have one peak for each source with peak location corresponding to the relative attenuation and delay mixing parameters. The histogram is used to create time-frequency masks that partition one of the mixtures into the original sources. Experimental results on speech mixtures verify the technique. Example demixing results can be found online at http://alum.mit.edu/www/rickard/bss.html.     

A time-frequency blind separation method for underdetermined speech mixtures

The proposed Blind Source Separation method （BSS）, based on sparse representations, fuses time-frequency analysis and the clustering approach to separate underdetermined speech mixtures in the anechoic case regardless of the number of sources. The method remedies the insufficiency of the Degenerate Unmixing Estimation Technique （DUET） which assumes the number of sources a priori. In the proposed algorithm, the Short-Time Fourier Transform （STFT） is used to obtain the sparse representations, a clustering method called Unsupervised Robust C-Prototypes （URCP） which can accurately identify multiple clusters regardless of the number of them is adopted to replace the histogram-based technique in DUET, and the binary time-frequency masks are constructed to separate the mixtures. Experimental results indicate that the proposed method results in a substantial increase in the average Signal-to-Interference Ratio （SIR）, and maintains good speech quality in the separation results.     

Criterion for signal extraction in underdetermined mixtures of bounded support

This work studies the problem of recovering a complex signal (source) from an underdetermined linear mixture of bounded sources. We assume some a priori information of the desired signal in the form of a training sequence and complete absence of knowledge from the other sources, except for their bounded character. The main contribution of this letter is the proposal of a bounded component analysis of the training error that tries to condense the relevant information of the observations in a linear estimate of the desired signal. This subspace can be later used for subsequent refined estimation of the signal of interest. Simulations corroborate the good performance of the proposed method in high SNR scenarios.     

Blind source extraction from convolutive mixtures in ill-conditioned multi-input multi-output channels

This paper presents a new approach to blind source extraction from convolutive mixtures in multi-input multi-output (MIMO) channels. Two ill-conditioned cases are considered: the number of sensors is less than the number of sources and the number of sensors is greater than or equal to the number of sources but the system is noninvertible. Although there exist several works related to ill-conditioned dynamic MIMO channels, especially on blind channel identification, how to obtain a true source only from observable convolutive mixtures is still an open problem. In this paper, beginning with introducing two blind extraction models for blind deconvolution in ill-conditioned MIMO channels, we discuss the extractability issue. Results from our extractability analysis (a necessary and sufficient condition) show that it is possible to extract individual sources from the outputs. Furthermore, all potentially separable sources (at most equal to the number of sensors) can be extracted sequentially based on these extraction models. A cost function based on cross cumulant is discussed along with the Gauss-Newton algorithm. Finally, a simulation example is presented for illustration.     

Blind source separation based on time-frequency signalrepresentations

Blind source separation consists of recovering a set of signals of which only instantaneous linear mixtures are observed. Thus far, this problem has been solved using statistical information available on the source signals. This paper introduces a new blind source separation approach exploiting the difference in the time-frequency (t-f) signatures of the sources to be separated. The approach is based on the diagonalization of a combined set of “spatial t-f distributions”. In contrast to existing techniques, the proposed approach allows the separation of Gaussian sources with identical spectral shape but with different t-f localization properties. The effects of spreading the noise power while localizing the source energy in the t-f domain amounts to increasing the robustness of the proposed approach with respect to noise and, hence, improved performance. Asymptotic performance analysis and numerical simulations are provided     

Fourth-order blind identification of underdetermined mixtures of sources (FOBIUM)

For about two decades, numerous methods have been developed to blindly identify overdetermined (P/spl les/N) mixtures of P statistically independent narrowband (NB) sources received by an array of N sensors. These methods exploit the information contained in the second-order (SO), the fourth-order (FO) or both the SO and FO statistics of the data. However, in practical situations, the probability of receiving more sources than sensors increases with the reception bandwidth and the use of blind identification (BI) methods able to process underdetermined mixtures of sources, for which P>N may be required. Although such methods have been developed over the past few years, they all present serious limitations in practical situations related to the radiocommunications context. For this reason, the purpose of this paper is to propose a new attractive BI method, exploiting the information contained in the FO data statistics only, that is able to process underdetermined mixtures of sources without the main limitations of the existing methods, provided that the sources have different trispectrum and nonzero kurtosis with the same sign. A new performance criterion that is able to quantify the identification quality of a given source and allowing the quantitative comparison of two BI methods for each source, is also proposed in the paper. Finally, an application of the proposed method is presented through the introduction of a powerful direction-finding method built from the blindly identified mixture matrix.     

基于时频掩码的鲁棒MVDR波束形成的研究

波束形成器通过增强来自转向矢量指定方向的声音分量来衰减背景噪声,所以准确的转向矢量估计是成功降噪的关键。但传统的Watson混合模型掩码估计方法的评估错误率仍然比较高,为解决这一问题,提出了基于复高斯混合模型(CGMM)的语音谱模型来估计时频掩码和转向矢量,加上改进的维纳滤波来达到有效降低评估错误率的目的。实验结果表明,基于CGMM的估计方法明显优于基于Watson混合模型的掩码估计方法,该算法的误码率(WER)由原来的8.47%降低到8.06%。     

基于时频分析的多跳频信号盲检测

为了减小低信噪比下干扰和噪声对跳频信号检测的影响,提出一种基于时频分析的多跳频信号盲检测算法.针对跳频信号、定频信号、高斯白噪声具有的不同时频分布特点,该算法利用短时傅里叶变换得到的时频图构造时频对消比;理论分析得到各信号的时频对消比是不同的,因此将其作为检测统计量,实现高斯白噪声背景下跳频、定频信号的盲检测.仿真结果...     

Blind mask template attacks on masked cryptographic algorithm

Masking is a countermeasure against differential power analysis (DPA) attacks on cryptographic devices by using random masks to randomize the leaked power of sensitive information.Template attacks (TA) against cryptographic devices with masking countermeasure by far require attackers have knowledge of masks at the profiling phase.This requirement not only increase the prerequisite of template attacking,but also lead to some sort of difference between the experimental encryption codes of the profiling device and the codes of commercial cryptographic devices,which might degrade performance in real world attacking.Blind mask template attack directly learns templates for the combination of no mask intermediate values without the need of knowing the masks of training power traces,and then uses these templates to attack masked cryptographic devices.Both traditional Gaussian distribution and neural network were adopted as the templates in experiments.Experimental results verified the feasibility of this new approach.The success rate of neural network based blind mask template attacking against masked cryptographic devices is very close to that of traditional template attacks against cryptographic devices without masking countermeasure.     

基于JADE和平行因子分解的欠定混合盲辨识算法

针对源信号个数未知的欠定混合盲源分离问题,本文提出了一种基于特征矩阵联合近似对角化（Joint Approximate Diagonalization of Eigenmatrices, JADE）和平行因子分解的欠定混合盲辨识算法,该算法不需要源信号满足稀疏性要求,仅在源信号满足相互独立和最多一个高斯信号的条件下,通过将JADE算法中的样本四阶协方差矩阵叠加成三阶张量,再对此三阶张量进行平行因子分解来完成源信号数和混合矩阵的估计,由于平行因子分解的唯一辨识性在欠定条件下仍然满足,该算法能够解决欠定盲源分离问题。并对该欠定混合盲辨识算法进行了深入的分析。通过仿真实验,计算估计矩阵与混合矩阵的平均相关误差,结果表明本文提出的算法在适定和欠定混合时均具有很好的辨识效果,而且实现简单,可满足实际应用的要求。