Fast automatic template matching for spike sorting based on Davies-Bouldin validation indices

Area of Science:

• Computational Neuroscience
• Signal Processing

Background:

• Neuron extracellular action potential detection, or spike sorting, is crucial for neuroscience research.
• Template matching is an optimal filter for spike sorting under Gaussian noise but suffers from high computational cost and template construction challenges.

Purpose of the Study:

• To develop an efficient and accurate spike sorting algorithm.
• To reduce computational time and improve classification accuracy in neuron spike detection.

Main Methods:

• The study utilizes template matching optimized with Davies-Bouldin validation indices (DBVIs) to curtail the matching process.
• Automated template construction is achieved by combining principle component analysis (PCA) and k-means clustering.

Main Results:

• The proposed method significantly reduces computational time compared to existing methods.
• The algorithm demonstrates fewer incorrect classifications, enhancing spike sorting accuracy.

Conclusions:

• The developed spike sorting approach offers a computationally efficient and accurate solution for detecting and classifying neuronal extracellular action potentials.
• This method provides a valuable tool for advancing neuroscience research through improved signal analysis.