Precise-Spike-Driven Synaptic Plasticity: Learning Hetero-Association of Spatiotemporal Spike Patterns

A new learning rule (Precise-Spike-Driven (PSD) Synaptic Plasticity) is proposed for processing and memorizing spatiotemporal patterns. PSD is a supervised learning rule that is analytically derived from the traditional Widrow-Hoff rule and can be used to train neurons to associate an input spatiotemporal spike pattern with a desired spike train. Synaptic adaptation is driven by the error between the desired and the actual output spikes, with positive errors causing long-term potentiation and negative errors causing long-term depression. The amount of modification is proportional to an eligibility trace that is triggered by afferent spikes. The PSD rule is both computationally efficient and biologically plausible. The properties of this learning rule are investigated extensively through experimental simulations, including its learning performance, its generality to different neuron models, its robustness against noisy conditions, its memory capacity, and the effects of its learning parameters. Experimental results show that the PSD rule is capable of spatiotemporal pattern classification, and can even outperform a well studied benchmark algorithm with the proposed relative confidence criterion. The PSD rule is further validated on a practical example of an optical character recognition problem. The results again show that it can achieve a good recognition performance with a proper encoding. Finally, a detailed discussion is provided about the PSD rule and several related algorithms including tempotron, SPAN, Chronotron and ReSuMe.     

Improved measures of phase-coupling between spikes and the Local Field Potential

An important tool to study rhythmic neuronal synchronization is provided by relating spiking activity to the Local Field Potential (LFP). Two types of interdependent spike-LFP measures exist. The first approach is to directly quantify the consistency of single spike-LFP phases across spikes, referred to here as point-field phase synchronization measures. We show that conventional point-field phase synchronization measures are sensitive not only to the consistency of spike-LFP phases, but are also affected by statistical dependencies between spike-LFP phases, caused by e.g. non-Poissonian history-effects within spike trains such as bursting and refractoriness. To solve this problem, we develop a new pairwise measure that is not biased by the number of spikes and not affected by statistical dependencies between spike-LFP phases. The second approach is to quantify, similar to EEG-EEG coherence, the consistency of the relative phase between spike train and LFP signals across trials instead of across spikes, referred to here as spike train to field phase synchronization measures. We demonstrate an analytical relationship between point-field and spike train to field phase synchronization measures. Based on this relationship, we prove that the spike train to field pairwise phase consistency (PPC), a quantity closely related to the squared spike-field coherence, is a monotonically increasing function of the number of spikes per trial. This derived relationship is exact and analytic, and takes a linear form for weak phase-coupling. To solve this problem, we introduce a corrected version of the spike train to field PPC that is independent of the number of spikes per trial. Finally, we address the problem that dependencies between spike-LFP phase and the number of spikes per trial can cause spike-LFP phase synchronization measures to be biased by the number of trials. We show how to modify the developed point-field and spike train to field phase synchronization measures in order to make them unbiased by the number of trials.     

An online spike detection and spike classification algorithm capable of instantaneous resolution of overlapping spikes

For the analysis of neuronal cooperativity, simultaneously recorded extracellular signals from neighboring neurons need to be sorted reliably by a spike sorting method. Many algorithms have been developed to this end, however, to date, none of them manages to fulfill a set of demanding requirements. In particular, it is desirable to have an algorithm that operates online, detects and classifies overlapping spikes in real time, and that adapts to non-stationary data. Here, we present a combined spike detection and classification algorithm, which explicitly addresses these issues. Our approach makes use of linear filters to find a new representation of the data and to optimally enhance the signal-to-noise ratio. We introduce a method called “Deconfusion” which de-correlates the filter outputs and provides source separation. Finally, a set of well-defined thresholds is applied and leads to simultaneous spike detection and spike classification. By incorporating a direct feedback, the algorithm adapts to non-stationary data and is, therefore, well suited for acute recordings. We evaluate our method on simulated and experimental data, including simultaneous intra/extra-cellular recordings made in slices of a rat cortex and recordings from the prefrontal cortex of awake behaving macaques. We compare the results to existing spike detection as well as spike sorting methods. We conclude that our algorithm meets all of the mentioned requirements and outperforms other methods under realistic signal-to-noise ratios and in the presence of overlapping spikes.     

