﻿<?xml version="1.0" encoding="utf-8"?><rss version="2.0"><channel><title>Computational Intelligence and Neuroscience</title><link>http://www.hindawi.com</link><description>The latest articles from Hindawi Publishing Corporation</description><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright><item><title>Parametric and Nonparametric EEG Analysis for the Evaluation 
                        of EEG Activity in Young Children with Controlled Epilepsy</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/462593</link><description>There is an important evidence of differences in the EEG frequency spectrum 
                  of control subjects as compared to epileptic subjects. In particular, the study of children presents
                   difficulties due to the early stages of brain development and the various forms of epilepsy
                    indications. In this study, we consider children that developed epileptic crises in the past but without 
                    any other clinical, psychological, or visible neurophysiological findings. The aim of the paper is to
                     develop reliable techniques for testing if such controlled epilepsy induces related spectral 
                     differences in the EEG. Spectral features extracted by using nonparametric, signal representation 
                     techniques (Fourier and wavelet transform) and a parametric, signal modeling technique (ARMA)
                      are compared and their effect on the classification of the two groups is analyzed. The subjects
                       performed two different tasks: a control (rest) task and a relatively difficult math task. The results
                        show that spectral features extracted by modeling the EEG signals recorded from individual 
                        channels by an ARMA model give a higher discrimination between the two subject groups for 
                        the control task, where classification scores of up to 100% were obtained with a linear 
                        discriminant classifier.</description><Author>Vangelis Sakkalis, Tracey Cassar, Michalis Zervakis, Kenneth P. Camilleri, Simon G. Fabri, Cristin Bigan, Eleni Karakonstantaki, and Sifis Micheloyannis</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Advances in Nonnegative Matrix and Tensor Factorization</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/852187</link><description /><Author>A. Cichocki, M. M&amp;#248;rup, P. Smaragdis, W. Wang, and R. Zdunek</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Fast Nonnegative Matrix Factorization Algorithms Using Projected Gradient Approaches for Large-Scale Problems</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/939567</link><description>Recently, a considerable growth of interest in projected gradient (PG) methods has been
