The University of Southampton
University of Southampton Institutional Repository

Accurate, very low computational complexity spike sorting using unsupervised matched subspace learning

Accurate, very low computational complexity spike sorting using unsupervised matched subspace learning
Accurate, very low computational complexity spike sorting using unsupervised matched subspace learning

This paper presents an adaptable dictionary-based feature extraction approach for spike sorting offering high accuracy and low computational complexity for implantable applications. It extracts and learns identifiable features from evolving subspaces through matched unsupervised subspace filtering. To provide compatibility with the strict constraints in implantable devices such as the chip area and power budget, the dictionary contains arrays of {<formula><tex>$- 1,\;0\text{ and } 1$</tex></formula> and the algorithm need only process addition and subtraction operations. Three types of such dictionary were considered. To quantify and compare the performance of the resulting three feature extractors with existing systems, a neural signal simulator based on several different libraries was developed. For noise levels <formula><tex>$\sigma_N$</tex></formula> between 0.05 and 0.3 and groups of 3 to 6 clusters, all three feature extractors provide robust high performance with average classification errors of less than 8% over five iterations, each consisting of 100 generated data segments. To our knowledge, the proposed adaptive feature extractors are the first able to classify reliably 6 clusters for implantable applications. An ASIC implementation of the best performing dictionary-based feature extractor was synthesized in a 65-nm CMOS process. It occupies an area of 0.09 mm2 and dissipates up to about 10.48 &#x03BC;W from a 1 V supply voltage, when operating with 8-bit resolution at 30 kHz operating frequency.

Complexity optimization, digital ASIC, feature extraction, high performance classification, implantable devices, spike sorting, subspace tracking, unsupervised learning
1932-4545
221-231
Zamani, Majid
431788cc-0702-4fa9-9709-f5777a2d0d25
Sokolic, Jure
a1429560-b881-4d1e-8353-871e055c6eee
Jiang, Dai
782f1637-d100-43dd-821f-6e4e156a50db
Renna, Francesco
ae7199fd-c7f1-408d-a28f-d835e86462da
Rodrigues, Miguel R.D.
911c0674-c1a5-411e-99ee-3ceea571c637
Demosthenous, Andreas
bed19531-d770-4f48-8464-59d225ddea8d
Zamani, Majid
431788cc-0702-4fa9-9709-f5777a2d0d25
Sokolic, Jure
a1429560-b881-4d1e-8353-871e055c6eee
Jiang, Dai
782f1637-d100-43dd-821f-6e4e156a50db
Renna, Francesco
ae7199fd-c7f1-408d-a28f-d835e86462da
Rodrigues, Miguel R.D.
911c0674-c1a5-411e-99ee-3ceea571c637
Demosthenous, Andreas
bed19531-d770-4f48-8464-59d225ddea8d

Zamani, Majid, Sokolic, Jure, Jiang, Dai, Renna, Francesco, Rodrigues, Miguel R.D. and Demosthenous, Andreas (2020) Accurate, very low computational complexity spike sorting using unsupervised matched subspace learning. IEEE Transactions on Biomedical Circuits and Systems, 14 (2), 221-231. (doi:10.1109/TBCAS.2020.2969910).

Record type: Article

Abstract

This paper presents an adaptable dictionary-based feature extraction approach for spike sorting offering high accuracy and low computational complexity for implantable applications. It extracts and learns identifiable features from evolving subspaces through matched unsupervised subspace filtering. To provide compatibility with the strict constraints in implantable devices such as the chip area and power budget, the dictionary contains arrays of {<formula><tex>$- 1,\;0\text{ and } 1$</tex></formula> and the algorithm need only process addition and subtraction operations. Three types of such dictionary were considered. To quantify and compare the performance of the resulting three feature extractors with existing systems, a neural signal simulator based on several different libraries was developed. For noise levels <formula><tex>$\sigma_N$</tex></formula> between 0.05 and 0.3 and groups of 3 to 6 clusters, all three feature extractors provide robust high performance with average classification errors of less than 8% over five iterations, each consisting of 100 generated data segments. To our knowledge, the proposed adaptive feature extractors are the first able to classify reliably 6 clusters for implantable applications. An ASIC implementation of the best performing dictionary-based feature extractor was synthesized in a 65-nm CMOS process. It occupies an area of 0.09 mm2 and dissipates up to about 10.48 &#x03BC;W from a 1 V supply voltage, when operating with 8-bit resolution at 30 kHz operating frequency.

This record has no associated files available for download.

More information

e-pub ahead of print date: 4 February 2020
Keywords: Complexity optimization, digital ASIC, feature extraction, high performance classification, implantable devices, spike sorting, subspace tracking, unsupervised learning

Identifiers

Local EPrints ID: 489254
URI: http://eprints.soton.ac.uk/id/eprint/489254
ISSN: 1932-4545
PURE UUID: 9fe0c480-9d74-4847-8cfd-667a18011ac3
ORCID for Majid Zamani: ORCID iD orcid.org/0009-0007-0844-473X

Catalogue record

Date deposited: 18 Apr 2024 16:47
Last modified: 19 Apr 2024 02:06

Export record

Altmetrics

Contributors

Author: Majid Zamani ORCID iD
Author: Jure Sokolic
Author: Dai Jiang
Author: Francesco Renna
Author: Miguel R.D. Rodrigues
Author: Andreas Demosthenous

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×