脑电信号数据压缩及棘波识别的小波神经网络方法

本文在对小波神经网络及其算法研究的基础上,提出了一种对脑电信号压缩表达和痫样脑电棘波识别的新方法。实验结果显示,小波网络在大量压缩数据的同时,能够较好的恢复原有信号,另外,在脑电信号的时频谱等高线图上,得到了易于自动识别的棘波和棘慢复合波特征,说明此方法在电生理信号处理和时频分析方面有着光明的应用前景。     

Simulating Discrete and Rhythmic Multi-joint Human Arm Movements by Optimization of Nonlinear Performance Indices

An optimization approach applied to mechanical linkage models is used to simulate human arm movements. Predicted arm trajectories are the result of minimizing a nonlinear performance index that depends on kinematic or dynamic variables of the movement. A robust optimization algorithm is presented that computes trajectories which satisfy the necessary conditions with high accuracy. It is especially adapted to the analysis of discrete and rhythmic movements. The optimization problem is solved by parameterizing each generalized coordinate (e.g., joint angular displacement) in terms of Jacobi polynomials and Fourier series, depending on whether discrete or rhythmic movements are considered, combined with a multiple shooting algorithm. The parameterization of coordinates has two advantages. First, it provides an initial guess for the multiple shooting algorithm which solves the optimization problem with high accuracy. Second, it leads to a low dimensional representation of discrete and rhythmic movements in terms of expansion coefficients. The selection of a suitable feature space is an important prerequisite for comparison, recognition and classification of movements. In addition, the separate computational analysis of discrete and rhythmic movements is motivated by their distinct neurophysiological realizations in the cortex. By investigating different performance indices subject to different boundary conditions, the approach can be used to examine possible strategies that humans adopt in selecting specific arm motions for the performance of different tasks in a plane and in three-dimensional space.     

多通道神经元锋电位检测和分类的新方法

大脑神经元胞外单细胞动作电位(即锋电位)的检测和分类是提取神经元脉冲序列、研究神经系统信息处理机制的关键．为了提高锋电位的检出率和分类的正确性,设计了一种处理多通道锋电位记录信号的算法,用于分析微电极阵列记录的大鼠海马神经元锋电位信号,电极阵列上的测量点排列紧密,4个通道可以同时记录到来自相同神经元的信号．该算法首先利用一种多通道阈值检测法检出四通道记录信号中的锋电位,然后利用一种基于复合锋电位的主成分特征参数分类法将锋电位分类．仿真数据和实验记录信号的检验结果表明：与相应的单通道算法相比,该算法的锋电位检出率和分类的正确性显著提高,并且可以增加单次实验测得的神经元数目．因此,该算法为实现神经元锋电位的自动检测提供了一种简单有效的新 方法．     

Studying spike trains using a van Rossum metric with a synapse-like filter

Spike trains are unreliable. For example, in the primary sensory areas, spike patterns and precise spike times will vary between responses to the same stimulus. Nonetheless, information about sensory inputs is communicated in the form of spike trains. A challenge in understanding spike trains is to assess the significance of individual spikes in encoding information. One approach is to define a spike train metric, allowing a distance to be calculated between pairs of spike trains. In a good metric, this distance will depend on the information the spike trains encode. This method has been used previously to calculate the timescale over which the precision of spike times is significant. Here, a new metric is constructed based on a simple model of synaptic conductances which includes binding site depletion. Including binding site depletion in the metric means that a given individual spike has a smaller effect on the distance if it occurs soon after other spikes. The metric proves effective at classifying neuronal responses by stimuli in the sample data set of electro-physiological recordings from the primary auditory area of the zebra finch fore-brain. This shows that this is an effective metric for these spike trains suggesting that in these spike trains the significance of a spike is modulated by its proximity to previous spikes. This modulation is a putative information-coding property of spike trains.     

The chronotron: a neuron that learns to fire temporally precise spike patterns