observed due to their high efficiency in solving large-scale convex minimization problems
subject to linear constraints. Since the minimization problems underlying nonnegative
matrix factorization (NMF) of large matrices well matches this class of minimization
problems, we investigate and test some recent PG methods in the context of their applicability
to NMF. In particular, the paper focuses on the following modified methods:
projected Landweber, Barzilai-Borwein gradient projection, projected sequential subspace
optimization (PSESOP), interior-point Newton (IPN), and sequential coordinate-wise.
The proposed and implemented NMF PG algorithms are compared with respect to their
performance in terms of signal-to-interference ratio (SIR) and elapsed time, using a simple
benchmark of mixed partially dependent nonnegative signals.</description><Author>Rafal Zdunek and Andrzej Cichocki</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>A Novel Design of 4-Class BCI Using Two Binary Classifiers  and Parallel Mental Tasks</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/437306</link><description>A novel 4-class single-trial brain computer interface (BCI) based
on two (rather than four or more) binary linear discriminant analysis
(LDA) classifiers is proposed, which is called a &amp;#8220;parallel BCI.&amp;#8221; Unlike
other BCIs where mental tasks are executed and classified in a serial
way one after another, the parallel BCI uses properly designed parallel
mental tasks that are executed on both sides of the subject body
simultaneously, which is the main novelty of the BCI paradigm used
in our experiments. Each of the two binary classifiers only classifies
the mental tasks executed on one side of the subject body, and the
results of the two binary classifiers are combined to give the result
of the 4-class BCI. Data was recorded in experiments with both real
movement and motor imagery in 3 able-bodied subjects. Artifacts
were not detected or removed. Offline analysis has shown that, in
some subjects, the parallel BCI can generate a higher accuracy than a
conventional 4-class BCI, although both of them have used the same
feature selection and classification algorithms.</description><Author>Tao Geng, John Q. Gan, Matthew Dyson, Chun SL Tsui, and Francisco Sepulveda</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Pattern Expression Nonnegative Matrix Factorization:  Algorithm and Applications to Blind Source Separation</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/168769</link><description>Independent component analysis (ICA) is a widely applicable and effective approach in blind source separation (BSS), with limitations that sources are statistically independent. However, more common situation is blind source separation for nonnegative linear model (NNLM) where the observations are nonnegative linear combinations of nonnegative sources, and the sources may be statistically dependent. We propose a pattern expression nonnegative matrix factorization (PE-NMF) approach from the view point of using basis vectors most effectively to express patterns. Two regularization or penalty terms are introduced to be added to the original loss function of a standard nonnegative matrix factorization (NMF) for effective expression of patterns with basis vectors in the PE-NMF. Learning algorithm is presented, and the convergence of the algorithm is proved theoretically. Three illustrative examples on blind source separation including heterogeneity correction for gene microarray data indicate that the sources can be successfully recovered with the proposed PE-NMF when the two parameters can be suitably chosen from prior knowledge of the problem.</description><Author>Junying Zhang, Le Wei, Xuerong Feng, Zhen Ma, and Yue Wang</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Extended Nonnegative Tensor Factorisation Models for Musical Sound Source Separation</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/872425</link><description>Recently, shift-invariant tensor factorisation algorithms have been proposed for the purposes of sound source separation of
pitched musical instruments. However, in practice, existing algorithms require the use of log-frequency spectrograms to allow
shift invariance in frequency which causes problems when attempting to resynthesise the separated sources. Further, it is difficult
to impose harmonicity constraints on the recovered basis functions. This paper proposes a new additive synthesis-based
approach which allows the use of linear-frequency spectrograms as well as imposing strict harmonic constraints, resulting in
an improved model. Further, these additional constraints allow the addition of a source filter model to the factorisation framework,
and an extended model which is capable of separating mixtures of pitched and percussive instruments simultaneously.</description><Author>Derry FitzGerald, Matt Cranitch, and Eugene Coyle</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Single-Trial Decoding of Bistable Perception  Based on Sparse Nonnegative Tensor Decomposition</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/642387</link><description>The study of the neuronal correlates of the spontaneous alternation in perception elicited by bistable visual stimuli is promising for understanding the mechanism of neural information processing and the neural basis of visual perception and perceptual decision-making. In this paper, we develop a sparse nonnegative tensor factorization-(NTF)-based method to extract features from the local field potential (LFP), collected from the middle temporal (MT) visual cortex in a macaque monkey, for decoding its bistable structure-from-motion (SFM) perception. We apply the feature extraction approach to the multichannel time-frequency representation of the intracortical LFP data. The advantages of the sparse NTF-based feature extraction approach lies in its capability to yield components common across the space, time, and frequency domains yet discriminative across different conditions without prior knowledge of the discriminating frequency bands and temporal windows for a specific subject. We employ the support vector machines (SVMs) classifier based on the features of the NTF components for single-trial decoding the reported perception. Our results suggest that although other bands also have certain discriminability, the gamma band feature carries the most discriminative information for bistable perception, and that imposing the sparseness constraints on the nonnegative tensor factorization improves extraction of this feature.</description><Author>Zhisong Wang, Alexander Maier, Nikos K. Logothetis, and Hualou Liang</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Robust Object Recognition under Partial Occlusions  Using NMF</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/857453</link><description>In recent years, nonnegative matrix factorization (NMF) methods of a reduced image data representation
attracted the attention of computer vision community. These methods are considered as a convenient part-based
representation of image data for recognition tasks with occluded objects. A novel modification in NMF
recognition tasks is proposed which utilizes the matrix sparseness control introduced by Hoyer. We have
analyzed the influence of sparseness on recognition rates (RRs) for various dimensions of subspaces generated
for two image databases, ORL face database, and USPS handwritten digit database. We have studied the
behavior of four types of distances between a projected unknown image object and feature vectors in NMF subspaces
generated for training data. One of these metrics also is a novelty we proposed. In the recognition
phase, partial occlusions in the test images have been modeled by putting two randomly large, randomly
positioned black rectangles into each test image.</description><Author>Daniel Soukup and Ivan Bajla</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Probabilistic Latent Variable Models as Nonnegative Factorizations</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/947438</link><description>This paper presents a family of probabilistic latent variable models that can be used for analysis of nonnegative data. We show that there are strong ties between nonnegative matrix
factorization and this family, and provide some straightforward extensions which can help in dealing with shift invariances, higher-order decompositions and sparsity constraints. We argue through these extensions that the use of this approach allows for rapid development of complex statistical models for analyzing nonnegative data.</description><Author>Madhusudana Shashanka, Bhiksha Raj, and Paris Smaragdis</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Performance of a Self-Paced Brain Computer Interface on Data 
                        Contaminated with Eye-Movement  Artifacts and on Data Recorded in a 
                        Subsequent Session</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/749204</link><description>The performance of a specific self-paced BCI (SBCI) is investigated using two different datasets to determine its suitability for using online: (1) data contaminated with large-amplitude eye movements, and (2) data recorded in a session subsequent to the original sessions used to design the system. No part of the data was rejected in the subsequent session. Therefore, this dataset can be regarded as a &amp;#8220;pseudo-online&amp;#8221; test set. The SBCI under investigation uses features extracted from three specific neurological phenomena. Each of these neurological phenomena belongs to a different frequency band. Since many prominent artifacts are either of mostly low-frequency (e.g., eye movements) or mostly high-frequency nature (e.g., muscle movements), it is expected that the system shows a fairly robust performance over artifact-contaminated data. Analysis of the data of four participants using epochs contaminated with large-amplitude eye-movement artifacts shows that the system's performance deteriorates only slightly. Furthermore, the system's performance during the session subsequent to the original sessions remained largely the same as in the original sessions for three out of the four participants. This moderate drop in performance can be considered tolerable, since allowing artifact-contaminated data to be used as inputs makes the system available for users at ALL times.</description><Author>Mehrdad Fatourechi, Rabab K. Ward, and Gary E. Birch</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Theorems on Positive Data: On the Uniqueness of NMF</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/764206</link><description>We investigate the conditions for which nonnegative matrix
