Recursive Bayesian coding for BCIs

Higger, Matt and Quivira, Fernando and Akçakaya, Murat and Moghadamfalahi, Mohammad and Nezamfar, Hooman and Çetin, Müjdat and Erdoğmuş, Deniz (2017) Recursive Bayesian coding for BCIs. IEEE Transactions on Neural Systems and Rehabilitation Engineering, 25 (6). pp. 704-714. ISSN 1534-4320 (Print) 1558-0210 (Online)

This is the latest version of this item.

[thumbnail of J_Higger_RecursiveBayesCodingBCI_TNSRE_submitted.pdf] PDF
J_Higger_RecursiveBayesCodingBCI_TNSRE_submitted.pdf
Restricted to Repository staff only

Download (688kB) | Request a copy
[thumbnail of higger_TNSRE16_early_access.pdf] PDF
higger_TNSRE16_early_access.pdf
Restricted to Registered users only

Download (2MB) | Request a copy
[thumbnail of higger_TNSRE17.pdf] PDF
higger_TNSRE17.pdf
Restricted to Registered users only

Download (1MB) | Request a copy

Abstract

Brain Computer Interfaces (BCI) seek to infer some task symbol, a task relevant instruction, from brain symbols, classifiable physiological states. For example, in a motor imagery robot control task a user would indicate their choice from a dictionary of task symbols (rotate arm left, grasp, etc.) by selecting from a smaller dictionary of brain symbols (imagined left or right hand movements). We examine how a BCI infers a task symbol using selections of brain symbols. We offer a recursive Bayesian decision framework which incorporates context prior distributions (e.g. language model priors in spelling applications), accounts for varying brain symbol accuracy and is robust to single brain symbol query errors. This framework is paired with Maximum Mutual Information (MMI) coding which maximizes a generalization of ITR. Both are applicable to any discrete task and brain phenomena (e.g. P300, SSVEP, MI). To demonstrate the efficacy of our approach we perform SSVEP “Shuffle” Speller experiments and compare our recursive coding scheme with traditional decision tree methods including Huffman coding. MMI coding leverages the asymmetry of the classifier’s mistakes across a particular user’s SSVEP responses; in doing so it offers a 33% increase in letter accuracy though it is 13% slower in our experiment.
Item Type: Article
Uncontrolled Keywords: Discrete Memoryless Channel, BCI, SSVEP Shuffle Speller, Decision Tree, Huffman Coding, Mutual Information
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Q Science > QP Physiology > QP1-(981) Physiology > QP351-495 Neurophysiology and neuropsychology
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Electronics
Faculty of Engineering and Natural Sciences
Depositing User: Müjdat Çetin
Date Deposited: 09 Sep 2017 14:28
Last Modified: 26 Apr 2022 09:51
URI: https://research.sabanciuniv.edu/id/eprint/33799

Available Versions of this Item

Actions (login required)

View Item
View Item