Downloads & Free Reading Options - Results

Spike Sorting For Polytrodes%3a A Divide And Conquer Approach. by Swindale%2c Nicholas V.

Read "Spike Sorting For Polytrodes%3a A Divide And Conquer Approach." by Swindale%2c Nicholas V. through these free online access and download options.

Search for Downloads

Search by Title or Author

Books Results

Source: The Internet Archive

The internet Archive Search Results

Available books for downloads and borrow from The internet Archive

1Spike Sorting For Polytrodes: A Divide And Conquer Approach.

By

This article is from Frontiers in Systems Neuroscience , volume 8 . Abstract In order to determine patterns of neural activity, spike signals recorded by extracellular electrodes have to be clustered (sorted) with the aim of ensuring that each cluster represents all the spikes generated by an individual neuron. Many methods for spike sorting have been proposed but few are easily applicable to recordings from polytrodes which may have 16 or more recording sites. As with tetrodes, these are spaced sufficiently closely that signals from single neurons will usually be recorded on several adjacent sites. Although this offers a better chance of distinguishing neurons with similarly shaped spikes, sorting is difficult in such cases because of the high dimensionality of the space in which the signals must be classified. This report details a method for spike sorting based on a divide and conquer approach. Clusters are initially formed by assigning each event to the channel on which it is largest. Each channel-based cluster is then sub-divided into as many distinct clusters as possible. These are then recombined on the basis of pairwise tests into a final set of clusters. Pairwise tests are also performed to establish how distinct each cluster is from the others. A modified gradient ascent clustering (GAC) algorithm is used to do the clustering. The method can sort spikes with minimal user input in times comparable to real time for recordings lasting up to 45 min. Our results illustrate some of the difficulties inherent in spike sorting, including changes in spike shape over time. We show that some physiologically distinct units may have very similar spike shapes. We show that RMS measures of spike shape similarity are not sensitive enough to discriminate clusters that can otherwise be separated by principal components analysis (PCA). Hence spike sorting based on least-squares matching to templates may be unreliable. Our methods should be applicable to tetrodes and scalable to larger multi-electrode arrays (MEAs).

“Spike Sorting For Polytrodes: A Divide And Conquer Approach.” Metadata:

  • Title: ➤  Spike Sorting For Polytrodes: A Divide And Conquer Approach.
  • Authors:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 21.76 Mbs, the file-s for this book were downloaded 76 times, the file-s went public at Thu Oct 23 2014.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - JSON - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find Spike Sorting For Polytrodes: A Divide And Conquer Approach. at online marketplaces:


Buy “Spike Sorting For Polytrodes%3a A Divide And Conquer Approach.” online:

Shop for “Spike Sorting For Polytrodes%3a A Divide And Conquer Approach.” on popular online marketplaces.