Please use this identifier to cite or link to this item:
|Title:||Robust adaptive techniques for minimization of EOG artefacts from EEG signals||Authors:||Puthusserypady, S.
Electrooculogram (EOG) artefacts
Robust adaptive filtering
|Issue Date:||Sep-2006||Citation:||Puthusserypady, S., Ratnarajah, T. (2006-09). Robust adaptive techniques for minimization of EOG artefacts from EEG signals. Signal Processing 86 (9) : 2351-2363. ScholarBank@NUS Repository. https://doi.org/10.1016/j.sigpro.2005.10.018||Abstract:||In this paper, we propose the application of H∞ techniques for minimization of electrooculogram (EOG) artefacts from corrupted electroencephalographic (EEG) signals. Two adaptive algorithms (time-varying and exponentially-weighted) based on the H∞ principles are proposed. The idea of applying H∞ techniques is motivated by the fact that they are robust to model uncertainties and lack of statistical information with respect to noise [B. Hassibi, A.H. Sayed, T. Kailath, Linear estimation in Krein spaces-Part 1: theory & Part II: applications, IEEE Trans. Automat. Control 41 (1996) 18-49]. Studies are performed on simulated as well as real recorded signals. Performance of the proposed techniques are then compared with the well-known least-mean square (LMS) and recursive least-square (RLS) algorithms. Improvements in the output signal-to-noise ratio (SNR) along with the time plots are used as criteria for comparing the performance of the algorithms. It is found that the proposed H∞-based algorithms work slightly better than the RLS algorithm (especially when the input SNR is very low) and always outperform the LMS algorithm in minimizing the EOG artefacts from corrupted EEG signals. © 2005 Elsevier B.V. All rights reserved.||Source Title:||Signal Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/82987||ISSN:||01651684||DOI:||10.1016/j.sigpro.2005.10.018|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.