SpikeTools:用于神经元网络锋电位分类的软件

使用多电极阵列可无损的记录神经元网络的电活动，但是单个电极往往会同时记录到多个神经元的活动，因而需要将所记录的信号进行分类。本文通过幅度、形状、主成分等分类方法与聚类方法实现了对锋电位的分类，并在MATLAB平台下编写了相应的可视化软件spike Tools对模拟数据的分类结果表明：均有90％以上的锋电位得以正确归类。对实验数据的分类结果表明：阈值分类方法能对幅值有明显区别的锋电位进行合理分类，形状分类方法能对幅值接近的锋电位进行分类，而主成分分类方法区分波形的整体差异，能分离前两种方法难以区别的类；聚类方法可实现自动分类。开发的spike Tools软件能对各种锋电位群数据进行分类处理，为锋电位信号的分析提供了有力的工具。     

Tied factor analysis for face recognition across large pose differences

Face recognition algorithms perform very unreliably when the pose of the probe face is different from the gallery face: typical feature vectors vary more with pose than with identity. We propose a generative model that creates a one-to-many mapping from an idealized "identity" space to the observed data space. In identity space, the representation for each individual does not vary with pose. We model the measured feature vector as being generated by a pose-contingent linear transformation of the identity variable in the presence of Gaussian noise. We term this model "tied" factor analysis. The choice of linear transformation (factors) depends on the pose, but the loadings are constant (tied) for a given individual. We use the EM algorithm to estimate the linear transformations and the noise parameters from training data. We propose a probabilistic distance metric which allows a full posterior over possible matches to be established. We introduce a novel feature extraction process and investigate recognition performance using the FERET, XM2VTS and PIE databases. Recognition performance compares favourably to contemporary approaches.     

Spike train decoding without spike sorting

We propose a novel paradigm for spike train decoding, which avoids entirely spike sorting based on waveform measurements. This paradigm directly uses the spike train collected at recording electrodes from thresholding the bandpassed voltage signal. Our approach is a paradigm, not an algorithm, since it can be used with any of the current decoding algorithms, such as population vector or likelihood-based algorithms. Based on analytical results and an extensive simulation study, we show that our paradigm is comparable to, and sometimes more efficient than, the traditional approach based on well-isolated neurons and that it remains efficient even when all electrodes are severely corrupted by noise, a situation that would render spike sorting particularly difficult. Our paradigm will also save time and computational effort, both of which are crucially important for successful operation of real-time brain-machine interfaces. Indeed, in place of the lengthy spike-sorting task of the traditional approach, it involves an exact expectation EM algorithm that is fast enough that it could also be left to run during decoding to capture potential slow changes in the states of the neurons.     

Unsupervised spike detection and sorting with wavelets and superparamagnetic clustering

This study introduces a new method for detecting and sorting spikes from multiunit recordings. The method combines the wavelet transform, which localizes distinctive spike features, with superparamagnetic clustering, which allows automatic classification of the data without assumptions such as low variance or gaussian distributions. Moreover, an improved method for setting amplitude thresholds for spike detection is proposed. We describe several criteria for implementation that render the algorithm unsupervised and fast. The algorithm is compared to other conventional methods using several simulated data sets whose characteristics closely resemble those of in vivo recordings. For these data sets, we found that the proposed algorithm outperformed conventional methods.     

An application of reversible-jump Markov chain Monte Carlo to spike classification of multi-unit extracellular recordings

Multi-electrode recordings in neural tissue contain the action potential waveforms of many closely spaced neurons. While we can observe the action potential waveforms, we cannot observe which neuron is the source for which waveform nor how many source neurons are being recorded. Current spike-sorting algorithms solve this problem by assuming a fixed number of source neurons and assigning the action potentials given this fixed number. We model the spike waveforms as an anisotropic Gaussian mixture model and present, as an alternative, a reversible-jump Markov chain Monte Carlo (MCMC) algorithm to simultaneously estimate the number of source neurons and to assign each action potential to a source. We derive this MCMC algorithm and illustrate its application using simulated three-dimensional data and real four-dimensional feature vectors extracted from tetrode recordings of rat entorhinal cortex neurons. In the analysis of the simulated data our algorithm finds the correct number of mixture components (sources) and classifies the action potential waveforms with minimal error. In the analysis of real data, our algorithm identifies clusters closely resembling those previously identified by a user-dependent graphical clustering procedure. Our findings suggest that a reversible-jump MCMC algorithm could offer a new strategy for designing automated spike-sorting algorithms.     

Spikernels: predicting arm movements by embedding population spike rate patterns in inner-product spaces

Inner-product operators, often referred to as kernels in statistical learning, define a mapping from some input space into a feature space. The focus of this letter is the construction of biologically motivated kernels for cortical activities. The kernels we derive, termed Spikernels, map spike count sequences into an abstract vector space in which we can perform various prediction tasks. We discuss in detail the derivation of Spikernels and describe an efficient algorithm for computing their value on any two sequences of neural population spike counts. We demonstrate the merits of our modeling approach by comparing the Spikernel to various standard kernels in the task of predicting hand movement velocities from cortical recordings. All of the kernels that we tested in our experiments outperform the standard scalar product used in linear regression, with the Spikernel consistently achieving the best performance.     