factorization (NMF) is unique and introduce several
theorems which can determine whether the decomposition
is in fact unique or not. The theorems are illustrated by
several examples showing the use of the theorems and their
limitations. We have shown that corruption of a unique NMF matrix by additive noise leads to a noisy estimation of the noise-free unique solution.  Finally, we use
a stochastic view of NMF to analyze which characterization
of the underlying model will result in an NMF with small
estimation errors.</description><Author>Hans Laurberg, Mads Gr&amp;#230;sb&amp;#248;ll Christensen, Mark D. Plumbley, Lars Kai Hansen, and S&amp;#248;ren Holdt Jensen</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Asymmetric Variate Generation via a Parameterless Dual Neural Learning Algorithm</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/426080</link><description>In a previous work (S. Fiori, 2006), we proposed a random number generator based on a tunable non-linear neural system, whose learning rule is designed on the basis of a cardinal equation from statistics and whose implementation is based on look-up tables (LUTs). The aim of the present manuscript is to improve the above-mentioned random number generation method by changing the learning principle, while retaining the efficient LUT-based implementation. The new method proposed here proves easier to implement and relaxes some previous limitations.</description><Author>Simone Fiori</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Nonnegative Matrix Factorization with Gaussian Process Priors</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/361705</link><description>We present a general method for including prior knowledge in a nonnegative matrix factorization (NMF), based on Gaussian process priors.
We assume that the nonnegative factors in the NMF are linked by a
strictly increasing function to an underlying Gaussian process specified
by its covariance function. This allows us to find NMF decompositions
that agree with our prior knowledge of the distribution of the factors, such
as sparseness, smoothness, and symmetries. The method is demonstrated
with an example from chemical shift brain imaging.</description><Author>Mikkel N. Schmidt and Hans Laurberg</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Gene Tree Labeling Using Nonnegative Matrix  Factorization on Biomedical Literature</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/276535</link><description>Identifying functional groups of genes is a challenging problem for biological applications.
Text mining approaches can be used to build hierarchical clusters or trees from the information in the biological literature. In particular, the nonnegative matrix factorization (NMF) is examined as one approach to label hierarchical trees. A generic labeling algorithm as well as an evaluation technique is proposed, and the effects of different NMF parameters with regard to convergence and labeling accuracy are discussed. The primary goals of this study are to provide a qualitative assessment of the NMF and its various parameters and initialization, to provide an automated way to classify biomedical data, and to provide a method for evaluating labeled data assuming a static input tree. As a byproduct, a method for generating gold standard trees is proposed.</description><Author>Kevin E. Heinrich, Michael W. Berry, and Ramin Homayouni</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>EEG/MEG Signal Processing</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/97026</link><description /><Author>A. Cichocki and S. Sanei</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Brain-Computer Interfaces: Towards Practical Implementations and Potential Applications</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/62637</link><description /><Author>F. Babiloni, A. Cichocki, and S. Gao</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>The P300 as a Marker of Waning Attention  and Error Propensity</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/93968</link><description>Action errors can occur when routine responses are triggered inappropriately by familiar cues. Here, EEG was recorded as volunteers performed a &amp;#8220;go/no-go&amp;#8221; task of long duration that occasionally and unexpectedly required them to withhold a frequent, routine response. EEG
components locked to the onset of relevant go trials were sorted according to whether participants erroneously responded to immediately subsequent no-go trials or correctly withheld
their responses. Errors were associated with a significant relative reduction in the amplitude of
the preceding P300, that is, a judgement could be made bout whether a response-inhibition
error was likely before it had actually occurred. Furthermore, fluctuations in P300 amplitude across the task formed a reliable associate of individual error propensity, supporting its use as a
marker of sustained control over action.</description><Author>Avijit Datta, Rhodri Cusack, Kari Hawkins, Joost Heutink, Chris Rorden, Ian H. Robertson, and Tom Manly</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Classifying EEG for Brain-Computer Interface: Learning Optimal Filters for Dynamical System Features</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/57180</link><description>Classification of multichannel EEG recordings during motor imagination has been exploited successfully for brain-computer
interfaces (BCI). In this paper, we consider EEG signals as the outputs of a networked dynamical system (the cortex), and exploit
synchronization features from the dynamical system for classification. Herein, we also propose a new framework for
learning optimal filters automatically from the data, by employing a Fisher ratio criterion. Experimental evaluations comparing the
proposed dynamical system features with the CSP and the AR features reveal their competitive performance during
classification. Results also show the benefits of employing the spatial and the temporal filters optimized using the proposed learning approach.</description><Author>Le Song and Julien Epps</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>High-Resolution Movement EEG Classification</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/54925</link><description>The aim of the contribution is to analyze possibilities of high-resolution movement classification using human EEG. For this purpose, a database of the EEG recorded during right-thumb and little-finger fast flexion movements of the experimental subjects was created. The statistical analysis of the EEG was done on the subject&amp;#39;s basis instead of the commonly used grand averaging. Statistically significant differences between the EEG accompanying movements of both fingers were found, extending the results of other so far published works. The classifier based on hidden Markov models was able to distinguish between movement and resting states (classification score of 94&amp;#8211;100&amp;#37;), but it was unable to recognize the type of the movement. This is caused by the large fraction of other (nonmovement related) EEG activities in the recorded signals. A classification method based on advanced EEG signal denoising is being currently developed to overcome this problem.</description><Author>Jakub &amp;#352;tastn&amp;#253; and Pavel Sovka</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>A Framework to Support Automated Classification and Labeling of Brain Electromagnetic Patterns</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/14567</link><description>This paper describes a framework for automated classification and labeling of patterns in 
    electroencephalographic (EEG) and magnetoencephalographic (MEG) data. We describe recent progress 
    on four goals: 1) specification of  rules and concepts that capture expert knowledge of event-related
     potentials (ERP) patterns in visual word recognition; 2) implementation of rules in an automated data 
     processing and labeling stream; 3) data mining techniques that lead to refinement of rules; and 4) iterative 
     steps towards system evaluation and optimization. This process combines top-down, or knowledge-driven,
      methods with bottom-up, or data-driven, methods. As illustrated here, these methods are complementary and
       can lead to development of tools for pattern classification and labeling that are robust and conceptually 
       transparent to researchers. The present application focuses on patterns in averaged EEG (ERP) data. We also
        describe efforts to extend our methods to represent patterns in MEG data, as well as EM patterns in source
         (anatomical) space. The broader aim of this work is to design an ontology-based system to support 
         cross-laboratory, cross-paradigm, and cross-modal integration of brain functional data. Tools developed for
          this project are implemented in MATLAB and are freely available on request.</description><Author>Gwen A. Frishkoff, Robert M. Frank, Jiawei Rong, Dejing Dou, Joseph Dien, and Laura K. Halderman</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Removing Ocular Movement Artefacts by a Joint Smoothened Subspace Estimator</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/75079</link><description>To cope with the severe masking of background cerebral activity in the electroencephalogram (EEG) by 
	ocular movement artefacts, we present a method which combines lower-order, short-term and 
	higher-order, long-term statistics. The joint smoothened subspace estimator (JSSE) calculates the joint 
	information in both statistical models, subject to the constraint that the resulting estimated source should
	 be sufficiently smooth in the time domain (i.e., has a large autocorrelation or self predictive power). It is
	  shown that the JSSE is able to estimate a component from simulated data that is superior with respect 
	  to methodological artefact suppression to those of FastICA, SOBI, pSVD, or JADE/COM1 algorithms
	   used for blind source separation (BSS). Interference and distortion suppression are of comparable order 
	   when compared with the above-mentioned methods. Results on patient data demonstrate that the method 
	   is able to suppress blinking and saccade artefacts in a fully automated way.</description><Author>Ronald Phlypo, Paul Boon, Yves D&amp;#39;Asseler, and Ignace Lemahieu</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Automatic Seizure Detection Based on Time-Frequency Analysis and Artificial Neural Networks</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/80510</link><description>The recording of seizures is of primary interest in the evaluation of epileptic
 patients.  Seizure is the phenomenon of rhythmicity  discharge from either a local area 
 or the whole brain and the individual behavior usually lasts from seconds to minutes.  Since seizures, 
 in general, occur infrequently and unpredictably, automatic detection of seizures during long-term
  electroencephalograph (EEG) recordings is highly recommended.  As EEG signals are nonstationary, the
   conventional methods of frequency analysis are not successful for diagnostic purposes.  This paper presents
    a method of analysis of EEG signals, which is based on time-frequency analysis.  Initially, selected segments 
    of the EEG signals are analyzed using time-frequency methods and several features are extracted for each 
    segment, representing the energy distribution in the time-frequency plane.  Then, those features are used as 
    an input in an artificial neural network (ANN), which provides the final classification of the EEG segments
     concerning the existence of seizures or not.  We used a publicly available dataset in order to evaluate our
      method and the evaluation results are very promising indicating overall accuracy from 97.72&amp;#37; to 
      100&amp;#37;.</description><Author>A. T. Tzallas, M. G. Tsipouras, and D. I. Fotiadis</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Canonical Decomposition of Ictal Scalp EEG and Accurate Source Localisation: Principles and Simulation Study</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/58253</link><description>Long-term electroencephalographic (EEG) recordings are important in the presurgical evaluation