In many cases, neurons process information carried by the precise timings of spikes. Here we show how neurons can learn to generate specific temporally precise output spikes in response to input patterns of spikes having precise timings, thus processing and memorizing information that is entirely temporally coded, both as input and as output. We introduce two new supervised learning rules for spiking neurons with temporal coding of information (chronotrons), one that provides high memory capacity (E-learning), and one that has a higher biological plausibility (I-learning). With I-learning, the neuron learns to fire the target spike trains through synaptic changes that are proportional to the synaptic currents at the timings of real and target output spikes. We study these learning rules in computer simulations where we train integrate-and-fire neurons. Both learning rules allow neurons to fire at the desired timings, with sub-millisecond precision. We show how chronotrons can learn to classify their inputs, by firing identical, temporally precise spike trains for different inputs belonging to the same class. When the input is noisy, the classification also leads to noise reduction. We compute lower bounds for the memory capacity of chronotrons and explore the influence of various parameters on chronotrons' performance. The chronotrons can model neurons that encode information in the time of the first spike relative to the onset of salient stimuli or neurons in oscillatory networks that encode information in the phases of spikes relative to the background oscillation. Our results show that firing one spike per cycle optimizes memory capacity in neurons encoding information in the phase of firing relative to a background rhythm.     

Estimating Extracellular Spike Waveforms from CA1 Pyramidal Cells with Multichannel Electrodes

Extracellular (EC) recordings of action potentials from the intact brain are embedded in background voltage fluctuations known as the “local field potential” (LFP). In order to use EC spike recordings for studying biophysical properties of neurons, the spike waveforms must be separated from the LFP. Linear low-pass and high-pass filters are usually insufficient to separate spike waveforms from LFP, because they have overlapping frequency bands. Broad-band recordings of LFP and spikes were obtained with a 16-channel laminar electrode array (silicone probe). We developed an algorithm whereby local LFP signals from spike-containing channel were modeled using locally weighted polynomial regression analysis of adjoining channels without spikes. The modeled LFP signal was subtracted from the recording to estimate the embedded spike waveforms. We tested the method both on defined spike waveforms added to LFP recordings, and on in vivo-recorded extracellular spikes from hippocampal CA1 pyramidal cells in anaesthetized mice. We show that the algorithm can correctly extract the spike waveforms embedded in the LFP. In contrast, traditional high-pass filters failed to recover correct spike shapes, albeit produceing smaller standard errors. We found that high-pass RC or 2-pole Butterworth filters with cut-off frequencies below 12.5 Hz, are required to retrieve waveforms comparable to our method. The method was also compared to spike-triggered averages of the broad-band signal, and yielded waveforms with smaller standard errors and less distortion before and after the spike.     

Statistical characteristics of climbing fiber spikes necessary for efficient cerebellar learning

 Mean firing rates (MFRs), with analogue values, have thus far been used as information carriers of neurons in most brain theories of learning. However, the neurons transmit the signal by spikes, which are discrete events. The climbing fibers (CFs), which are known to be essential for cerebellar motor learning, fire at the ultra-low firing rates (around 1 Hz), and it is not yet understood theoretically how high-frequency information can be conveyed and how learning of smooth and fast movements can be achieved. Here we address whether cerebellar learning can be achieved by CF spikes instead of conventional MFR in an eye movement task, such as the ocular following response (OFR), and an arm movement task. There are two major afferents into cerebellar Purkinje cells: parallel fiber (PF) and CF, and the synaptic weights between PFs and Purkinje cells have been shown to be modulated by the stimulation of both types of fiber. The modulation of the synaptic weights is regulated by the cerebellar synaptic plasticity. In this study we simulated cerebellar learning using CF signals as spikes instead of conventional MFR. To generate the spikes we used the following four spike generation models: (1) a Poisson model in which the spike interval probability follows a Poisson distribution, (2) a gamma model in which the spike interval probability follows the gamma distribution, (3) a max model in which a spike is generated when a synaptic input reaches maximum, and (4) a threshold model in which a spike is generated when the input crosses a certain small threshold. We found that, in an OFR task with a constant visual velocity, learning was successful with stochastic models, such as Poisson and gamma models, but not in the deterministic models, such as max and threshold models. In an OFR with a stepwise velocity change and an arm movement task, learning could be achieved only in the Poisson model. In addition, for efficient cerebellar learning, the distribution of CF spike-occurrence time after stimulus onset must capture at least the first, second and third moments of the temporal distribution of error signals. Received: 28 January 2000 / Accepted in revised form: 2 August 2000     

Evaluation of the effect of stent strut profile on shear stress distribution using statistical moments