神经元动作电位模式分类的小波时频分析方法

对神经元动作电位进行模式分类是植入式脑机接口研究的前期关键问题。考虑到来自不同神经元的动作电位在时域或频域特征上的相似性,引入小波分析在时频域上对动作电位进行特征描述。首先以db、sym、bior三类小波函数系为例,分别获取了动作电位的高维小波系数特征;然后对特征分量进行非正态分布特性的KS检验,以实现特征降维;最后通过非监督的K均值方法完成动作电位聚类。实验结果表明：在神经信号噪声水平为0.05dB、0.1dB和0.15dB时,各小波基的分类性能略有不同。其中sym5小波性能突出,动作电位错分率基本稳定在1.21%～181%。最后与主成分分析法(PCA)进行了分类性能的比较,进一步证实了小波时频分析方法(sym5小波)在抗干扰性和稳定性方面的优势。     

Structure Choice for Relations between Objects in Metric Classification Algorithms

We analyze the cluster structure of learning samples, decomposing class objects into disjoint groups. Decomposition results are used for the computation of the compactness measure for the sample and its minimal coverage by standard objects. We show that the number of standard objects depends on the metric choice, the distance to noise objects, the scales of the feature measurements, and nonlinear transformations of the feature space. We experimentally prove that the set of standards of the minimal coverage and noise objects affect the algorithm generalizing ability.     

Surface mesh denoising with normal tensor framework

In this paper, we propose a novel method for feature-preserving mesh denoising based on the normal tensor framework. We utilize the normal tensor voting directly for the mesh denoising whose eigenvalues and eigenvectors are used for detecting saliency, and introduce an algorithm that updates a vertex by the Laplacian of curvature which minimizes a difference of the curvature in one neighborhood. By connecting the feature saliency with a distance metric in the normal tensor space, our algorithm preserves sharp features more robustly and clearly for noisy mesh data. Comparing our method with the existing ones, we demonstrate the effectiveness of our algorithm against some synthetic noisy data and real-world scanned data.     

具有容噪特性的C4.5算法改进

针对有噪声的高维数据引起决策树预测准确率下降的问题,利用容噪主成分分析(Noise-free Principal Component Anlysis,NFPCA)算法思想对C4.5算法改进而形成NFPCA-in-C4.5算法。该算法一方面将高维数据噪声控制问题转化为拟合数据特征与控制平滑度相结合的最优化问题,从而获得主成分空间;另一方面在决策树自顶向下构建新节点的过程中,再将主成分空间恢复到原始数据空间来避免降维过程中属性特征信息永久消失。实验结果表明NFPCA-in-C4.5算法兼具降维和容噪功能,避免了降维中由特征信息损失和噪声残留造成的预测模型准确率大幅降低的问题。     

Fault detection and diagnosis in process data using one-class support vector machines

In this paper, a new approach for fault detection and diagnosis based on One-Class Support Vector Machines (1-class SVM) has been proposed. The approach is based on a non-linear distance metric measured in a feature space. Just as in principal components analysis (PCA) and dynamic principal components analysis (DPCA), appropriate distance metrics and thresholds have been developed for fault detection. Fault diagnosis is then carried out using the SVM-recursive feature elimination (SVM-RFE) feature selection method. The efficacy of this method is demonstrated by applying it on the benchmark Tennessee Eastman problem and on an industrial real-time Semiconductor etch process dataset. The algorithm has been compared with conventional techniques such as PCA and DPCA in terms of performance measures such as false alarm rates, detection latency and fault detection rates. It is shown that the proposed algorithm outperformed PCA and DPCA both in terms of detection and diagnosis of faults.     

基于局部保持投影的神经尖峰电位特征提取与分类

神经元尖峰电位的识别和分类,是神经信息处理中的关键环节之一,而尖峰电位的特征提取是识别和分类的重要基础。针对尖峰电位的特征提取和分类,提出一种基于局部保持投影(LPP)的无监督算法,对近邻参数进行了自动识别和选择,使用基于原型向量的分布离散度标准,尖峰电位的特征得到充分提取和分离。仿真和实际数据实验结果表明：基于局部保持投影的无监督特征提取和分类算法,比传统主成分分析(PCA)方法能更加有效地实现特征提取和分离。     

Spike sorting based on radial basis function network with overlap decomposition

Spike sorting is the essential step in analyzing recording spike signals for studying information processing mechanisms within the nervous system. Overlapping is one of the most serious problems in the spike sorting for multi-channel recordings. In this paper, a modified radial basis function (RBF) network is proposed to decompose the overlapping signals and separate spikes within the same RBF network. A modified radial basis function based on the Gaussian function is employed in the method to improve the accuracy of overlap decomposition. In addition, the improved constructing algorithm reduces the calculation cost by taking advantage of the symmetry of the RBF network. The performance of the presented method is tested at various signal-to-noise ratio levels based on simulated data coming from the University of Leicester and Wave-clus software. Experiment results show that our method successfully solves the fully overlapping problem and has higher accuracy comparing with the Gaussian function.     

