参数化自适应图像盲分离算法

针对超高斯与亚高斯图像分离上存在的不足,本文提出一种等权重双高斯概率密度模型,可以有效估计超高斯、亚高斯图像的概率分布,该模型从区分超高斯与亚高斯分布的本质出发,通过在线学习确定模型参数实现盲分离.通过对混合图像的实验,表明该算法比已有算法具有更好的分离性能和收敛性,且方法简单易于工程实现.     

基于核密度最大熵方法的杂系混合信号盲分离*

传统的独立分量分析方法普遍存在的非线性评价函数只能凭经验选取,当混合信号同时包含超高斯和亚高斯信号时,算法难以取得很好的分离效果。利用基于随机变量矩的核密度最大熵方法对非线性函数进行直接估计,提出了基于核密度最大熵方法的杂系混合信号盲分离算法,成功地分离了杂系混合信号。仿真结果验证了算法的有效性。     

基于品质函数估计的非线性盲源分离算法

研究非线性盲源信号分离优化问题。由于混合信号同时包含超高斯和亚高斯信号且混合信号具有很强的非线性时,传统的非线性盲源分离算法中对于品质函数的选取一般都是通过经验,现有算法难以取得理想的分离效果。在Pearson模型的基础上提出了一种新的估计品质函数的方法,算法能够成功地估计出次高斯(sub-Gaussian)和超高斯(super-Gaussi-an)混合信号的品质函数,同时克服了Pearson模型对同类信号只能估计得到相同的品质函数的缺陷,提高了算法的估计精度。通过在MATLAB仿真验证了算法的可行性和有效性,成功估计出源信号的品质函数且实现了非线性盲源分离。     

基于独立分量分析和遗传算法的图象分离方法研究与实现

在深入分析独立分量分析技术的基础上，针对常规数值求解方法容易陷入局部最优解的问题，提出了一种基于遗传算法和独立分量分析相结合的盲源分离新算法．通过对图象信号分离仿真试验表明，采用最佳保留机制和移民方式的动态补充子代个体操作，在一定的群体规模和遗传代数的情况下，该方法能实现信号的盲分离，并可获得全局最优解．对超高斯信号和亚高斯信号的混合信号，与扩展信息最大化方法相比，该方法可获得更好的分离效果。     

基于最大信噪比的盲源分离算法

提出一种新的低计算复杂度的瞬时线性混叠信号的盲分离算法,该算法利用统计独立信号完全分离时信噪比量大作为分离准则。源信号用估计信号的滑动平均代替,把源信号和噪声信号协方差矩阵的函数表示成广义特征值问题,通过广义特征值问题求解分离矩阵不需要任何迭代运算。和典型的信息理论方法相比,该算法的优点是具有非常低的计算复杂度。计算机模拟实验证明,该算法能够分离线性混合的超高斯和亚高斯源信号,并且可以有效地分离语音信号。     

应用信号变化度的线性混合信号盲分离算法

论文首先给出了信号变化度的概念,并证明了信号变化度的一个性质:互相独立的一组源信号的线性混合信号的变化度介于源信号中的最小变化度和最大变化度之间。然后,利用矩阵广义特征值理论,给出了一种基于线性混合信号盲分离算法。该算法计算简单,具有闭解形式;并能分离源信号中既有亚高斯信号又有超高斯信号的情况。仿真结果表明该算法是有效的,并具有很好的分离性能。     

扩展Infomax算法的收敛性分析

扩展Infomax算法是在传统Infomax算法基础上发展起来的一种较为实用的盲源分离算法。该算法采用非线性模型的动态切换技术,实现了对超高斯源和亚高斯源的同步分离。该文结合模型切换矩阵系数和迭代误差在盲源分离过程中的变化,直观地展示了扩展Infomax算法的收敛过程。文中还探讨了高斯随机噪声和随机脉冲干扰对算法收敛性能的影响。所得结论对于扩展Infomax算法的实际应用有一定的指导意义。     

基于小波平滑的超高斯与亚高斯信号盲源分离算法

为了分离超高斯与亚高斯信号，利用小波变换的高低频系数作为平滑因子，建立以分母作为预测误差的信噪比目标函数，优化目标函数以求解分离矩阵．仿真表明，该算法能够有效地分离出源信号．     

基于时变自回归模型的FAJD盲源分离算法

为实现多高斯源和相关源信号的盲分离,在快速近似联合对角化(FAJD)算法的基础上,将故障诊断领域的时变自回归理论成功地应用于相关源信号的盲分离和多高斯源信号的盲分离.首先采用时变自回归模型(TVAR)对源信号建模,并通过白化预处理使得建模后的源信号具有可联合对角化的结构;然后,通过基函数加权和的方法将时变参数近似为已知基函数的加权和的形式,将其变成时不变的参数,再通过递推最小二乘法求解出模型系数矩阵组;最后,将所求出的系数矩阵组作为快速近似联合对角化的目标矩阵组,通过FAJD算法实现混合信号的分离.Matlab仿真实验验证了所提出的算法对于相关源信号和多高斯源信号的分离是行之有效的.由于算法中TVAR模型的优良特性,此算法非常适用于混合通信信号的盲分离.     

一种基于核函数的杂系盲源分离算法

