Fast Template Matching for Spike Sorting

DOI Web Site Web Site 29 References
  • Sato Takashi
    Graduate School of Information Science and Technology, The University of Tokyo
  • Suzuki Takafumi
    Graduate School of Information Science and Technology, The University of Tokyo
  • Mabuchi Kunihiko
    Graduate School of Information Science and Technology, The University of Tokyo

Bibliographic Information

Other Title
  • スパイクソーティングにおけるテンプレートマッチングの高速化
  • スパイク ソーティング ニ オケル テンプレート マッチング ノ コウソクカ

Search this article

Abstract

The present study introduces an approach to detect and classify extracellularly recorded action potentials of neurons, usually termed as spike sorting. Our approach is based on template matching, which is an optimal filter under Gaussian noise; however, this approach is usually expensive in computational time.<br>To speed up the filter, it is important to curtail the matching process when the distance between template and waveform exceeds some threshold. We approach this aspect of the problem using the frame of similarity detection algorithms (SSDA) and Davies-Bouldin validation indices (DBVI). Windowing pair of the filter was selected in DBVI based order and a signal which has rapidly increasing error was discarded to reduce the computational time. DBVI is a function of the ratio of the sum of within-cluster scatter to between-cluster separation, thus using this order we can expect to separate a signal and a noise in fewer window point calculation than full point matching. This matching process performed well, with a shorter computational time and fewer incorrect classifications than other ordering methods such as time based or amplitude based order.

Journal

References(29)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top