基于信息向量机的神经活动分类和译码研究

利用信息向量机(IVM)算法对来自脑皮层的少量运动神经元激发率进行分类,识别出神经状态,用该神经状态指导神经元激发率的译码。将IVM算法与支持向量机算法、相关向量机算法进行实验比较,结果证明,IVM算法的神经活动分类和译码性能最优,运行时间最短。     

基于CSMDEM算法的GMM学习方法

基于Mahalanobis距离的EM(MDEM)算法存在过分裂问题。为此,提出一种竞争结束MDEM(CSMDEM)算法。该算法将最小描述长度准则作为竞争结束条件嵌入到MDEM算法中,能够在估计混合模型参数的同时选择模型阶数。实验结果表明,该算法具有较低的平均EM迭代次数,能够较好地拟合高斯混合模型。当其被应用到跳频网台分选时,能够以较高的正确率分选跳频信号。     

Pattern recognition of manufacturing process signals using Gaussian mixture models-based recognition systems

Unnatural patterns exhibited in manufacturing processes can be associated with certain assignable causes for process variation. Hence, accurate identification of various process patterns (PPs) can significantly narrow down the scope of possible causes that must be investigated, and speed up the troubleshooting process. This paper proposes a Gaussian mixture models (GMM)-based PP recognition (PPR) model, which employs a collection of several GMMs trained for PPR. By using statistical features and wavelet energy features as the input features, the proposed PPR model provides more simple training procedure and better generalization performance than using single recognizer, and hence is easier to be used by quality engineers and operators. Furthermore, the proposed model is capable of adapting novel PPs through using a dynamic modeling scheme. The simulation results indicate that the GMM-based PPR model shows good detection and recognition of current PPs and adapts further novel PPs effectively. Analysis from this study provides guidelines in developing GMM – based SPC recognition systems.     

Almost sure limit theorems for the maxima of some strongly dependent Gaussian sequences

We proved some almost sure limit theorems for standard strongly dependent Gaussian sequences in nonstationary cases under some mild conditions.     

Visual quality recognition of nonwovens using generalized Gaussian density model and robust Bayesian neural network

This work is dedicated to develop an algorithm for the visual quality recognition of nonwoven materials, in which image analysis and neural network are involved in feature extraction and pattern recognition stage, respectively. During the feature extraction stage, each image is decomposed into four levels using the 9-7 bi-orthogonal wavelet base. Then the wavelet coefficients in each subband are independently modeled by the generalized Gaussian density (GGD) model to calculate the scale and shape parameters with maximum likelihood (ML) estimator as texture features. While for the recognition stage, the robust Bayesian neural network is employed to classify the 625 nonwoven samples into five visual quality grades, i.e., 125 samples for each grade. Finally, we carry out the outlier detection of the training set using the outlier probability and select the most suitable model structure and parameters from 40 Bayesian neural networks using the Occam's razor. When 18 relevant textural features are extracted for each sample based on the GGD model, the average recognition accuracy of the test set arranges from 88% to 98.4% according to the different number of the hidden neurons in the Bayesian neural network.     

MELM-GRBF: A modified version of the extreme learning machine for generalized radial basis function neural networks

In this paper, we propose a methodology for training a new model of artificial neural network called the generalized radial basis function (GRBF) neural network. This model is based on generalized Gaussian distribution, which parametrizes the Gaussian distribution by adding a new parameter τ. The generalized radial basis function allows different radial basis functions to be represented by updating the new parameter τ. For example, when GRBF takes a value of τ=2, it represents the standard Gaussian radial basis function. The model parameters are optimized through a modified version of the extreme learning machine (ELM) algorithm. In the methodology proposed (MELM-GRBF), the centers of each GRBF were taken randomly from the patterns of the training set and the radius and τ values were determined analytically, taking into account that the model must fulfil two constraints: locality and coverage. An thorough experimental study is presented to test its overall performance. Fifteen datasets were considered, including binary and multi-class problems, all of them taken from the UCI repository. The MELM-GRBF was compared to ELM with sigmoidal, hard-limit, triangular basis and radial basis functions in the hidden layer and to the ELM-RBF methodology proposed by Huang et al. (2004) [1]. The MELM-GRBF obtained better results in accuracy than the corresponding sigmoidal, hard-limit, triangular basis and radial basis functions for almost all datasets, producing the highest mean accuracy rank when compared with these other basis functions for all datasets.     

Gaussian kernel optimization: Complex problem and a simple solution

The Gaussian kernel function implicitly defines the feature space of an algorithm and plays an essential role in the application of kernel methods. The parameter of Gaussian kernel function is a scalar that has significant influences on final results. However, until now, it is still unclear how to choose an optimal kernel parameter. In this paper, we propose a novel data-driven method to optimize the Gaussian kernel parameter, which only depends on the original dataset distribution and yields a simple solution to this complex problem. The proposed method is task irrelevant and can be used in any Gaussian kernel-based approach, including supervised and unsupervised machine learning. Simulation experiments demonstrate the efficacy of the obtained results. A user-friendly online calculator is implemented at: www.csbio.sjtu.edu.cn/bioinf/kernel/ for public use.     

Dynamical systems identification using Gaussian process models with incorporated local models

Gaussian process (GP) models form an emerging methodology for modelling nonlinear dynamic systems which tries to overcome certain limitations inherent to traditional methods such as e.g. neural networks (ANN) or local model networks (LMN).The GP model seems promising for three reasons. First, less training parameters are needed to parameterize the model. Second, the variance of the model's output depending on data positioning is obtained. Third, prior knowledge, e.g. in the form of linear local models can be included into the model. In this paper the focus is on GP with incorporated local models as the approach which could replace local models network.Much of the effort up to now has been spent on the development of the methodology of the GP model with included local models, while no application and practical validation has yet been carried out. The aim of this paper is therefore twofold. The first aim is to present the methodology of the GP model identification with emphasis on the inclusion of the prior knowledge in the form of linear local models. The second aim is to demonstrate practically the use of the method on two higher order dynamical systems, one based on simulation and one based on measurement data.     

用于多个机动目标的混合高斯概率假设密度跟踪器

现有的混合高斯概率假设密度（GM—PHD）跟踪器不仅可以估计时变的多目标状态,还能辨识不同目标并保持其轨迹连续性．但当多个目标发生机动时,其稳定性较差,容易丢失目标．针对这一问题,本文提出一种能跟踪多个机动目标的混合高斯概率假设密度跟踪器算法．算法在GM—PHD滤波的框架上采用修正的输入估计方法将目标的概率假设密度（PHD）表示成混合高斯形式,并利用不同的标记辨识各个高斯分量,然后通过PHD滤波方程迭代这些高斯分量和对应的标记,最终达到跟踪多个机动目标的目的．仿真实验表明,和传统的GM—PHD跟踪器相比．新算法能以更高的稳定性跟踪多个机动目标．     

一种基于联合轮廓特征矢量的目标识别方法

针对基于形状特征进行目标识别的方法存在的不足,提出一种联合轮廓不变矩特征和轮廓几何特征的识别方法;针对不同的待识别目标,采集足够数量的训练样本,统计每一个轮廓特征的均值、标准差和变异系数;并据此对这些轮廓特征进行动态筛选和加权,建立起待识别目标的联合轮廓特征矢量模型.在线识别时,提取场景目标的联合轮廓特征矢量,对其进行...