本文提出了一种基于核函数的杂系盲源分离算法,即KFBSS算法。该算法通过引入非线性核函数和平滑参数h,将分离信号进行非线性核映射,最优化平滑参数h,同时更新混合分离矩阵,通过不断迭代学习,对混合信号进行盲源分离。仿真结果表明,与EASI算法、白化算法、自然梯度算法相比,本文方法能更有效的分离同系混合或杂系混合信号,收敛速度更快,且能够适应于非平稳环境,具有一定的实用性。     

On-line Algorithm for Blind Signal Extraction of Arbitrarily Distributed,but Temporally Correlated Sources Using Second Order Statistics

Most of the algorithms for blind separation/extraction and independent component analysis (ICA) can not separate mixtures of sources with extremely low kurtosis or colored Gaussian sources. Moreover, to separate mixtures of super- and sub-Gaussian signals, it is necessary to use adaptive (time-variable) or switching nonlinearities which are controlled via computationally intensive measures, such as estimation of the sign of kurtosis of extracted signals. In this paper, we develop a very simple neural network model and an efficient on-line adaptive algorithm that sequentially extract temporally correlated sources with arbitrary distributions, including colored Gaussian sources and sources with extremely low values (or even zero) of kurtosis. The validity and performance of the algorithm have been confirmed by extensive computer simulation experiments.     

Nonlinear blind source separation using higher order statistics anda genetic algorithm

This paper presents a novel method for blindly separating unobservable independent source signals from their nonlinear mixtures. The demixing system is modeled using a parameterized neural network whose parameters can be determined under the criterion of independence of its outputs. Two cost functions based on higher order statistics are established to measure the statistical dependence of the outputs of the demixing system. The proposed method utilizes a genetic algorithm (GA) to minimize the highly nonlinear and nonconvex cost functions. The GA-based global optimization technique is able to obtain superior separation solutions to the nonlinear blind separation problem from any random initial values. Compared to conventional gradient-based approaches, the GA-based approach for blind source separation is characterized by high accuracy, robustness, and convergence rate. In particular, it is very suitable for the case of limited available data. Simulation results are discussed to demonstrate that the proposed GA-based approach is capable of separating independent sources from their nonlinear mixtures generated by a parametric separation model     

Complexity Pursuit for Unifying Model

Complexity pursuit is an extension of projection pursuit to time series data and the method is closely related to blind separation of time-dependent source signals and independent component analysis. The goal is to find projections of time series that have interesting structure, defined using criteria related to Kolmogoroff complexity or coding length. In this paper, we first derive a simple approximation of coding length for unifying model that takes into account nongaussianity of sources, their autocorrelations and their smoothly changing nonstationary variances. Next, a fixed-point algorithm is proposed by using approximate Newton method. Finally, simulations verify the fixed-point algorithm converges faster than the existing gradient algorithm and it is more simple to implement due to it does not need any learning rate.     

A parametric density model for blind source separation

In this paper, a parametric mixture density model is employed to be the source prior in blind source separation (BSS). A strict lower bound on the source prior is derived by using a variational method, which naturally enables the intractable posterior to be represented as a gaussian form. An expectation-maximization (EM) algorithm in closed form is therefore derived for estimating the mixing matrix and inferring the sources. Simulation results show that the proposed variational expectation-maximization algorithm can perform blind separation of not only speech source of more sources than mixtures, but also binary source of more sources than mixtures.     

A robust approach to independent component analysis of signals with high-level noise measurements

We propose a robust approach for independent component analysis (ICA) of signals where observations are contaminated with high-level additive noise and/or outliers. The source signals may contain mixtures of both sub-Gaussian and super-Gaussian components, and the number of sources is unknown. Our robust approach includes two procedures. In the first procedure, a robust prewhitening technique is used to reduce the power of additive noise, the dimensionality and the correlation among sources. A cross-validation technique is introduced to estimate the number of sources in this first procedure. In the second procedure, a nonlinear function is derived using the parameterized t-distribution density model. This nonlinear function is robust against the undue influence of outliers fundamentally. Moreover, the stability of the proposed algorithm and the robust property of misestimating the parameters (kurtosis) have been studied. By combining the t-distribution model with a family of light-tailed distributions (sub-Gaussian) model, we can separate the mixture of sub-Gaussian and super-Gaussian source components. Through the analysis of artificially synthesized data and real-world magnetoencephalographic (MEG) data, we illustrate the efficacy of this robust approach.     

基于核方法的工频干扰消除算法

提出了一种新的基于核方法的工频干扰消除算法。利用构造参考信号的方法,将工频干扰消除问题转换为盲信号分离问题。通过核方法向高维特征空间的数据映射克服信号采集传感器的非线性畸变效应,利用信号的时间可预测性实现对输入信号的分离,从而得到不含工频干扰的有用信号。仿真实验结果表明,算法能够有效克服传感器的非线性畸变影响,很好地消除心电信号和地震信号中的工频干扰。     

盲源分离自适应算法的改进

指出了盲源分离自适应算法之间的联系,在满足多种性能择优标准前提下,引入了改进的非线性函数,该函数有效地实现了语音信号的盲分离,同时也提高了算法的收敛速度,实验表明该方法能够更快速地分离混迭语音。     

基于非线性PCA准则的两个盲信号分离算法

该文首先基于Oja定义的非线性PCA准则J1(W),利用矩阵广义逆递推得到一种盲信号分离算法,然后对Karhunen给出的非线性PCA加权误差平方和准则J2(W),采用梯度下降算法和线性寻优而得到另一种自适应盲信号分离算法。对这两个分离算法进行了计算机仿真,仿真结果表明它们的有效性。