Search Results (49)

A brain–computer interface (BCI) provides a direct communication pathway between the human brain and external devices, enabling users to control them through thought. It records brain signals and classifies them into specific commands for external devices. Among various classifiers used in BCI, those directly classifying covariance matrices using Riemannian geometry find broad applications not only in BCI, but also in diverse fields such as computer vision, natural language processing, domain adaption, and remote sensing. However, the existing Riemannian-based methods exhibit limitations, including time-intensive computations, susceptibility to disturbances, and convergence challenges in scenarios involving high-dimensional matrices. In this paper, we tackle these issues by introducing the Bures–Wasserstein (BW) distance for covariance matrices analysis and demonstrating its advantages in BCI applications. Both theoretical and computational aspects of BW distance are investigated, along with algorithms for Fréchet Mean (or barycenter) estimation using BW distance. Extensive simulations are conducted to evaluate the effectiveness, efficiency, and robustness of the BW distance and barycenter. Additionally, by integrating BW barycenter into the Minimum Distance to Riemannian Mean classifier, we showcase its superior classification performance through evaluations on five real datasets. Full article

: A substantial amount of research has demonstrated the robustness and accuracy of the Riemannian minimum distance to mean (MDM) classifier for all kinds of EEG-based brain–computer interfaces (BCIs). This classifier is simple, fully deterministic, robust to noise, computationally efficient, and prone to transfer learning. Its training is very simple, requiring just the computation of a geometric mean of a symmetric positive-definite (SPD) matrix per class. We propose an improvement of the MDM involving a number of power means of SPD matrices instead of the sole geometric mean. By the analysis of 20 public databases, 10 for the motor-imagery BCI paradigm and 10 for the P300 BCI paradigm, comprising 587 individuals in total, we show that the proposed classifier clearly outperforms the MDM, approaching the state-of-the art in terms of performance while retaining the simplicity and the deterministic behavior. In order to promote reproducible research, our code will be released as open source. Full article

The rapid evolution of mega-constellation networks and 6G satellite communication systems has ushered in an era of ubiquitous connectivity, yet their sustainability is threatened by the energy-computation dilemma inherent in high-throughput data transmission. Polar codes, as a coding scheme capable of achieving Shannon’s limit, have emerged as one of the key candidate coding technologies for 6G networks. Despite the high parallelism and excellent performance of their Belief Propagation (BP) decoding algorithm, its drawbacks of numerous iterations and slow convergence can lead to higher energy consumption, impacting system energy efficiency and sustainability. Therefore, research on efficient early termination algorithms has become an important direction in polar code research. In this paper, based on information geometry theory, we propose a novel geometric framework for BP decoding of polar codes and design two early termination algorithms under this framework: an early termination algorithm based on Riemannian distance and an early termination algorithm based on divergence. These algorithms improve convergence speed by geometrically analyzing the changes in soft information during the BP decoding process. Simulation results indicate that, when $E_b/N_0$ is between 1.5 dB and 2.5 dB, compared to three classical early termination algorithms, the two early termination algorithms proposed in this paper reduce the number of iterations by 4.7–11% and 8.8–15.9%, respectively. Crucially, while this work is motivated by the unique demands of satellite networks, the geometric characterization of polar code BP decoding transcends specific applications. The proposed framework is inherently adaptable to any communication system requiring energy-efficient channel coding, including 6G terrestrial networks, Internet of Things (IoT) edge devices, and unmanned aerial vehicle (UAV) swarms, thereby bridging theoretical coding advances with real-world scalability challenges. Full article

This paper presents a new method of path planning for an industrial robot manipulator that performs thermal plasma spraying of coatings. Path planning and automatic generation of the manipulator motion program are performed using preliminary 3D surface scanning data from a laser triangulation distance sensor installed on the same robot arm. The new path planning algorithm is based on constructing a function of the geodesic distance from the starting curve. A new method for constructing a geodesic distance function on a surface is proposed, based on the application of Discrete Exterior calculus methods, which is characterized by a high computational efficiency. The developed algorithms and their software implementation were experimentally tested with the robotic microplasma spraying of a protective coating on the surface of a jaw crusher plate, which was then successfully operated for crushing mineral-based raw materials. Full article

Background: The segmentation of electroencephalography (EEG) signals into a limited number of microstates is of significant importance in the field of cognitive neuroscience. Currently, the microstate analysis algorithm based on global field power has demonstrated its efficacy in clustering resting-state EEG. The task-related EEG was extensively analyzed in the field of brain–computer interfaces (BCIs); however, its primary objective is classification rather than segmentation. Methods: We propose an innovative algorithm for analyzing task-related EEG microstates based on spatial patterns, Riemannian distance, and a modified deep autoencoder. The objective of this algorithm is to achieve unsupervised segmentation and clustering of task-related EEG signals. Results: The proposed algorithm was validated through experiments conducted on simulated EEG data and two publicly available cognitive task datasets. The evaluation results and statistical tests demonstrate its robustness and efficiency in clustering task-related EEG microstates. Conclusions: The proposed unsupervised algorithm can autonomously discretize EEG signals into a finite number of microstates, thereby facilitating investigations into the temporal structures underlying cognitive processes. Full article

