𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast template matching for spike sorting

✍ Scribed by Takashi Sato; Takafumi Suzuki; Kunihiko Mabuchi

Publisher
Wiley (John Wiley & Sons)
Year
2009
Tongue
English
Weight
383 KB
Volume
92
Category
Article
ISSN
1942-9533

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast template matching using correlation
Fast template matching using correlation-based adaptive predictive search
✍ Shijun Sun; HyunWook Park; David R. Haynor; Yongmin Kim πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 592 KB

## Abstract We have developed the Correlation‐based Adaptive Predictive Search (CAPS) as a fast search strategy for multidimensional template matching. A 2D template is analyzed, and certain characteristics are computed from its autocorrelation. The extracted information is then used to speed up th

Compression techniques for fast external
Compression techniques for fast external sorting
✍ John Yiannis; Justin Zobel πŸ“‚ Article πŸ“… 2006 πŸ› Springer-Verlag 🌐 English βš– 444 KB

External sorting of large files of records involves use of disk space to store temporary files, processing time for sorting, and transfer time between CPU, cache, memory, and disk. Compression can reduce disk and transfer costs, and, in the case of external sorts, cut merge costs by reducing the num

Mesh of Linear Arrays for Template Match
Mesh of Linear Arrays for Template Matching
✍ Toomas P. Plaks πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 124 KB

## Mesh of Linear Arrays for Template Matching his paper presents the architecture and the implementation of template matching on a 3-D piecewise regular processor space that forms a two-dimensional array of linear systolic arrays. TTempl ate matching can be considered as a 2-D convolution of an