一种适用于微弱信号盲提取的白化方法

独立分量分析(ICA)算法是解决盲信号分离(BSS)问题的最有效方法之一.ICA中,对观测信号预白化处理的作用至关重要.通常采用主分量分析(PCA)来进行预白化处理.实际中,在利用广播、电视等作为照射源的被动雷达系统中,观测信号通常被强噪声和干扰严重污染,这很大程度上降低了BSS方法的性能.然而,传统的BSS方法中没有...     

基于GA优化RBF网络的焦炭质量模型

文章提出了一种基于遗传算法(GA)优化径向基函数(RBF)神经网络的焦炭质量预测模型。RBF网络存在两个关键问题：一是如何确定隐含层中心,而是如何调整网络权值。本文通过减聚类算法确定RBF网络基函数的中心数目,应用遗传算法对RBF网络权值进行优化。主要对焦炭的抗碎强度、耐磨强度、反应性指数和反应后强度使用GA优化RBF神经网络预测。结果表明该模型有较强适应性,同时能保证较高的预测精度,具有一定的实用价值。     

神经网络中隐含层的确定

主要通过PLD算法确定神经网络中隐含层神经元的数目及连接权值,并通过Matlab随机模拟生成一个二维三类线性可分集,用传统的BP网络和本文提出的PLD算法分别对其进行分类实验.     

扩展信息最大化盲源分离算法的研究

盲源分离技术是信号处理和神经网络领域近年来的一个热点研究课题,由于其能够从观测的混合信号中恢复出源信号,而对源信号和混合系统的先验知识要求很少,因此在语音信号处理、无线信号处理、生物医学信号处理、地震信号处理,以及图像增强等方面都具有非常重要的理论意义和实用价值。信息最大化盲源分离算法能够有效地分离语音信号的瞬时混合,但是不能分离超高斯信号(如语音信号)和亚高斯信号(如正弦信号)的混合。基于此,本文讨论了扩展信启、最大化盲源分离算法,通过仿真表明,该算法可以有效的对各种源信号的线性即时混合进行分离,实验证明了该算法的有效性。     

复数前馈神经网络的全局最优和快速学习算法

提出了一种新型复数前馈神经网络的学习算法。当输入层和隐层之间的权值计算出来后，就可以通过求解线性方程组得到隐层和输出层之间的权值。这些权值是全局最小点。另一方面，本文算法很容易确定全局最小点时隐层神经元的个数。本文算法具有很高的训练精度和学习速度。     

源信号数目大于观察信号数目情况下的盲源分离

