Robust Spike Sorting Using Dual Tree Complex Wavelet Transform: Overcoming Traditional Limitations

Accurate spike sorting is vital for understanding the neural network dynamics of the brain through extracellular neural recordings. Traditional feature extraction methods like the Haar wavelet and principal component analysis (PCA) face limitations in high-noise environments and when dealing with si...

Full description

Saved in:
Bibliographic Details
Main Author: Gorkem Serbes
Format: Article
Language:English
Published: IEEE 2025-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/10819375/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850082367611338752
author Gorkem Serbes
author_facet Gorkem Serbes
author_sort Gorkem Serbes
collection DOAJ
description Accurate spike sorting is vital for understanding the neural network dynamics of the brain through extracellular neural recordings. Traditional feature extraction methods like the Haar wavelet and principal component analysis (PCA) face limitations in high-noise environments and when dealing with similar spike waveforms. This study proposes the use of the dual-tree complex wavelet transform (DT-CWT), which is an enhanced version of the traditional discrete wavelet transform, as a feature extractor in spike sorting. The proposed approach aims to leverage the approximate shift invariance and superior time-frequency localization capabilities of the DT-CWT in spike discrimination. A simulated dataset with varying noise levels and spike waveform similarities was used for validation. The performance of DT-CWT was compared with Haar wavelet and PCA using both original and modified superparamagnetic clustering approaches. Results demonstrated that the DT-CWT-based feature extraction achieved significantly lower average error rates across all subsets, especially in challenging conditions with high noise and similar waveforms. Moreover, the DT-CWT’s computational efficiency and suitability for real-time, on-chip implementations in next-generation wireless brain computer interface devices highlight its practical advantages. By providing robust and discriminative features under stringent resource constraints, the DT-CWT-based approach outperforms traditional methods, establishing itself as a preferred choice for scalable and efficient spike sorting in demanding scenarios.
format Article
id doaj-art-5eec3c05a2e04c5aa38e81fed5504704
institution DOAJ
issn 2169-3536
language English
publishDate 2025-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj-art-5eec3c05a2e04c5aa38e81fed55047042025-08-20T02:44:32ZengIEEEIEEE Access2169-35362025-01-01133497351110.1109/ACCESS.2024.352476310819375Robust Spike Sorting Using Dual Tree Complex Wavelet Transform: Overcoming Traditional LimitationsGorkem Serbes0https://orcid.org/0000-0003-4591-7368Department of Biomedical Engineering, Faculty of Electrical and Electronics Engineering, Yildiz Technical University, İstanbul, TürkiyeAccurate spike sorting is vital for understanding the neural network dynamics of the brain through extracellular neural recordings. Traditional feature extraction methods like the Haar wavelet and principal component analysis (PCA) face limitations in high-noise environments and when dealing with similar spike waveforms. This study proposes the use of the dual-tree complex wavelet transform (DT-CWT), which is an enhanced version of the traditional discrete wavelet transform, as a feature extractor in spike sorting. The proposed approach aims to leverage the approximate shift invariance and superior time-frequency localization capabilities of the DT-CWT in spike discrimination. A simulated dataset with varying noise levels and spike waveform similarities was used for validation. The performance of DT-CWT was compared with Haar wavelet and PCA using both original and modified superparamagnetic clustering approaches. Results demonstrated that the DT-CWT-based feature extraction achieved significantly lower average error rates across all subsets, especially in challenging conditions with high noise and similar waveforms. Moreover, the DT-CWT’s computational efficiency and suitability for real-time, on-chip implementations in next-generation wireless brain computer interface devices highlight its practical advantages. By providing robust and discriminative features under stringent resource constraints, the DT-CWT-based approach outperforms traditional methods, establishing itself as a preferred choice for scalable and efficient spike sorting in demanding scenarios.https://ieeexplore.ieee.org/document/10819375/Spike sortingdual tree complex wavelet transformfeature extractionsuperparamagnetic clusteringtime-frequency analysisapproximate shift invariance
spellingShingle Gorkem Serbes
Robust Spike Sorting Using Dual Tree Complex Wavelet Transform: Overcoming Traditional Limitations
IEEE Access
Spike sorting
dual tree complex wavelet transform
feature extraction
superparamagnetic clustering
time-frequency analysis
approximate shift invariance
title Robust Spike Sorting Using Dual Tree Complex Wavelet Transform: Overcoming Traditional Limitations
title_full Robust Spike Sorting Using Dual Tree Complex Wavelet Transform: Overcoming Traditional Limitations
title_fullStr Robust Spike Sorting Using Dual Tree Complex Wavelet Transform: Overcoming Traditional Limitations
title_full_unstemmed Robust Spike Sorting Using Dual Tree Complex Wavelet Transform: Overcoming Traditional Limitations
title_short Robust Spike Sorting Using Dual Tree Complex Wavelet Transform: Overcoming Traditional Limitations
title_sort robust spike sorting using dual tree complex wavelet transform overcoming traditional limitations
topic Spike sorting
dual tree complex wavelet transform
feature extraction
superparamagnetic clustering
time-frequency analysis
approximate shift invariance
url https://ieeexplore.ieee.org/document/10819375/
work_keys_str_mv AT gorkemserbes robustspikesortingusingdualtreecomplexwavelettransformovercomingtraditionallimitations