arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.07602eess.SPcs.LG
收藏

MetaSort: 一种用于非均匀压缩和少样本分类的神经尖峰波形加速方法

MetaSort: An Accelerated Approach for Non-uniform Compression and Few-shot Classification of Neural Spike Waveforms

University of Southampton(南安普顿大学)

Luca M. Meyer, Majid Zamani

AI总结:

MetaSort通过结合自适应穿越算法和元转移学习,实现神经尖峰波形的高效非均匀压缩与少样本分类。

摘要:

许多先前的工作在尖峰排序研究中将尖峰分类和压缩作为独立问题处理。在本文中,提出了一种名为MetaSort的新算法来解决这两个问题。为了解决压缩问题,提出了一种新的自适应穿越算法,以高保真度近似尖峰形状。同时,潜在特征表示用于处理分类问题。此外,为了确保MetaSort具有鲁棒性和判别性,所提出的框架通过元转移学习同时利用数据的几何信息。使用体内尖峰数据的实验证明,MetaSort表现出有前景的性能,突显了其潜力,并推动了向超低功耗、芯片级实现的发展。

英文摘要:

Many previous works in spike sorting study spike classification and compression independently. In this paper, a novel algorithm is proposed called MetaSort to address these two problems. To deal with compression, a novel adaptive level crossing algorithm is proposed to approximate spike shapes with high fidelity. Meanwhile, the latent feature representation is used to handle the classification problem. Besides, to guarantee MetaSort is robust and discriminative, the geometric information of data is exploited simultaneously in the proposed framework by meta-transfer learning. Empirical experiments with in-vivo spike data demonstrate that MetaSort delivers promising performance, highlighting its potential and motivating continued development toward an ultra-low-power, on-chip implementation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