A recently developed machine learning algorithm referred to as Extreme Learning Machine (ELM) was used to classify machine control commands out of time series of spike trains of ensembles of CA1 hippocampus neurons (n = 34) of a rat, which was performing a target-to-goal task on a two-dimensional space through a brain-machine interface system. Performance of ELM was analyzed in terms of training time and classification accuracy. The results showed that some processes such as class code prefix, redundancy code suffix and smoothing effect of the classifiers' outputs could improve the accuracy of classification of robot control commands for a brain-machine interface system.     

An information-geometric framework for statistical inferences in the neural spike train space

Statistical inferences are essentially important in analyzing neural spike trains in computational neuroscience. Current approaches have followed a general inference paradigm where a parametric probability model is often used to characterize the temporal evolution of the underlying stochastic processes. To directly capture the overall variability and distribution in the space of the spike trains, we focus on a data-driven approach where statistics are defined and computed in the function space in which spike trains are viewed as individual points. To this end, we at first develop a parametrized family of metrics that takes into account different warpings in the time domain and generalizes several currently used spike train distances. These new metrics are essentially penalized L ^p norms, involving appropriate functions of spike trains, with penalties associated with time-warping. The notions of means and variances of spike trains are then defined based on the new metrics when p = 2 (corresponding to the “Euclidean distance”). Using some restrictive conditions, we present an efficient recursive algorithm, termed Matching-Minimization algorithm, to compute the sample mean of a set of spike trains with arbitrary numbers of spikes. The proposed metrics as well as the mean spike trains are demonstrated using simulations as well as an experimental recording from the motor cortex. It is found that all these methods achieve desirable performance and the results support the success of this novel framework.     

Classification using sparse representations: a biologically plausible approach

Representing signals as linear combinations of basis vectors sparsely selected from an overcomplete dictionary has proven to be advantageous for many applications in pattern recognition, machine learning, signal processing, and computer vision. While this approach was originally inspired by insights into cortical information processing, biologically plausible approaches have been limited to exploring the functionality of early sensory processing in the brain, while more practical applications have employed non-biologically plausible sparse coding algorithms. Here, a biologically plausible algorithm is proposed that can be applied to practical problems. This algorithm is evaluated using standard benchmark tasks in the domain of pattern classification, and its performance is compared to a wide range of alternative algorithms that are widely used in signal and image processing. The results show that for the classification tasks performed here, the proposed method is competitive with the best of the alternative algorithms that have been evaluated. This demonstrates that classification using sparse representations can be performed in a neurally plausible manner, and hence, that this mechanism of classification might be exploited by the brain.     

Span: spike pattern association neuron for learning spatio-temporal spike patterns

Spiking Neural Networks (SNN) were shown to be suitable tools for the processing of spatio-temporal information. However, due to their inherent complexity, the formulation of efficient supervised learning algorithms for SNN is difficult and remains an important problem in the research area. This article presents SPAN - a spiking neuron that is able to learn associations of arbitrary spike trains in a supervised fashion allowing the processing of spatio-temporal information encoded in the precise timing of spikes. The idea of the proposed algorithm is to transform spike trains during the learning phase into analog signals so that common mathematical operations can be performed on them. Using this conversion, it is possible to apply the well-known Widrow-Hoff rule directly to the transformed spike trains in order to adjust the synaptic weights and to achieve a desired input/output spike behavior of the neuron. In the presented experimental analysis, the proposed learning algorithm is evaluated regarding its learning capabilities, its memory capacity, its robustness to noisy stimuli and its classification performance. Differences and similarities of SPAN regarding two related algorithms, ReSuMe and Chronotron, are discussed.     

Feature Selection for Speech Emotion Recognition in Spanish and Basque: On the Use of Machine Learning to Improve Human-Computer Interaction

Study of emotions in human–computer interaction is a growing research area. This paper shows an attempt to select the most significant features for emotion recognition in spoken Basque and Spanish Languages using different methods for feature selection. RekEmozio database was used as the experimental data set. Several Machine Learning paradigms were used for the emotion classification task. Experiments were executed in three phases, using different sets of features as classification variables in each phase. Moreover, feature subset selection was applied at each phase in order to seek for the most relevant feature subset. The three phases approach was selected to check the validity of the proposed approach. Achieved results show that an instance-based learning algorithm using feature subset selection techniques based on evolutionary algorithms is the best Machine Learning paradigm in automatic emotion recognition, with all different feature sets, obtaining a mean of 80,05% emotion recognition rate in Basque and a 74,82% in Spanish. In order to check the goodness of the proposed process, a greedy searching approach (FSS-Forward) has been applied and a comparison between them is provided. Based on achieved results, a set of most relevant non-speaker dependent features is proposed for both languages and new perspectives are suggested.     

