Skip Nav Destination
Close Modal
Update search
NARROW
Format
Journal
TocHeadingTitle
Date
Availability
1-2 of 2
Yuanqing Li
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
An Extended EM Algorithm for Joint Feature Extraction and Classification in Brain-Computer Interfaces
UnavailablePublisher: Journals Gateway
Neural Computation (2006) 18 (11): 2730–2761.
Published: 01 November 2006
Abstract
View articletitled, An Extended EM Algorithm for Joint Feature Extraction and Classification in Brain-Computer Interfaces
View
PDF
for article titled, An Extended EM Algorithm for Joint Feature Extraction and Classification in Brain-Computer Interfaces
For many electroencephalogram (EEG)-based brain-computer interfaces (BCIs), a tedious and time-consuming training process is needed to set parameters. In BCI Competition 2005, reducing the training process was explicitly proposed as a task. Furthermore, an effective BCI system needs to be adaptive to dynamic variations of brain signals; that is, its parameters need to be adjusted online. In this article, we introduce an extended expectation maximization (EM) algorithm, where the extraction and classification of common spatial pattern (CSP) features are performed jointly and iteratively. In each iteration, the training data set is updated using all or part of the test data and the labels predicted in the previous iteration. Based on the updated training data set, the CSP features are reextracted and classified using a standard EM algorithm. Since the training data set is updated frequently, the initial training data set can be small (semi-supervised case) or null (unsupervised case). During the above iterations, the parameters of the Bayes classifier and the CSP transformation matrix are also updated concurrently. In online situations, we can still run the training process to adjust the system parameters using unlabeled data while a subject is using the BCI system. The effectiveness of the algorithm depends on the robustness of CSP feature to noise and iteration convergence, which are discussed in this article. Our proposed approach has been applied to data set IVa of BCI Competition 2005. The data analysis results show that we can obtain satisfying prediction accuracy using our algorithm in the semisupervised and unsupervised cases. The convergence of the algorithm and robustness of CSP feature are also demonstrated in our data analysis.
Journal Articles
Publisher: Journals Gateway
Neural Computation (2004) 16 (6): 1193–1234.
Published: 01 June 2004
Abstract
View articletitled, Analysis of Sparse Representation and Blind Source Separation
View
PDF
for article titled, Analysis of Sparse Representation and Blind Source Separation
In this letter, we analyze a two-stage cluster-then- l 1 -optimization approach for sparse representation of a data matrix, which is also a promising approach for blind source separation (BSS) in which fewer sensors than sources are present. First, sparse representation (factorization) of a data matrix is discussed. For a given overcomplete basis matrix, the corresponding sparse solution (coefficient matrix) with minimum l 1 norm is unique with probability one, which can be obtained using a standard linear programming algorithm. The equivalence of the l 1 —norm solution and the l 0 —norm solution is also analyzed according to a probabilistic framework. If the obtained l 1 —norm solution is sufficiently sparse, then it is equal to the l 0 —norm solution with a high probability. Furthermore, the l 1 —norm solution is robust to noise, but the l 0—norm solution is not, showing that the l 1 —norm is a good sparsity measure. These results can be used as a recoverability analysis of BSS, as discussed. The basis matrix in this article is estimated using a clustering algorithm followed by normalization, in which the matrix columns are the cluster centers of normalized data column vectors. Zibulevsky, Pearlmutter, Boll, and Kisilev (2000) used this kind of two-stage approach in underdetermined BSS. Our recoverability analysis shows that this approach can deal with the situation in which the sources are overlapped to some degree in the analyzed