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

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/27961

Title:	Spike sorting by a minimax reduced feature set based on finite differences
Authors:	Yen,CC;Shann,WC;Yen,CT;Tsai,ML
Contributors:	數學研究所
Keywords:	REAL-TIME;CLASSIFICATION
Date:	2009
Issue Date:	2010-06-29 19:38:58 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	JOURNAL OF PHYSIOLOGICAL SCIENCES
Appears in Collections:	[Graduate Institute of Mathematics] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	479	View/Open

社群 sharing