of refractory partial epilepsy for the delineation of the ictal onset zones. In this paper, we introduce 
a new concept for an automatic, fast, and objective localisation of the ictal onset zone in ictal EEG
 recordings. Canonical decomposition of ictal EEG decomposes the EEG in atoms. One or more atoms 
 are related to the seizure activity. A single dipole was then fitted to model the potential distribution of 
 each epileptic atom. In this study, we performed a simulation study in order to estimate the dipole
  localisation error. Ictal dipole localisation was very accurate, even at low signal-to-noise ratios, was not 
  affected by seizure activity frequency or frequency changes, and was minimally affected by the waveform 
  and depth of the ictal onset zone location. Ictal dipole localisation error using 21 electrodes was around 
  10.0&amp;#x2009;mm and
improved more than tenfold in the range of 0.5&amp;#8211;1.0&amp;#x2009;mm using 148 channels. In conclusion, our
simulation study of canonical decomposition of ictal scalp EEG allowed a robust and accurate
localisation of the ictal onset zone.</description><Author>Maarten De Vos, Lieven De Lathauwer, Bart Vanrumste, Sabine Van Huffel, and W. Van Paesschen</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>The Implicit Function as Squashing Time Model: A Novel Parallel Nonlinear EEG Analysis Technique Distinguishing Mild Cognitive Impairment and Alzheimer&amp;#39;s Disease Subjects with High Degree of Accuracy</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/35021</link><description>Objective. This paper presents the results obtained 
    using  a protocol based on special types of artificial neural networks 
    (ANNs) assembled in a novel methodology able to compress the temporal sequence 
    of electroencephalographic (EEG) data into spatial invariants for the automatic 
    classification of mild cognitive impairment (MCI) and Alzheimer&amp;#39;s disease (AD) subjects. With 
    reference to the procedure reported in our previous study
