Single Neuron Coding of Identity in the Human Hippocampal Formation.

Experimental findings show the ubiquitous presence of graded responses and tuning curves in the neocortex, particularly in visual areas [1-15]. Among these, inferotemporal-cortex (IT) neurons respond to complex visual stimuli, but differences in the neurons' responses can be used to distinguish the stimuli eliciting the responses [8, 9, 16-18]. The IT projects directly to the medial temporal lobe (MTL) [19], where neurons respond selectively to different pictures of specific persons and even to their written and spoken names [20-22]. However, it is not clear whether this is done through a graded coding, as in the neocortex, or a truly invariant code, in which the response-eliciting stimuli cannot be distinguished from each other. To address this issue, we recorded single neurons during the repeated presentation of different stimuli (pictures and written and spoken names) corresponding to the same persons. Using statistical tests and a decoding approach, we found that only in a minority of cases can the different pictures of a given person be distinguished from the neurons' responses and that in a larger proportion of cases, the responses to the pictures were different to the ones to the written and spoken names. We argue that MTL neurons tend to lack a representation of sensory features (particularly within a sensory modality), which can be advantageous for the memory function attributed to this area [23-25], and that a full representation of memories is given by a combination of mostly invariant coding in the MTL with a representation of sensory features in the neocortex.

A novel and fully automatic spike-sorting implementation with variable number of features.

The most widely used spike-sorting algorithms are semiautomatic in practice, requiring manual tuning of the automatic solution to achieve good performance. In this work, we propose a new fully automatic spike-sorting algorithm that can capture multiple clusters of different sizes and densities. In addition, we introduce an improved feature selection method, by using a variable number of wavelet coefficients, based on the degree of non-Gaussianity of their distributions. We evaluated the performance of the proposed algorithm with real and simulated data. With real data from single-channel recordings, in ~95% of the cases the new algorithm replicated, in an unsupervised way, the solutions obtained by expert sorters, who manually optimized the solution of a previous semiautomatic algorithm. This was done while maintaining a low number of false positives. With simulated data from single-channel and tetrode recordings, the new algorithm was able to correctly detect many more neurons compared with previous implementations and also compared with recently introduced algorithms, while significantly reducing the number of false positives. In addition, the proposed algorithm showed good performance when tested with real tetrode recordings. NEW & NOTEWORTHY We propose a new fully automatic spike-sorting algorithm, including several steps that allow the selection of multiple clusters of different sizes and densities. Moreover, it defines the dimensionality of the feature space in an unsupervised way. We evaluated the performance of the algorithm with real and simulated data, from both single-channel and tetrode recordings. The proposed algorithm was able to outperform manual sorting from experts and other recent unsupervised algorithms.