Comparison of tests for embeddings

Motor execution reduces EEG signals complexity: Recurrence quantification analysis study

The development of new approaches to detect motor-related brain activity is key in many aspects of science, especially in brain-computer interface applications. Even though some well-known features of motor-related electroencephalograms have been revealed using traditionally applied methods, they still lack a robust classification of motor-related patterns. Here, we introduce new features of motor-related brain activity and uncover hidden mechanisms of the underlying neuronal dynamics by considering event-related desynchronization (ERD) of μ-rhythm in the sensorimotor cortex, i.e., tracking the decrease of the power spectral density in the corresponding frequency band. We hypothesize that motor-related ERD is associated with the suppression of random fluctuations of μ-band neuronal activity. This is due to the lowering of the number of active neuronal populations involved in the corresponding oscillation mode. In this case, we expect more regular dynamics and a decrease in complexity of the EEG signal recorded over the sensorimotor cortex. In order to support this, we apply measures of signal complexity by means of recurrence quantification analysis (RQA). In particular, we demonstrate that certain RQA quantifiers are very useful to detect the moment of movement onset and, therefore, are able to classify the laterality of executed movements.

Use of False Nearest Neighbours for Selecting Variables and Embedding Parameters for State Space Reconstruction

If data are generated by a system with a d-dimensional attractor, then Takens’ theorem guarantees that reconstruction that is diffeomorphic to the original attractor can be built from the single time series in 2d+1-dimensional phase space. However, under certain conditions, reconstruction is possible even in a space of smaller dimension. This topic is very important because the size of the reconstruction space relates to the effectiveness of the whole subsequent analysis. In this paper, the false nearest neighbour (FNN) methods are revisited to estimate the optimum embedding parameters and the most appropriate observables for state space reconstruction. A modification of the false nearest neighbour method is introduced. The findings contribute to evidence that the length of the embedding time window (TW) is more important than the reconstruction delay time and the embedding dimension (ED) separately. Moreover, if several time series of the same system are observed, the choice of the one that is used for the reconstruction could also be critical. The results are demonstrated on two chaotic benchmark systems.

Optimal state-space reconstruction using derivatives on projected manifold

A paradigm for optimal state-space reconstruction with nonuniform time delays is proposed. A comparison based on a diffeomorphic measure and a smoothness cost function shows that the proposed methodology achieves a better reconstruction compared to a reconstruction based on time delays that are multiples of the first minimum of mutual information. It is also shown how the proposed methodology is a more reliable approach to determining the embedding dimension.

Polynomial search and global modeling: Two algorithms for modeling chaos

Global modeling aims to build mathematical models of concise description. Polynomial Model Search (PoMoS) and Global Modeling (GloMo) are two complementary algorithms (freely downloadable at the following address: http://www.cesbio.ups-tlse.fr/us/pomos_et_glomo.html) designed for the modeling of observed dynamical systems based on a small set of time series. Models considered in these algorithms are based on ordinary differential equations built on a polynomial formulation. More specifically, PoMoS aims at finding polynomial formulations from a given set of 1 to N time series, whereas GloMo is designed for single time series and aims to identify the parameters for a selected structure. GloMo also provides basic features to visualize integrated trajectories and to characterize their structure when it is simple enough: One allows for drawing the first return map for a chosen Poincaré section in the reconstructed space; another one computes the Lyapunov exponent along the trajectory. In the present paper, global modeling from single time series is considered. A description of the algorithms is given and three examples are provided. The first example is based on the three variables of the Rössler attractor. The second one comes from an experimental analysis of the copper electrodissolution in phosphoric acid for which a less parsimonious global model was obtained in a previous study. The third example is an exploratory case and concerns the cycle of rainfed wheat under semiarid climatic conditions as observed through a vegetation index derived from a spatial sensor.