一种基于ELM-AE特征表示的谱聚类算法

在实际应用中,数据点中包含的冗余特征和异常值(噪声)严重影响了聚类中更显著的特征的发现,大大降低了聚类性能。本文提出了一种基于ELM-AE (extreme learning machine as autoencoder)特征表示的谱聚类算法(spectral clustering via extreme learning machine as autoencoder, SC-ELM-AE)。ELM-AE通过奇异值分解学习源数据主要特征表示,使用输出权值实现从特征空间到原输入数据的重构;再将该特征表示空间作为输入进行谱聚类。实验表明,在5个UCI数据集验证中,SC-ELM-AE算法性能优于传统的K-Means、谱聚类等现有算法,特别是在复杂高维数据集PEMS-SF和TDT2_10上,聚类平均精确度均提高30%以上。     

Nonlinear Dimensionality Reduction by Topologically Constrained Isometric Embedding

Many manifold learning procedures try to embed a given feature data into a flat space of low dimensionality while preserving as much as possible the metric in the natural feature space. The embedding process usually relies on distances between neighboring features, mainly since distances between features that are far apart from each other often provide an unreliable estimation of the true distance on the feature manifold due to its non-convexity. Distortions resulting from using long geodesics indiscriminately lead to a known limitation of the Isomap algorithm when used to map non-convex manifolds. Presented is a framework for nonlinear dimensionality reduction that uses both local and global distances in order to learn the intrinsic geometry of flat manifolds with boundaries. The resulting algorithm filters out potentially problematic distances between distant feature points based on the properties of the geodesics connecting those points and their relative distance to the boundary of the feature manifold, thus avoiding an inherent limitation of the Isomap algorithm. Since the proposed algorithm matches non-local structures, it is robust to strong noise. We show experimental results demonstrating the advantages of the proposed approach over conventional dimensionality reduction techniques, both global and local in nature.     

An adaptive memetic algorithm for feature selection using proximity graphs

We propose a multivariate feature selection method that uses proximity graphs for assessing the quality of feature subsets. Initially, a complete graph is built, where nodes are the samples, and edge weights are calculated considering only the selected features. Next, a proximity graph is constructed on the basis of these weights and different fitness functions, calculated over the proximity graph, to evaluate the quality of the selected feature set. We propose an iterative methodology on the basis of a memetic algorithm for exploring the space of possible feature subsets aimed at maximizing a quality score. We designed multiple local search strategies, and we used an adaptive strategy for automatic balancing between the global and local search components of the memetic algorithm. The computational experiments were carried out using four well‐known data sets. We investigate the suitability of three different proximity graphs (minimum spanning tree, k‐nearest neighbors, and relative neighborhood graph) for the proposed approach. The selected features have been evaluated using a total of 49 classification methods from an open‐source data mining and machine learning package (WEKA). The computational results show that the proposed adaptive memetic algorithm can perform better than traditional genetic algorithms in finding more useful feature sets. Finally, we establish the competitiveness of our approach by comparing it with other well‐known feature selection methods.     

融合直接度量和间接度量的行人再识别

当前行人再识别的度量算法在计算相似性时主要依据两幅图像自身的判别信息(直接度量),较少依据与两幅图像相关的其它图像的判别信息(间接度量).针对此种情况,文中提出加权融合直接度量和间接度量的度量方法.首先提取图像的局部最大概率特征和突出性颜色名称特征,融合两者作为图像的最终特征.然后分别计算两幅图像的直接相似性和间接相似性,利用序列排序方法对数据库样本进行训练,得到权值参数,从而得到两幅图像的最终相似性.在Market-1501数据库和CUHK03数据库上的实验表明,融合后的度量识别能力明显高于单个度量的识别能力.     

Classification of gene-expression data: The manifold-based metric learning way

Classification of microarray gene-expression data can potentially help medical diagnosis, and becomes an important topic in bioinformatics. However, microarray data sets are usually of small sample size relative to an overwhelming number of genes. This makes the classification problem fairly challenging. Instance-based learning (IBL) algorithms, such as nearest neighbor (k-NN), are usually the baseline algorithm due to their simplicity. However, practices show that k-NN performs not very well in this field. This paper introduces manifold-based metric learning to improve the performance of IBL methods. A novel metric learning algorithm is proposed by utilizing both local manifold structural information and local discriminant information. In addition, a random subspace extension is also presented. We apply the proposed algorithm to the gene-classification problem in three ways: one in the original feature space, another in the reduced feature space, and the third via the random subspace extension. Statistical evaluation shows that the proposed algorithm can achieve promising results, and gain significant performance improvement over traditional IBL algorithms.