In brain-computer interfaces the typical models of the EEG observations usually lead to a poor estimation of the trial covariance matrices, given the high non-stationarity of the EEG sources. We propose the application of two techniques that significantly improve the accuracy of these estimations and can be combined with a wide range of motor imagery BCI methods. The first one scales the observations in such a way that implicitly normalizes the common temporal strength of the source activities. When the scaling applies independently to the trials of the observations the procedure justifies and improves the classical preprocessing for the EEG data. Additionally, when the scaling is instantaneous and independent for each sample, the procedure particularizes to Tyler’s method in statistics for obtaining a distribution-free estimate of scattering. In this case, the proposal provides an original interpretation of this existing method as a technique that pursuits an implicit instantaneous power-normalization of the underlying source processes. The second technique applies to the classifier and improves its performance through a convenient regularization of the features covariance matrix. Experimental tests reveal that a combination of the proposed techniques with state-of-the-art algorithms for motor-imagery classification provides a significant improvement in the classification results.
The problem of blind source separation of complex-valued sources from a linear mixture is addressed. We propose a deflationary algorithm for the sequential recovery of a set of communication signals, where each source is extracted by performing a Bounded Component Analysis of the linear mixture. The contribution of each recovered source to the observations is removed by minimizing its convex perimeter, without using second-order statistics. This implies to run a gradient descent algorithm several times. In order to accelerate the convergence, we have derived a fast step size that exploits the second-order information of the cost function by means of the augmented Hessian matrix. Computer simulations show that the proposed method is able to blindly separate even dependent sources, as long as they satisfy the BCA separability conditions. Also, the speed of convergence of this novel step size is compared with other classical approaches.
Se presentan y discuten algunas reflexiones sobre los principales problemas que los profesores principiantes encuentran en la enseñanza universitaria. Dichas dificultades se clasifican y analizan en tres ámbitos: el de la enseñanza, el de las relaciones interpersonales y el de la gestión o el contexto institucional. Se resalta la importancia de una adecuada formación pedagógica por parte del docente novel y el papel de la acción tutorial. Se revisa también los retos que suponen para el profesor principiante la actual reforma del modelo universitario español en el marco del Espacio Europeo de Educación Superior y el conflicto investigación-docencia. Esto porque la actividad investigadora no sólo es indispensable para la continua evolución científica del profesor universitario, sino que también depende de ella su continuidad en la carrera docente. Dicha actividad es a menudo difícil de compatibilizar con la puramente docente, especialmente para el docente principiante.
Centroid-based clustering is a widely used technique within unsupervised learning algorithms in many research fields. The success of any centroid-based clustering relies on the choice of the similarity measure under use. In recent years, most studies focused on including several divergence measures in the traditional hard k-means algorithm. In this article, we consider the problem of centroid-based clustering using the family of -divergences, which is governed by two parameters, and . We propose a new iterative algorithm, -k-means, giving closed-form solutions for the computation of the sided centroids. The algorithm can be fine-tuned by means of this pair of values, yielding a wide range of the most frequently used divergences. Moreover, it is guaranteed to converge to local minima for a wide range of values of the pair ( ). Our theoretical contribution has been validated by several experiments performed with synthetic and real data and exploring the ( ) plane. The numerical results obtained confirm the quality of the algorithm and its suitability to be used in several practical applications.