An extended four-dimensional version of the traditional Petitot–Citti–Sarti model on contour completion in the visual cortex is examined. The neural configuration space is considered as the group of similarity transformations, denoted as $M=SIM(2)$. The left-invariant subbundle of the tangent bundle models possible directions for establishing neural communication. The sub-Riemannian distance is proportional to the energy expended in interneuron activation between two excited border neurons. According to the model, the damaged image contours are restored via sub-Riemannian geodesics in the space M of positions, orientations and thicknesses (scales). We study the geodesic problem in M using geometric control theory techniques. We prove the existence of a minimal geodesic between arbitrary specified boundary conditions. We apply the Pontryagin maximum principle and derive the geodesic equations. In the special cases, we find explicit solutions. In the general case, we provide a qualitative analysis. Finally, we support our model with a simulation of the association field. Full article

This study introduces a novel method for classifying sets of images, called Riemannian geodesic discriminant analysis–minimum Riemannian mean distance (RGDA-MRMD). This method first converts image data into symmetric positive definite (SPD) matrices, which capture important features related to the variability within the data. These SPD matrices are then mapped onto simpler, flat spaces (tangent spaces) using a mathematical tool called the logarithm operator, which helps to reduce their complexity and dimensionality. Subsequently, regularized local Fisher discriminant analysis (RLFDA) is employed to refine these simplified data points on the tangent plane, focusing on local data structures to optimize the distances between the points and prevent overfitting. The optimized points are then transformed back into a complex, curved space (SPD manifold) using the exponential operator to enhance robustness. Finally, classification is performed using the minimum Riemannian mean distance (MRMD) algorithm, which assigns each data point to the class with the closest mean in the Riemannian space. Through experiments on the ETH-80 (Eidgenössische Technische Hochschule Zürich-80 object category), AFEW (acted facial expressions in the wild), and FPHA (first-person hand action) datasets, the proposed method demonstrates superior performance, with accuracy scores of 97.50%, 37.27%, and 88.47%, respectively. It outperforms all the comparison methods, effectively preserving the unique topological structure of the SPD matrices and significantly boosting image set classification accuracy. Full article

Within the geophysical exploration utilising seismic methods, it is well known that if the explored distances are much greater than the wavelength of the seismic waves with which the exploration is carried out, the ray approach of the wave theory can be used. In this way, when the rays travel through an inhomogeneous medium, they follow curved trajectories, which is imperative to determine the geological features that produce reflection and refraction phenomena. In this paper, a simple algorithm for the calculation of the trajectory of a seismic beam through an inhomogeneous stratum is presented. For this, the construction of a pseudo-Riemannian metric is required from the function of P-wave velocities of the geological stratum. Thus, the problem is inverted because instead of finding the curved trajectory of the seismic beam in a background with a Euclidean metric, it is proposed that the beam follows a geodesic of a curved space-time specific to each stratum, becoming a simple and automatic process using the differential geometry apparatus. For the reader to gain insight into this tool, different geological setups from idealised ones up to a salt dome are presented. Full article

With this follow-up paper, we continue developing a mathematical framework based on information geometry for representing physical objects. The long-term goal is to lay down informational foundations for physics, especially quantum physics. We assume that we can now model information sources as univariate normal probability distributions $\mathcal{N}$ ($\mu$, ${\sigma }_0)$, as before, but with a constant ${\sigma }_0$ not necessarily equal to 1. Then, we also relaxed the independence condition when modeling m sources of information. Now, we model m sources with a multivariate normal probability distribution ${\mathcal{N}}_m(\mathit{\mu },{\mathbf{\Sigma }}_0)$ with a constant variance–covariance matrix ${\mathbf{\Sigma }}_0$ not necessarily diagonal, i.e., with covariance values different to 0, which leads to the concept of modes rather than sources. Invoking Schrödinger’s equation, we can still break the information into m quantum harmonic oscillators, one for each mode, and with energy levels independent of the values of ${\sigma }_0$, altogether leading to the concept of “intrinsic”. Similarly, as in our previous work with the estimator’s variance, we found that the expectation of the quadratic Mahalanobis distance to the sample mean equals the energy levels of the quantum harmonic oscillator, being the minimum quadratic Mahalanobis distance at the minimum energy level of the oscillator and reaching the “intrinsic” Cramér–Rao lower bound at the lowest energy level. Also, we demonstrate that the global probability density function of the collective mode of a set of m quantum harmonic oscillators at the lowest energy level still equals the posterior probability distribution calculated using Bayes’ theorem from the sources of information for all data values, taking as a prior the Riemannian volume of the informative metric. While these new assumptions certainly add complexity to the mathematical framework, the results proven are invariant under transformations, leading to the concept of “intrinsic” information-theoretic models, which are essential for developing physics. Full article

Simple closed formulas for endpoint geodesics on Graßmann manifolds are presented. In addition to realizing the shortest distance between two points, geodesics are also essential tools to generate more sophisticated curves that solve higher order interpolation problems on manifolds. This will be illustrated with the geometric de Casteljau construction offering an excellent alternative to the variational approach which gives rise to Riemannian polynomials and splines. Full article

