Search

Objective: Pain assessment in children continues to challenge clinicians and researchers, as subjective experiences of pain require inference through observable behaviors, both involuntary and deliberate. The presented approach supplements the subjective self-report-based method by fusing electrodermal activity (EDA) recordings with video facial expressions to develop an objective pain assessment metric. Such an approach is specifically important for assessing pain in children who are not capable of providing accurate self-pain reports, requiring nonverbal pain assessment. We demonstrate the performance of our approach using data recorded from children in post-operative recovery following laparoscopic appendectomy. We examined separately and combined the usefulness of EDA and video facial expression data as predictors of children's self-reports of pain following surgery through recovery. Findings indicate that EDA and facial expression data independently provide above chance sensitivities and specificities, but their fusion for classifying clinically significant pain vs. clinically nonsignificant pain achieved substantial improvement, yielding 90.91% accuracy, with 100% sensitivity and 81.82% specificity. The multimodal measures capitalize upon different features of the complex pain response. Thus, this paper presents both evidence for the utility of a weighted maximum likelihood algorithm as a novel feature selection method for EDA and video facial expression data and an accurate and objective automated classification algorithm capable ofdiscriminating clinically significant pain from clinically nonsignificant pain in children. [ABSTRACT FROM AUTHOR]

A class of brain computer interfaces (BCIs) employs noninvasive recordings of electroencephalography (EEG) signals to enable users with severe speech and motor impairments to interact with their environment and social network. EEG based BCIs for typing popularly utilize event related potentials (ERPs) for inference. Presentation paradigm in current ERP-based letter by letter typing BCIs typically query the user with an arbitrary subset of characters. However, the typing accuracy and speed can potentially be enhanced with more informed subset selection. In this manuscript, we introduce the active recursive Bayesian state estimation (active-RBSE) framework for inference and sequence optimization. Prior to each iteration of presentation, rather than showing a subset of randomly selected characters, this framework optimally selects a subset based on a query function. Selected queries are made adaptively specialized for users during each intent detection. Through a simulation-based study, we assess the effect of active-RBSE on the performance of a language-model assisted typing BCI in terms of typing speed and accuracy. To provide a baseline for comparison, we also utilize standard presentation paradigms namely, row and column matrix presentation paradigm and also random rapid serial visual presentation paradigms. The results show that utilization of active-RBSE can enhance the online performance of the system, both in terms of typing accuracy and speed. Moreover, we conduct online experiments with human participants to study the human-in-the-loop effect on the performance of the proposed framework and the results were consistent with the simulations. [ABSTRACT FROM PUBLISHER]

Brain–Computer Interfaces (BCIs) 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. [ABSTRACT FROM AUTHOR]

Noninvasive electroencephalography (EEG)-based brain–computer interfaces (BCIs) popularly utilize event-related potential (ERP) for intent detection. Specifically, for EEG-based BCI typing systems, different symbol presentation paradigms have been utilized to induce ERPs. In this manuscript, through an experimental study, we assess the speed, recorded signal quality, and system accuracy of a language-model-assisted BCI typing system using three different presentation paradigms: a 4 \times 7 matrix paradigm of a 28-character alphabet with row-column presentation (RCP) and single-character presentation (SCP), and rapid serial visual presentation (RSVP) of the same. Our analyses show that signal quality and classification accuracy are comparable between the two visual stimulus presentation paradigms. In addition, we observe that while the matrix-based paradigm can be generally employed with lower inter-trial-interval (ITI) values, the best presentation paradigm and ITI value configuration is user dependent. This potentially warrants offering both presentation paradigms and variable ITI options to users of BCI typing systems. [ABSTRACT FROM AUTHOR]

Currently, many Brain Computer Interfaces (BCI) classifiers output point estimates of user intent which make it difficult to incorporate context prior information or assign a principled confidence measurement to a decision. We propose a Bayesian framework to extend current Steady State Visually Evoked Potential (SSVEP) classifiers to a maximum a posteriori (MAP) classifiers by using a Kernel Density Estimate (KDE) to learn the distribution of features conditioned on stimulation class. To demonstrate our framework we extend Canonical Correlation Analysis (CCA) and Power Spectral Density (PSD) style methods. Traditionally, in either example, the class is estimated as the class associated with the maximum feature. Our framework increases performance by relaxing the assumption that a stimulation class's sample often maximizes its class-associated feature. Further, by leveraging the KDE, we present a method which estimates the performance of a classifier under different stimulation frequency sets. Using this, we optimize the selection of stimulation frequencies from those present in a training set. [ABSTRACT FROM AUTHOR]