An Empirical Comparison of Information-Theoretic Criteria in Estimating the Number of Independent Components of fMRI Data

BACKGROUND: Independent Component Analysis (ICA) has been widely applied to the analysis of fMRI data. Accurate estimation of the number of independent components of fMRI data is critical to reduce over/under fitting. Although various methods based on Information Theoretic Criteria (ITC) have been used to estimate the intrinsic dimension of fMRI data, the relative performance of different ITC in the context of the ICA model hasn't been fully investigated, especially considering the properties of fMRI data. The present study explores and evaluates the performance of various ITC for the fMRI data with varied white noise levels, colored noise levels, temporal data sizes and spatial smoothness degrees. METHODOLOGY: Both simulated data and real fMRI data with varied Gaussian white noise levels, first-order auto-regressive (AR(1)) noise levels, temporal data sizes and spatial smoothness degrees were carried out to deeply explore and evaluate the performance of different traditional ITC. PRINCIPAL FINDINGS: Results indicate that the performance of ITCs depends on the noise level, temporal data size and spatial smoothness of fMRI data. 1) High white noise levels may lead to underestimation of all criteria and MDL/BIC has the severest underestimation at the higher Gaussian white noise level. 2) Colored noise may result in overestimation that can be intensified by the increase of AR(1) coefficient rather than the SD of AR(1) noise and MDL/BIC shows the least overestimation. 3) Larger temporal data size will be better for estimation for the model of white noise but tends to cause severer overestimation for the model of AR(1) noise. 4) Spatial smoothing will result in overestimation in both noise models. CONCLUSIONS: 1) None of ITC is perfect for all fMRI data due to its complicated noise structure. 2) If there is only white noise in data, AIC is preferred when the noise level is high and otherwise, Laplace approximation is a better choice. 3) When colored noise exists in data, MDL/BIC outperforms the other criteria

Dynamic behavior analysis via structured rank minimization

Human behavior and affect is inherently a dynamic phenomenon involving temporal evolution of patterns manifested through a multiplicity of non-verbal behavioral cues including facial expressions, body postures and gestures, and vocal outbursts. A natural assumption for human behavior modeling is that a continuous-time characterization of behavior is the output of a linear time-invariant system when behavioral cues act as the input (e.g., continuous rather than discrete annotations of dimensional affect). Here we study the learning of such dynamical system under real-world conditions, namely in the presence of noisy behavioral cues descriptors and possibly unreliable annotations by employing structured rank minimization. To this end, a novel structured rank minimization method and its scalable variant are proposed. The generalizability of the proposed framework is demonstrated by conducting experiments on 3 distinct dynamic behavior analysis tasks, namely (i) conflict intensity prediction, (ii) prediction of valence and arousal, and (iii) tracklet matching. The attained results outperform those achieved by other state-of-the-art methods for these tasks and, hence, evidence the robustness and effectiveness of the proposed approach

Real-time brain computer interface using imaginary movements

Backgroun

Fast Adaptive Blind MMSE Equalizer for Multichannel FIR Systems

<p/> <p>We propose a new blind minimum mean square error (MMSE) equalization algorithm of noisy multichannel finite impulse response (FIR) systems, that relies only on second-order statistics. The proposed algorithm offers two important advantages: a low computational complexity and a relative robustness against channel order overestimation errors. Exploiting the fact that the columns of the equalizer matrix filter belong both to the signal subspace and to the kernel of truncated data covariance matrix, the proposed algorithm achieves blindly a direct estimation of the zero-delay MMSE equalizer parameters. We develop a two-step procedure to further improve the performance gain and control the equalization delay. An efficient fast adaptive implementation of our equalizer, based on the projection approximation and the shift invariance property of temporal data covariance matrix, is proposed for reducing the computational complexity from <inline-formula><graphic file="1687-6180-2006-014827-i1.gif"/></inline-formula> to <inline-formula><graphic file="1687-6180-2006-014827-i2.gif"/></inline-formula>, where <inline-formula><graphic file="1687-6180-2006-014827-i3.gif"/></inline-formula> is the number of emitted signals, <inline-formula><graphic file="1687-6180-2006-014827-i4.gif"/></inline-formula> the data vector length, and <inline-formula><graphic file="1687-6180-2006-014827-i5.gif"/></inline-formula> the dimension of the signal subspace. We then derive a statistical performance analysis to compare the equalization performance with that of the optimal MMSE equalizer. Finally, simulation results are provided to illustrate the effectiveness of the proposed blind equalization algorithm.</p