Electroencephalography (EEG) signals have diverse applications in brain-computer interfaces (BCIs), neurological condition diagnoses, and emotion recognition across healthcare, education, and entertainment domains. This paper presents a robust method that leverages Riemannian geometry to enhance the accuracy of EEG-based emotion classification. The proposed approach involves adaptive feature extraction using principal component analysis (PCA) in the Euclidean space to capture relevant signal characteristics and improve classification performance. Covariance matrices are derived from the extracted features and projected onto the Riemannian manifold. Emotion classification is performed using the minimum distance to Riemannian mean (MDRM) classifier. The effectiveness of the method was evaluated through experiments on four datasets, DEAP, DREAMER, MAHNOB, and SEED, demonstrating its generalizability and consistent accuracy improvement across different scenarios. The classification accuracy and robustness were compared with several state-of-the-art classification methods, which supports the validity and efficacy of using Riemannian geometry for enhancing the accuracy of EEG-based emotion classification. Full article

A geometrical method for assessing stochastic processes in plasma turbulence is investigated in this study. The thermodynamic length methodology allows using a Riemannian metric on the phase space; thus, distances between thermodynamic states can be computed. It constitutes a geometric methodology to understand stochastic processes involved in, e.g., order–disorder transitions, where a sudden increase in distance is expected. We consider gyrokinetic simulations of ion-temperature-gradient (ITG)-mode-driven turbulence in the core region of the stellarator W7-X with realistic quasi-isodynamic topologies. In gyrokinetic plasma turbulence simulations, avalanches, e.g., of heat and particles, are often found, and in this work, a novel method for detection is investigated. This new method combines the singular spectrum analysis algorithm with a hierarchical clustering method such that the time series is decomposed into two parts: useful physical information and noise. The informative component of the time series is used for the calculation of the Hurst exponent, the information length, and the dynamic time. Based on these measures, the physical properties of the time series are revealed. Full article

A novel similarity measure between Gaussian mixture models (GMMs), based on similarities between the low-dimensional representations of individual GMM components and obtained using deep autoencoder architectures, is proposed in this paper. Two different approaches built upon these architectures are explored and utilized to obtain low-dimensional representations of Gaussian components in GMMs. The first approach relies on a classical autoencoder, utilizing the Euclidean norm cost function. Vectorized upper-diagonal symmetric positive definite (SPD) matrices corresponding to Gaussian components in particular GMMs are used as inputs to the autoencoder. Low-dimensional Euclidean vectors obtained from the autoencoder’s middle layer are then used to calculate distances among the original GMMs. The second approach relies on a deep convolutional neural network (CNN) autoencoder, using SPD representatives to generate embeddings corresponding to multivariate GMM components given as inputs. As the autoencoder training cost function, the Frobenious norm between the input and output layers of such network is used and combined with regularizer terms in the form of various pieces of information, as well as the Riemannian manifold-based distances between SPD representatives corresponding to the computed autoencoder feature maps. This is performed assuming that the underlying probability density functions (PDFs) of feature-map observations are multivariate Gaussians. By employing the proposed method, a significantly better trade-off between the recognition accuracy and the computational complexity is achieved when compared with other measures calculating distances among the SPD representatives of the original Gaussian components. The proposed method is much more efficient in machine learning tasks employing GMMs and operating on large datasets that require a large overall number of Gaussian components. Full article

The use of Riemannian geometry decoding algorithms in classifying electroencephalography-based motor-imagery brain–computer interfaces (BCIs) trials is relatively new and promises to outperform the current state-of-the-art methods by overcoming the noise and nonstationarity of electroencephalography signals. However, the related literature shows high classification accuracy on only relatively small BCI datasets. The aim of this paper is to provide a study of the performance of a novel implementation of the Riemannian geometry decoding algorithm using large BCI datasets. In this study, we apply several Riemannian geometry decoding algorithms on a large offline dataset using four adaptation strategies: baseline, rebias, supervised, and unsupervised. Each of these adaptation strategies is applied in motor execution and motor imagery for both scenarios 64 electrodes and 29 electrodes. The dataset is composed of four-class bilateral and unilateral motor imagery and motor execution of 109 subjects. We run several classification experiments and the results show that the best classification accuracy is obtained for the scenario where the baseline minimum distance to Riemannian mean has been used. The mean accuracy values up to 81.5% for motor execution, and up to 76.4% for motor imagery. The accurate classification of EEG trials helps to realize successful BCI applications that allow effective control of devices. Full article

In this paper, we consider the problem of minimizing a continuously differentiable function on the Stiefel manifold. To solve this problem, we develop a geodesic-free proximal point algorithm equipped with Euclidean distance that does not require use of the Riemannian metric. The proposed method can be regarded as an iterative fixed-point method that repeatedly applies a proximal operator to an initial point. In addition, we establish the global convergence of the new approach without any restrictive assumption. Numerical experiments on linear eigenvalue problems and the minimization of sums of heterogeneous quadratic functions show that the developed algorithm is competitive with some procedures existing in the literature. Full article