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

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

請使用永久網址來引用或連結此文件: 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