(2007), this protocol includes a new type of artificial organism, named 
TWIST. The working hypothesis was that compared to the results presented by the workgroup (2007); the
 new artificial organism TWIST could produce a better classification between AD and MCI. Material
  and methods. Resting eyes-closed EEG data were recorded in 180 AD patients and in 115
   MCI subjects. The data inputs for the classification, instead of being the EEG data, were the weights
    of the connections within a nonlinear autoassociative ANN trained to generate the recorded data. The 
    most relevant features were selected and coincidently the datasets were split in
     the two halves for the final binary classification (training and testing) performed by a supervised ANN. 
Results. The best results distinguishing between AD 
and MCI were equal to 94.10&amp;#37; and they are considerable better than the ones 
reported in our previous study (&amp;#x223C;92&amp;#37;) (2007). Conclusion. The results 
  confirm the working hypothesis that a correct automatic classification of MCI and  AD subjects can 
  be obtained by extracting spatial information content of the resting EEG voltage by ANNs and represent 
  the basis for research aimed at integrating spatial and temporal information content of the EEG.</description><Author>Massimo Buscema, Massimiliano Capriotti, Francesca Bergami, Claudio Babiloni, Paolo Rossini, and Enzo Grossi</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>fMRI Brain-Computer Interface: A Tool for Neuroscientific Research and Treatment</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/25487</link><description>Brain-computer interfaces based on functional magnetic resonance imaging (fMRI-BCI) allow
	 volitional control of anatomically specific regions of the brain. Technological advancement in higher
	  field MRI scanners, fast data acquisition sequences, preprocessing algorithms, and robust statistical
	   analysis are anticipated to make fMRI-BCI more widely available and applicable. This noninvasive 
	   technique could potentially complement the traditional neuroscientific experimental methods by varying
	    the activity of the neural substrates of a region of interest as an independent variable to study its effects 
	    on behavior. If the neurobiological basis of a disorder (e.g., chronic pain, motor diseases, psychopathy, 
	    social phobia, depression) is known in terms of abnormal activity in certain regions of the brain, fMRI-BCI 
	    can be targeted to modify activity in those regions with high specificity for treatment. In this paper, we
	     review recent results of the application of fMRI-BCI to neuroscientific research and psychophysiological
	      treatment.</description><Author>Ranganatha Sitaram, Andrea Caria, Ralf Veit, Tilman Gaber, Giuseppina Rota, Andrea Kuebler, and Niels Birbaumer</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Modern Electrophysiological Methods for  Brain-Computer Interfaces</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/56986</link><description>Modern electrophysiological studies in animals show that the spectrum of neural 
oscillations encoding relevant information is broader than 
previously thought and that many diverse areas are engaged for very simple tasks. However, 
EEG-based brain-computer interfaces 
(BCI) still employ as control modality relatively 
slow brain rhythms or features derived from preselected 
frequencies and scalp locations. Here, we describe the 
strategy and the algorithms we have developed for the analysis of 
electrophysiological data and demonstrate their capacity to 
lead to faster accurate decisions based on linear classifiers. 
To illustrate this strategy, we analyzed two typical BCI tasks. (1) Mu-rhythm control of a cursor 
movement by a paraplegic patient. For this data, we show that although the patient received 
extensive training in mu-rhythm control, valuable information about movement imagination is present 
on the untrained high-frequency rhythms. This is the first demonstration of the importance of high-frequency
 rhythms in imagined limb movements. (2) Self-paced finger tapping task in three healthy subjects including
  the data set used in the BCI-2003 competition. We show that by selecting electrodes and frequency ranges
   based on their discriminative power, the classification rates can be systematically improved with respect to
    results published thus far.</description><Author>Rolando Grave de Peralta Menendez, Quentin Noirhomme, Febo Cincotti, Donatella Mattia, Fabio Aloise, and Sara Gonz&amp;#225;lez Andino</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Online Artifact Removal for Brain-Computer Interfaces Using Support Vector Machines and Blind Source Separation</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/82069</link><description>We propose a combination of blind source separation (BSS) and independent component 
analysis (ICA) (signal decomposition into artifacts and nonartifacts) with support vector machines (SVMs) 
(automatic classification)
that are designed for online usage. In order to select a suitable BSS/ICA method, three ICA algorithms 
(JADE, Infomax, and FastICA) and one BSS algorithm (AMUSE) are evaluated to determine their ability to
 isolate electromyographic (EMG) and electrooculographic (EOG) artifacts into individual components. An
  implementation of the selected BSS/ICA method with SVMs trained to classify EMG and EOG artifacts, which 
  enables the usage of the method as a filter in measurements with online feedback, is described. This filter is
   evaluated on three BCI datasets as a proof-of-concept of the method.</description><Author>Sebastian Halder, Michael Bensch, J&amp;#252;rgen Mellinger, Martin Bogdan, Andrea K&amp;#252;bler, Niels Birbaumer, and Wolfgang Rosenstiel</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Clustering Approach to Quantify Long-Term Spatio-Temporal Interactions in Epileptic Intracranial Electroencephalography</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/83416</link><description>Abnormal dynamical coupling between brain structures is believed to be primarily
responsible for the generation of epileptic seizures and their propagation. In this study, we
attempt to identify the spatio-temporal interactions of an epileptic brain using a previously
proposed nonlinear dependency measure. Using a clustering model, we determine the average
spatial mappings in an epileptic brain at different stages of a complex partial seizure. Results
involving 8 seizures from 2 epileptic patients suggest that there may be a fixed pattern associated
with regional spatio-temporal dynamics during the interictal to pre-post-ictal transition.</description><Author>Anant Hegde, Deniz Erdogmus, Deng S. Shiau, Jose C. Principe, and Chris J. Sackellares</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>A Subspace Method for Dynamical Estimation of  Evoked Potentials</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/61916</link><description>It is a challenge in evoked potential (EP) analysis to incorporate prior physiological
			 knowledge for estimation. In this paper, we address the problem of single-channel trial-to-trial EP 
			 characteristics estimation. Prior information about phase-locked properties of the EPs is assesed by
			  means of estimated signal subspace and eigenvalue decomposition. Then for those situations that
			   dynamic fluctuations from stimulus-to-stimulus could be expected, prior information can be exploited
			    by means of state-space modeling and recursive Bayesian mean square estimation methods (Kalman 
			    filtering and smoothing). We demonstrate that a few dominant eigenvectors of the data correlation matrix 
			    are able to model trend-like changes of some component of the EPs, and that Kalman smoother
			     algorithm is to be preferred in terms of better tracking capabilities and mean square error reduction. We 
			     also demonstrate the effect of strong artifacts, particularly eye blinks, on the quality of the signal 
			     subspace and EP estimates by means of independent component analysis applied as a prepossessing
			      step on the multichannel measurements.</description><Author>Stefanos D. Georgiadis, Perttu O. Ranta-aho, Mika P. Tarvainen, and Pasi A. Karjalainen</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item><item><title>Towards Development of a 3-State Self-Paced Brain-Computer Interface</title><link>http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2007/84386</link><description>Most existing brain-computer interfaces (BCIs) detect specific mental activity in
          a so-called synchronous paradigm. Unlike synchronous systems which are operational at
         specific system-defined periods, self-paced (asynchronous) interfaces have the advantage of
           being operational at all times. The low-frequency asynchronous switch design (LF-ASD) is a
        2-state self-paced BCI that detects the presence of a specific finger movement in the ongoing EEG.
     Recent evaluations of the 2-state LF-ASD show an average true positive rate of 41&amp;#37; at the fixed false
      positive rate of 1&amp;#37;. This paper proposes two designs for a 3-state self-paced BCI that is capable
       of handling idle brain state. The two proposed designs aim at detecting right- and left-hand
     extensions from the ongoing EEG. They are formed of two consecutive detectors. The first detects
the presence of a right- or a left-hand movement and the second classifies the detected movement
 as a right or a left one. In an offline analysis of the EEG data collected from four able-bodied
     individuals, the 3-state brain-computer interface shows a comparable performance with a 2-state
  system and significant performance improvement if used as a 2-state BCI, that is, in detecting the
  presence of a right- or a left-hand movement (regardless of the type of movement). It has an average
  true positive rate of 37.5&amp;#37; and 42.8&amp;#37; (at false positives rate of 1&amp;#37;) in detecting right- and left-hand
   extensions, respectively, in the context of a 3-state self-paced BCI and average detection rate
 of 58.1&amp;#37; (at false positive rate of 1&amp;#37;) in the context of a 2-state self-paced BCI.</description><Author>Ali Bashashati, Rabab K. Ward, and Gary E. Birch</Author><copyright>&amp;#169; 2008, Hindawi Publishing Corporation. All rights reserved.</copyright></item></channel></rss>