z-logo
open-access-imgOpen Access
Automatic correction of short‐duration artefacts in single‐channel EEG recording: a group‐sparse signal denoising algorithm
Author(s) -
Mourad Nasser
Publication year - 2018
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
ISSN - 1751-9683
DOI - 10.1049/iet-spr.2017.0344
Subject(s) - algorithm , duration (music) , channel (broadcasting) , noise reduction , computer science , signal (programming language) , term (time) , pattern recognition (psychology) , artificial intelligence , speech recognition , art , computer network , physics , literature , quantum mechanics , programming language
A new algorithm for correcting short‐duration artefacts in single‐channel EEG recording is proposed here. A short‐duration artefact has the characteristics of a group‐sparse (GS) signal, i.e. a sparse signal in which its non‐zero entries tend to concentrate in groups. Therefore, the problem of extracting a short‐duration artefact from a recorded EEG data is formulated in the proposed algorithm as a denoising optimisation problem in which a penalty term is utilised to encourage the group sparsity of the estimated artefact. A quadratic penalty term is utilised in the proposed algorithm, and, hence, a closed‐form solution is obtained in each iteration of the algorithm. In addition, a technique for automatic selection of the regularisation parameter, which controls the trade‐off between the sparsity of the estimated artefact and its closeness to the measured EEG data, is also proposed. Simulation results on real and simulated EEG data show that the proposed algorithm can be successfully utilised to correct different kinds of short‐duration artefacts in both single‐channel and multichannel recordings. In addition, the proposed algorithm is also shown to produce significantly improved results compared to existing techniques used for performing similar tasks.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here