Spike sorting by a minimax reduced feature set based on finite differences

NCU Institutional Repository > 理學院 > 數學研究所 > 期刊論文 > Item 987654321/27961

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/27961

题名:	Spike sorting by a minimax reduced feature set based on finite differences
作者:	Yen,CC;Shann,WC;Yen,CT;Tsai,ML
贡献者:	數學研究所
关键词:	REAL-TIME;CLASSIFICATION
日期:	2009
上传时间:	2010-06-29 19:38:58 (UTC+8)
出版者:	中央大學
摘要:	Spikes are classified according to their finite differences in various orders. The fundamental idea that makes it work is that finite differences can extract and isolate features from spikes. This method showed better sorting quality and involved less labor than the methods of principal component analysis, original reduced feature set, and wavelet-based spike classifiers.
關聯:	JOURNAL OF PHYSIOLOGICAL SCIENCES
显示于类别:	[數學研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	448	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing