Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/72542
Title: EEG Channel Selection Based User Identification via Improved Flower Pollination Algorithm
Authors: Zaid Abdi Alkareem Alyasseri
Osama Ahmad Alomari
João P. Papa
Mohammed Azmi Al-Betar
Karrar Hameed Abdulkareem
Mazin Abed Mohammed
Seifedine Kadry
Orawit Thinnukool
Pattaraporn Khuwuthyakorn
Authors: Zaid Abdi Alkareem Alyasseri
Osama Ahmad Alomari
João P. Papa
Mohammed Azmi Al-Betar
Karrar Hameed Abdulkareem
Mazin Abed Mohammed
Seifedine Kadry
Orawit Thinnukool
Pattaraporn Khuwuthyakorn
Keywords: Biochemistry, Genetics and Molecular Biology;Chemistry;Computer Science;Engineering;Physics and Astronomy
Issue Date: 1-Mar-2022
Abstract: The electroencephalogram (EEG) introduced a massive potential for user identification. Several studies have shown that EEG provides unique features in addition to typical strength for spoofing attacks. EEG provides a graphic recording of the brain’s electrical activity that electrodes can capture on the scalp at different places. However, selecting which electrodes should be used is a challenging task. Such a subject is formulated as an electrode selection task that is tackled by optimization methods. In this work, a new approach to select the most representative electrodes is introduced. The proposed algorithm is a hybrid version of the Flower Pollination Algorithm and β-Hill Climbing optimizer called FPAβ-hc. The performance of the FPAβ-hc algorithm is evaluated using a standard EEG motor imagery dataset. The experimental results show that the FPAβ-hc can utilize less than half of the electrode numbers, achieving more accurate results than seven other methods.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85125931369&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/72542
ISSN: 14248220
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.