Spike Sorting I: Bijan Pesaran New York University.

Slides:



Advertisements
Similar presentations
Applications of one-class classification
Advertisements

Component Analysis (Review)
PARTITIONAL CLUSTERING
Kriging.
LFPs 1: Spectral analysis Kenneth D. Harris 11/2/15.
Spike Sorting Goal: Extract neural spike trains from MEA electrode data Method 1: Convolution of template spikes Method 2: Sort by spikes features.
Point process and hybrid spectral analysis.
EE 7730 Image Segmentation.
Simple Neural Nets For Pattern Classification
Locally Constraint Support Vector Clustering
x – independent variable (input)
Slide 1 EE3J2 Data Mining EE3J2 Data Mining Lecture 10 Statistical Modelling Martin Russell.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
November 2, 2010Neural Networks Lecture 14: Radial Basis Functions 1 Cascade Correlation Weights to each new hidden node are trained to maximize the covariance.
Basics: Notation: Sum:. PARAMETERS MEAN: Sample Variance: Standard Deviation: * the statistical average * the central tendency * the spread of the values.
Laurent Itti: CS599 – Computational Architectures in Biological Vision, USC Lecture 7: Coding and Representation 1 Computational Architectures in.
Jacinto C. Nascimento, Member, IEEE, and Jorge S. Marques
Dan Simon Cleveland State University
Principles of the Global Positioning System Lecture 11 Prof. Thomas Herring Room A;
Neural Networks Lecture 8: Two simple learning algorithms
EE513 Audio Signals and Systems Statistical Pattern Classification Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Unsupervised learning
Machine Learning CUNY Graduate Center Lecture 3: Linear Regression.
INTRODUCTION  Sibilant speech is aperiodic.  the fricatives /s/, / ʃ /, /z/ and / Ʒ / and the affricatives /t ʃ / and /d Ʒ /  we present a sibilant.
An extracellular signal is the sum of electrical signals from the neurons surrounding it. At any instant a set of neurons fires: some of these are relevant.
COMMON EVALUATION FINAL PROJECT Vira Oleksyuk ECE 8110: Introduction to machine Learning and Pattern Recognition.
CSC321: Neural Networks Lecture 12: Clustering Geoffrey Hinton.
S EGMENTATION FOR H ANDWRITTEN D OCUMENTS Omar Alaql Fab. 20, 2014.
Spike Sorting for Extracellular Recordings
EDGE DETECTION IN COMPUTER VISION SYSTEMS PRESENTATION BY : ATUL CHOPRA JUNE EE-6358 COMPUTER VISION UNIVERSITY OF TEXAS AT ARLINGTON.
Ch 4. Linear Models for Classification (1/2) Pattern Recognition and Machine Learning, C. M. Bishop, Summarized and revised by Hee-Woong Lim.
DATA CLUSTERING WITH KERNAL K-MEANS++ PROJECT OBJECTIVES o PROJECT GOAL  Experimentally demonstrate the application of Kernel K-Means to non-linearly.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Advisor : Dr. Hsu Graduate : Yu Cheng Chen Author: Manoranjan.
1 A first look at the KEK tracker data with G4MICE Malcolm Ellis 2 nd December 2005.
Cluster analysis and spike sorting
Elements of Pattern Recognition CNS/EE Lecture 5 M. Weber P. Perona.
By: David Gelbendorf, Hila Ben-Moshe Supervisor : Alon Zvirin
Demodulating a PAM Signal Generated by Sinc- Shaped Pulses (Part 2)
More Spike Sorting Kenneth D. Harris Rutgers University.
Lecture 8 Source detection NASSP Masters 5003S - Computational Astronomy
Presented by: Idan Aharoni
LIGO-G Z Confidence Test for Waveform Consistency of LIGO Burst Candidate Events Laura Cadonati LIGO Laboratory Massachusetts Institute of Technology.
Multiple comparisons problem and solutions James M. Kilner
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
LIGO-G9900XX-00-M DMT Monitor Verification with Simulated Data John Zweizig LIGO/Caltech.
Intro. ANN & Fuzzy Systems Lecture 16. Classification (II): Practical Considerations.
Gaussian Mixture Model classification of Multi-Color Fluorescence In Situ Hybridization (M-FISH) Images Amin Fazel 2006 Department of Computer Science.
Part 3: Estimation of Parameters. Estimation of Parameters Most of the time, we have random samples but not the densities given. If the parametric form.
Data Mining Soongsil University
LECTURE 09: BAYESIAN ESTIMATION (Cont.)
In summary C1={skin} C2={~skin} Given x=[R,G,B], is it skin or ~skin?
Kenneth D. Harris University College London
SLOPE: A MATLAB Revival
Spike Sorting for Extracellular Recordings
SMEM Algorithm for Mixture Models
A Fully Automated Approach to Spike Sorting
6.2 Grid Search of Chi-Square Space
Retinal Representation of the Elementary Visual Signal
Spike Sorting for Extracellular Recordings
Learning Theory Reza Shadmehr
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Place-Selective Firing of CA1 Pyramidal Cells during Sharp Wave/Ripple Network Patterns in Exploratory Behavior  Joseph O'Neill, Timothy Senior, Jozsef.
Greg Schwartz, Sam Taylor, Clark Fisher, Rob Harris, Michael J. Berry 
Jozsef Csicsvari, Hajime Hirase, Akira Mamiya, György Buzsáki  Neuron 
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Mathematical Foundations of BME
Linear Discrimination
EM Algorithm and its Applications
Deep neural networks for spike sorting: exploring options
Lecture 16. Classification (II): Practical Considerations
Presentation transcript:

Spike Sorting I: Bijan Pesaran New York University

Acknowledgements Ken Harris and Samar Mehta at Neuroinformatics course Woods Hole.

Aims We would like to … Monitor the activity of large numbers of neurons simultaneously Know which neuron fired when Know which neuron is of which type Estimate our errors

Primate retinal ganglion cells, courtesy of the lab of Dr. E.J. Chichilnisky THE PROBLEM: Multiple Neural Signals 3 msec Time (sec) Voltage (A/D Levels) Time (sec) Voltage (A/D Levels)

THE GOAL: Spike Times of Single Neurons Time (sec) Spike Detector Neuron #1 Spikes Neuron #2 Spikes Raw Data Region from previous slide

THE ‘GRADUATE STUDENT’ ALGORITHM Time (sec) Voltage (A/D Levels) Raw Data Threshold detector at 3  2 Time (msec) Voltage (A/D Levels) Candidate Waveforms Spike Height vs. Width Plot Width (msec) Height (A/D Levels) # of Intervals Time (msec) Interspike Interval Histogram

A GENERAL FRAMEWORK Locate Spikes Preprocess Waveforms Density Estimation Spike Classification Quality Measures

Extracellular Recording Hardware You can buy two types of hardware, allowing Wide-band continuous recordings Filtered, spike-triggered recordings

The Tetrode Four microwires twisted into a bundle Different neurons will have different amplitudes on the four wires

Raw Data Spikes

High Pass Filtering Local field potential is primarily at low frequencies. Spikes are at higher frequencies. So use a high pass filter. 800hz cutoff is good.

Filtered Data Cell 1 Cell 2

Spike Detection Locate spikes at times of maximum extracellular negativity Exact alignment is important: is it on peak of largest channel or summed channels?

Data Reduction We now have a waveform for each spike, for each channel. Still too much information! Before assigning individual spikes to cells, we must reduce further.

Principal Component Analysis Create “feature vector” for each spike. Typically takes first 3 PCs for each channel. Do you use canonical principal components, or new ones for each file?

“Feature Space”

Cluster Cutting Which spikes belong to which neuron? Assume a single cluster of spikes in feature space corresponds to a single cell Automatic or manual clustering?

Cluster Cutting Methods Purely manual – time consuming, leads to high error rates. Purely automatic – untrustworthy. Hybrid – less time consuming, lowest error rates.

Semi-automatic Clustering

How Do You Know It Works? We can split waveforms into clusters, but are we sure they correspond to single cells? Simultaneous intra- and extra-cellular recordings allow us to estimate errors. Quality measures allow us to guess errors even without simultaneous intracellular recording.

Intra-extra Recording Simultaneous recording with a wire tetrode and glass micropipette.

Intra-extra Recording Extracellular waveform is almost minus derivative of intracellular

Bizarre Extracellular Waveshapes ModelExperiment

Two Types of Error Type I error (false positive) –Incorrect inclusion of noise, or spikes of other cells Type II error (false negative) –Omission of true spikes from cluster Which is worse? Depends on application…

Manual Clustering Contest

Best Ellipsoid Error Rates Find ellipsoid that minimizes weighted sum of Type I and Type II errors. Must evaluate using cross-validation!

Humans vs. B.E.E.R.

Waveshape Helps Separation

Why were human errors higher? To understand this, try to understand why clusters have the shape they do Simplest possibility: spike waveform is constant, cluster spread comes from background noise Are clusters multivariate normal?

Problem: Overlapping Spikes

Problem: Cellular Synchrony

Problem: Bursting

Problem: Misalignment When you have a spike whose peak occurs at different times on different channels, it can align on either. This causes the cluster to be split in two.

Problem: Dimensionality Manual clustering only uses 2 dimensions at a time BEER measure can use all of them

“Semi-Automatic” Clustering Uses all dimensions at once Errors should be lower Still requires human input

Semi-automatic Performance

Software: KlustaKwik Mixture of Gaussians, unconstrained covariance matrices Speed is crucial CEM Algorithm – faster than EM Most probabilities not calculated Local maxima result in over- and under- clustering Split and merge features to tunnel out of local maxima Still requires supercomputer resources. klustakwik.sourceforge.net

Software: Klusters Recluster Feature Ergonomic Design Auto/Cross correlograms Grouping Assistant Waveforms Timecourse klusters.sourceforge.net

Cluster Quality Measures Would like to automatically detect which cells are well isolated. BEER measure needs intracellular data, which we don’t have in general. Will define two measures that only use extracellular data.

Isolation Distance Size of ellipsoid within which as many spikes belong to our cluster as not

L_ratio

False Positives and Negatives

Which Measure to Use? Isolation distance correlates with false positive error rates –Measures distance to other clusters L_ratio correlates with false negative error rates –Measures number of spikes near cluster boundary

Conclusions Automatic clustering will save time and reduce errors. Errors can be as low as ~5%. Quality measures give you a feeling of how bad your errors are.

Room for Improvement Make it faster Improved spike detection and alignment Quality measures that estimate % error Fully automatic sorting Resolve overlapping spikes Easy Hard