独立分量分析(ICA)作为一种有效的盲源分离技术(BSS）是信号处理领域的热点。传统的独立分量分析都要求观察信号数目大于或者等于源信号数目，然而对于脑电图(EEG)等的一些信号处理中存在的源信号数目大于观察信号数目的情况，传统的独立分量分析算法不能有效分离。该文针对源信号数目大于观察信号数目的情况，在传统的独立分量分析技术的基础上，给出了一个新的学习算法，并将新算法与传统的独立分量算法进行了比较。实验仿真结果证明该算法在给定2个混合信号的情况下能够较好地分离3个未知语音信号源，成功实现了源信号数目大于观察信号数目情况下的盲源分离。     

基于盲信源分离技术的雷达信号分选研究

基于雷达信号分选的实时性处理要求，提出了一种基于盲信源分离（BSS，Blind Source Sepamtion）技术的雷达信号分选算法。该算法在盲信源分离自然梯度算法的基础上，引入动态神经网络（DNN）构成分离系统，通过自适应增加或删减输出神经元个数，检测出变化着的雷达信号数目，并很好的对其进行分离。其中，增加输出神经元个数的方法很好的解决了脉冲雷达信号并非同时到达时的问题。仿真结果验证了该算法的有效性。     

盲恒模多用户检测算法的实现和性能优化

介绍了盲恒模多用户检测算法的实现方法,并针对恒模算法代价函数的特性对该算法进行了优化,在检测之前加入了预白化处理,使接收信号呈现高斯信号的特性,改善了收敛条件。仿真实验表明,与非白化处理的效果相比,预白化处理后的盲算法具有更好的性能,抗远近效应问题效果更明显,收敛速度也明显增加,更适合于实际应用。     

基于泛函连接网络和差分进化算法的后非线性混叠信号盲分离方法

把后非线性混叠信号盲分离的分离系统用泛函连接网络来建模,对分离系统的输出应用高阶统计量独立性准则作为测度,然后利用差分进化算法对泛函连接网络的权值进行学习,从而获得了一种后非线性混叠信号盲分离算法。由于泛函连接网络是一种单层神经网络,具有学习参数少、收敛速度快和非线性逼近能力强的特点;而差分进化算法控制参数少、易于选择、具有全局寻优能力和快速的收敛特性;因而与其它的后非线性混叠信号盲分离方法相比,该文提出的分离算法具有计算简单、收敛速度快、较高的精度和稳定性好的特点。仿真结果显示了这种方法是可行和有效的。     

基于GA-ELM模型的锂电池SOH预测

针对锂电池健康状态(State of Healthy,SOH)预测精度低的特点,利用遗传算法改进的极限学习机(Extreme Learning Machine,ELM)算法可提高锂电池SOH的预测精度。ELM输入层到隐含层的权值及隐含层单元的阈值随机产生,ELM算法只需设置隐含层单元的数目及隐含层激活函数类型。相比传统BP算法,ELM算法具有学习速率快、泛化性能好等优点。但由于ELM网络输入层到隐含层的权值和隐含层阈值产生的随机性,ELM算法的稳定性较差。ELM算法中引入遗传算法(GA)优化输入层到隐含层的权值和隐含层单元的阈值,该方法可增强ELM算法的稳定性。实验对比了GA-ELM算法与ELM算法、BP算法、RBF算法及SVR算法对锂电池SOH的预测,结果显示GA-ELM算法相比其他算法在预测精度和算法稳定性上均有提升。     

一种利用结构特点实现复数域联合对角化解盲源分离新算法研究及应用

联合对角化方法是求解盲源分离问题的有力工具.但是现存的联合对角化算法大都只能求解实数域盲源分离问题,且对目标矩阵有诸多限制.为了求解更具一般性的复数域盲源分离问题,提出了一种基于结构特点的联合对角化（Structural Traits Based Joint Diagonalization,STBJD）算法,既取消了预白化操作解除了对目标矩阵的正定性限制,又允许目标矩阵组为复值,具有极广的适用性.首先,引入矩阵变换,将待联合对角化的复数域目标矩阵组转化为新的具有鲜明结构特点的实对称目标矩阵组.随后,构建联合对角化最小二乘代价函数,引入交替最小二乘迭代算法求解代价函数,并在优化过程中充分挖掘所涉参量的结构特点加以利用.最终,求得混迭矩阵的估计并据此恢复源信号.仿真实验证明与现存的有代表性的对目标矩阵无特殊限制的复数域联合对角化算法FAJD算法及CVFFDIAG算法相比,STBJD算法具有更高的收敛精度,能有效地解决盲源分离问题.     

应用萤火虫算法的混沌信号盲源分离

针对现有的独立成分分析法分离混合混沌信号精度不理想的问题,提出了一种新的混沌信号盲分离方法。该方法以求解最优解混矩阵为目标,利用峭度构造目标函数,将混沌信号的盲源分离转化为一个优化问题,并用萤火虫算法求解。同时,通过预白化和正交矩阵的参数化表示降低优化问题的维数,能有效提高分离精度。仿真结果表明,无论是处理混合的混沌映射信号还是混合的混沌流信号,该方法都能快速收敛,并且其分离精度在各项实验中都优于独立成分分析法等现有的盲源分离方法。     

基于奇异值分解的超定盲信号分离

该文研究超定盲信号分离,即观测信号个数不少于源信号个数情况下的盲信号分离问题。作者 从分离矩阵的奇异值分解出发,首先提出一种基于独立分量分析的超定盲信号分离代价函数,接着推导了一般梯度学习算法。此后,借助于相对梯度的概念,证明超定盲信号分离与通常的完备盲信号分离具有相同形式的自然梯度算法。仿真试验验证了算法的有效性。     

Blind-Source Separation Based on Decorrelation and Nonstationarity

In this paper, discrete-time blind-source separation (BSS) of instantaneous mixtures is studied. Decorrelation-based sufficient criteria for BSS of stationary and nonstationary sources are derived based on nonstationarity and nonwhiteness. A gradient algorithm is proposed based on these criteria. A batch-data algorithm and an on-line algorithm are developed based on the corollaries of the BSS criteria. These algorithms are especially useful for the separation of nonstationary sources. They are robust to additive white noises if the time-delayed decorrelation and the nonstationarity of the sources are considered simultaneously in the algorithms. Experiment results show the effectiveness and performance of the proposed algorithms     

Adaptive Step-Size Natural Gradient ICA Algorithm with Weighted Orthogonalization

To improve the stability of the traditional natural gradient independent component analysis (ICA) algorithm and the accuracy of its separated results, a adaptive step-size natural gradient ICA algorithm with weighted orthogonalization is proposed. First, to take advantage of the pre-whitening pre-processing and keep the equivariance property of the ICA algorithm, based on the weighted orthogonal constraint on the separating matrix without pre-whitening of observed signals, weighted orthogonalization is introduced after the traditional gradient update. Then, according to the error estimation from the smoothed distance between separated outputs and optimal outputs, we obtain two adaptive step sizes based, respectively, on an unconstrained natural gradient ICA process and a weighted orthogonalization process. Simulation experiment results show that the speed of convergence of the adaptive step-size natural gradient ICA algorithms with weighted orthogonalization are faster than the traditional one; also, the stability of the algorithms and the accuracy of the separated results are improved observably.     

Source separation using a criterion based on second-orderstatistics

It is often assumed that blind separation of dynamically mixed sources cannot be done with second-order statistics. It is shown that separation of dynamically mixed sources indeed can be performed using second-order statistics only. A criterion based on second-order statistics for the purpose of separating crosswise mixtures is stated. The criterion is used in order to derive a gradient-based separation algorithm, as well as a Newton-type separation algorithm. The uniqueness of the solution representing the separation is also investigated. This reveals that (1) the channel system is parameter identifiable under weak conditions, and (2) if the sources have the same color, there exists at most two solutions. The local convergence behavior of the proposed algorithm is studied and reveals a sufficient condition for local convergence. Furthermore, the estimates of the channel system are shown to be consistent or to locally minimize the criterion     

基于细菌觅食的盲源分离算法研究

细菌觅食算法是一种基于细菌觅食行为的智能优化算法.盲源分离是盲信号处理的重要方面.为了提高盲源分离的有效性,根据盲源分离和细菌觅食算法的基本原理,提出了一种基于细菌觅食行为的盲源分离算法.用MATLAB对提出的这一算法进行仿真,并将其分离结果与传统独立分量分析算法的分离结果相比较.实验结果表明这是一种分离效果优于传统独立分量分析算法的有效分离算法.证明了基于细菌觅食盲源分离算法的可行性和有效性.     

Extraction of a cyclostationary source using a new cost function without pre-whitening

The proposed method aims to extract a cyclostationary source, whose cyclic frequency is a priori known, from a set of additive mixtures. The other sources may be either stationary or cyclostationary as long as their cyclic frequencies are different from that of the source to be extracted. The method does not require pre-whitening and consists in minimizing a criterion based on stationary and cyclostationary second order statistics of the observations; this method is labeled as Second Order Cyclostationary Statistics Optimization Criterion (SOC²). The relevance of this criterion is proven theoretically in the general case of N sources by P sensors, with P≥N. Other properties of the algorithm such as its accuracy and its robustness against additive noise or strong interferences are studied through a set of simulations.     

Harmonic and Percussive Separation Based on NMF and Tonality Mask

In this letter, we present a new algorithm for the harmonic and percussive separation of jazz music. Using a short‐time Fourier transform and nonnegative matrix factorization, the signal is decomposed into rank components. Each component is then split into harmonic and percussive parts using masks calculated based on their tonalities. Finally, the harmonic and percussive parts are separated after applying the masks and a summation. We evaluate the algorithm based on real audio examples using both objective and subjective assessments. The proposed algorithm performs well for the separation of harmonic and percussive parts of jazz excerpts.     

Statistical analysis of a signal separation method based onsecond-order statistics

This correspondence explores a method for separation of dynamically mixed sources, which is based on second-order statistics. Here, a statistical analysis is given of a generalized version of the original algorithm. The generalized method includes a weighting matrix, and a result of the statistical analysis is that the best possible weighting is found. In cases where the sources have similar color, the weighted algorithm significantly improves the estimates of the mixing parameters. The problem of model validation is discussed as well