Benchmarking spike source localization algorithms in high density probes
Hao Zhao, Xinhe Zhang, Arnau Marin-Llobet, Xinyi Lin, Jia Liu

TL;DR
This paper benchmarks various neuron localization algorithms using simulated and experimental datasets, revealing trade-offs between model complexity and robustness for brain-machine interface applications.
Contribution
It provides the first comprehensive benchmarking framework for neuron localization algorithms, comparing accuracy, robustness, and runtime across different conditions.
Findings
Complex models excel in ideal conditions
Simple heuristics are more robust to noise and electrode decay
Performance differences are significant across algorithms
Abstract
Estimating neuron location from extracellular recordings is essential for developing advanced brain-machine interfaces. Accurate neuron localization improves spike sorting, which involves detecting action potentials and assigning them to individual neurons. It also helps monitor probe drift, which affects long-term probe reliability. Although several localization algorithms are currently in use, the field is nascent and arguments for using one algorithm over another are largely theoretical or based on visual analysis of clustering results. We present a first-of-its-kind benchmarking of commonly used neuron localization algorithms. We tested these algorithms using two ground truth datasets: a biophysically realistic simulated dataset, and experimental data combining patch-clamp and Neuropixels probes. We systematically evaluate the accuracy, robustness, and runtime of these algorithms in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