Unsupervised classification of noisy chromosomes

MOTIVATION: Almost all methods of chromosome recognition assume supervised training; i.e. we are given correctly classified chromosomes to start the training phase. Noise, if any, is confined only in the representation of the chromosomes and not in the classification of the chromosomes. During the recognition phase, the problem is simply to calculate the string edit distance of the unknowns to the representatives chosen from the training phase and classify the unknowns accordingly. RESULTS: In this paper, a general method to tackle the difficult unsupervised induction problem is described. The success of the method is demonstrated by showing how the inductive agent learns weights in a dynamic manner that allows it to distinguish between noisy median and telocentric chromosomes without knowing their proper labels. The process of learning is characterized as the process of finding the right distance function, i.e. the distance function that can nicely separate the classes.     

Automatic classification of electrocardiogram signals based on transfer learning and continuous wavelet transform

Classification and subsequent diagnosis of cardiac arrhythmias is an important research topic in clinical practice. Confirmation of the type of arrhythmia at an early stage is critical for reducing the risk and occurrence of cardiovascular events. Nevertheless, diagnoses must be confirmed by a combination of specialist experience and electrocardiogram (ECG) examination, which can lead to delays in diagnosis. To overcome such obstacles, this study proposes an automatic ECG classification algorithm based on transfer learning and continuous wavelet transform (CWT). The transfer learning method is able to transfer the domain knowledge and features of images to a EGG, which is a one-dimensional signal when a convolutional neural network (CNN) is used for classification. Meanwhile, CWT is used to convert a one-dimensional ECG signal into a two-dimensional signal map consisting of time-frequency components. Considering that morphological features can be helpful in arrhythmia classification, eight features related to the R peak of an ECG signal are proposed. These auxiliary features are integrated with the features extracted by the CNN and then fed into the fully linked arrhythmia classification layer. The CNN developed in this study can also be used for bird activity detection. The classification experiments were performed after converting the two types of audio files containing songbird sounds and those without songbird sounds from the NIPS4Bplus bird song dataset into the Mel spectrum. Compared to the most recent methods in the same field, the classification results improved accuracy and recognition by 11.67% and 11.57%, respectively.     

Activation of the alphavirus spike protein is suppressed by bound E3

Alphaviruses are taken up into the endosome of the cell, where acidic conditions activate the spikes for membrane fusion. This involves dissociation of the three E2-E1 heterodimers of the spike and E1 interaction with the target membrane as a homotrimer. The biosynthesis of the heterodimer as a pH-resistant p62-E1 precursor appeared to solve the problem of premature activation in the late and acidic parts of the biosynthetic transport pathway in the cell. However, p62 cleavage into E2 and E3 by furin occurs before the spike has left the acidic compartments, accentuating the problem. In this work, we used a furin-resistant Semliki Forest virus (SFV) mutant, SFV(SQL), to study the role of E3 in spike activation. The cleavage was reconstituted with proteinase K in vitro using free virus or spikes on SFV(SQL)-infected cells. We found that E3 association with the spikes was pH dependent, requiring acidic conditions, and that the bound E3 suppressed spike activation. This was shown in an in vitro spike activation assay monitoring E1 trimer formation with liposomes and a fusion-from-within assay with infected cells. Furthermore, the wild type, SFV(wt), was found to bind significant amounts of E3, especially if produced in dense cultures, which lowered the pH of the culture medium. This E3 also suppressed spike activation. The results suggest that furin-cleaved E3 continues to protect the spike from premature activation in acidic compartments of the cell and that its release in the neutral extracellular space primes the spike for low-pH activation.     

Towards a unifying model of neural net activity in the visual cortex

A neural net model describing the non-linear interactions between axonal spikes is presented. It reconciles aspects of pattern recognition (as action of an associative memory) with those of spike synchronization and phase locking. The stability of the synchronized state is studied in detail.