SearcharxivSearch

arXiv subjects

Ali Yousefi

Publications and source records attributed to Ali Yousefi.

13 recordsLinked to original sources

Hierarchical Stochastic Differential Equation Models for Latent Manifold Learning in Neural Time Series

The manifold hypothesis suggests that high-dimensional neural time series lie on a low-dimensional manifold shaped by simpler underlying dynamics. To uncover this structure, latent dynamical variable models such as state-space models, recurrent neural networks, neural ordinary differential equations, and Gaussian Process Latent Variable Models are widely used. We propose a novel hierarchical stochastic differential equation (SDE) model that balances computational efficiency and interpretability, addressing key limitations of existing methods. Our model assumes the trajectory of a manifold can be reconstructed from a sparse set of samples from the manifold trajectory. The latent space is modeled using Brownian bridge SDEs, with points - specified in both time and value - sampled from a multivariate marked point process. These Brownian bridges define the drift of a second set of SDEs, which are then mapped to the observed data. This yields a continuous, differentiable latent process capable of modeling arbitrarily complex time series as the number of manifold points increases. We derive training and inference procedures and show that the computational cost of inference scales linearly with the length of the observation data. We then validate our model on both synthetic data and neural recordings to demonstrate that it accurately recovers the underlying manifold structure and scales effectively with data dimensionality.

cs.LG

NExT-LF: A Novel Operational Modal Analysis Method via Tangential Interpolation

Operational Modal Analysis (OMA) is vital for identifying modal parameters under real-world conditions, yet existing methods often face challenges with noise sensitivity and stability. This work introduces NExT-LF, a novel method that combines the well-known Natural Excitation Technique (NExT) with the Loewner Framework (LF). NExT enables the extraction of Impulse Response Functions (IRFs) from output-only vibration data, which are then converted into the frequency domain and used by LF to estimate modal parameters. The proposed method is validated through numerical and experimental case studies. In the numerical study of a 2D Euler-Bernoulli cantilever beam, NExT-LF provides results consistent with analytical solutions and those from standard methods, NExT with Eigensystem Realization Algorithm (NExT-ERA) and Stochastic Subspace Identification with Canonical Variate Analysis (SSI). Additionally, NExT-LF demonstrates superior noise robustness, reliably identifying stable modes across various noise levels where NExT-ERA fails. Experimental validation on the Sheraton Universal Hotel is the first OMA application to this structure, confirming NExT-LF as a robust and efficient method for output-only modal parameter identification.

eess.SY

RISE-iEEG: Robust to Inter-Subject Electrodes Implantation Variability iEEG Classifier

Intracranial electroencephalography (iEEG) is increasingly used for clinical and brain-computer interface applications due to its high spatial and temporal resolution. However, inter-subject variability in electrode implantation poses a challenge for developing generalized neural decoders. To address this, we introduce a novel decoder model that is robust to inter-subject electrode implantation variability. We call this model RISE-iEEG, which stands for Robust to Inter-Subject Electrode Implantation Variability iEEG Classifier. RISE-iEEG employs a deep neural network structure preceded by a participant-specific projection network. The projection network maps the neural data of individual participants onto a common low-dimensional space, compensating for the implantation variability. In other words, we developed an iEEG decoder model that can be applied across multiple participants' data without requiring the coordinates of electrode for each participant. The performance of RISE-iEEG across multiple datasets, including the Music Reconstruction dataset, and AJILE12 dataset, surpasses that of advanced iEEG decoder models such as HTNet and EEGNet. Our analysis shows that the performance of RISE-iEEG is about 7\% higher than that of HTNet and EEGNet in terms of F1 score, with an average F1 score of 0.83, which is the highest result among the evaluation methods defined. Furthermore, Our analysis of the projection network weights reveals that the Superior Temporal and Postcentral lobes are key encoding nodes for the Music Reconstruction and AJILE12 datasets, which aligns with the primary physiological principles governing these regions. This model improves decoding accuracy while maintaining interpretability and generalization.

q-bio.NC

Latent Variable Double Gaussian Process Model for Decoding Complex Neural Data

Non-parametric models, such as Gaussian Processes (GP), show promising results in the analysis of complex data. Their applications in neuroscience data have recently gained traction. In this research, we introduce a novel neural decoder model built upon GP models. The core idea is that two GPs generate neural data and their associated labels using a set of low-dimensional latent variables. Under this modeling assumption, the latent variables represent the underlying manifold or essential features present in the neural data. When GPs are trained, the latent variable can be inferred from neural data to decode the labels with a high accuracy. We demonstrate an application of this decoder model in a verbal memory experiment dataset and show that the decoder accuracy in predicting stimulus significantly surpasses the state-of-the-art decoder models. The preceding performance of this model highlights the importance of utilizing non-parametric models in the analysis of neuroscience data.

cs.LG

A Bayesian Gaussian Process-Based Latent Discriminative Generative Decoder (LDGD) Model for High-Dimensional Data

Extracting meaningful information from high-dimensional data poses a formidable modeling challenge, particularly when the data is obscured by noise or represented through different modalities. This research proposes a novel non-parametric modeling approach, leveraging the Gaussian process (GP), to characterize high-dimensional data by mapping it to a latent low-dimensional manifold. This model, named the latent discriminative generative decoder (LDGD), employs both the data and associated labels in the manifold discovery process. We derive a Bayesian solution to infer the latent variables, allowing LDGD to effectively capture inherent stochasticity in the data. We demonstrate applications of LDGD on both synthetic and benchmark datasets. Not only does LDGD infer the manifold accurately, but its accuracy in predicting data points' labels surpasses state-of-the-art approaches. In the development of LDGD, we have incorporated inducing points to reduce the computational complexity of Gaussian processes for large datasets, enabling batch training for enhanced efficient processing and scalability. Additionally, we show that LDGD can robustly infer manifold and precisely predict labels for scenarios in that data size is limited, demonstrating its capability to efficiently characterize high-dimensional data with limited samples. These collective attributes highlight the importance of developing non-parametric modeling approaches to analyze high-dimensional data.

cs.LG

Bayesian Time-Series Classifier for Decoding Simple Visual Stimuli from Intracranial Neural Activity

Understanding how external stimuli are encoded in distributed neural activity is of significant interest in clinical and basic neuroscience. To address this need, it is essential to develop analytical tools capable of handling limited data and the intrinsic stochasticity present in neural data. In this study, we propose a straightforward Bayesian time series classifier (BTsC) model that tackles these challenges whilst maintaining a high level of interpretability. We demonstrate the classification capabilities of this approach by utilizing neural data to decode colors in a visual task. The model exhibits consistent and reliable average performance of 75.55% on 4 patients' dataset, improving upon state-of-the-art machine learning techniques by about 3.0 percent. In addition to its high classification accuracy, the proposed BTsC model provides interpretable results, making the technique a valuable tool to study neural activity in various tasks and categories. The proposed solution can be applied to neural data recorded in various tasks, where there is a need for interpretable results and accurate classification accuracy.

cs.LG

Deep Direct Discriminative Decoders for High-dimensional Time-series Data Analysis

The state-space models (SSMs) are widely utilized in the analysis of time-series data. SSMs rely on an explicit definition of the state and observation processes. Characterizing these processes is not always easy and becomes a modeling challenge when the dimension of observed data grows or the observed data distribution deviates from the normal distribution. Here, we propose a new formulation of SSM for high-dimensional observation processes. We call this solution the deep direct discriminative decoder (D4). The D4 brings deep neural networks' expressiveness and scalability to the SSM formulation letting us build a novel solution that efficiently estimates the underlying state processes through high-dimensional observation signal. We demonstrate the D4 solutions in simulated and real data such as Lorenz attractors, Langevin dynamics, random walk dynamics, and rat hippocampus spiking neural data and show that the D4 performs better than traditional SSMs and RNNs. The D4 can be applied to a broader class of time-series data where the connection between high-dimensional observation and the underlying latent process is hard to characterize.

cs.LG

Novel Method for More Efficient Optimizing the Knowledge-Based Planning: Specific Voxels of each Structure Influenced by Dominant Beamlets (SVSIDB)

There is a huge problem and time-consuming computation to optimize the IMRT treatment plan. Extracting the optimized plan from the predicted 3D3 so-called optimizing the KBP is also involved in this challenge. Some algorithms and methods have been presented for clustering and down-sampling the voxels to make the problem smaller, in recent years. In the current research, a novel down-sampling method is presented for optimizing the knowledge-based planning more efficiently. The concept of SVSIDB and corresponding down-sampling algorithm are proposed under title of SMP-2. The algorithm has been run on the data of 30 patients from the Open-KBP dataset. For each patient, there are 19 sets of dose prediction data in this dataset. Therefore, a total of 570 KBP-optimizing problems have been solved by applying the QuadLin model in the CVX framework. Resulted plans are evaluated and compared regarding two main fields which are the quality of the treatment plan as well as the computation efficiency. Solve time is the evaluation criteria for the latter field i.e. computation efficiency. The results of the current study indicated a remarkable improvement in the computation efficiency. Accordingly, the proposed method, SMP-2, reduced the average solving time by 46% in comparison to the full-data QuadLin model. The results also show an up to 53% reduction in solve time along with up to 22% improvement in clinical criteria compared to the previous research. Evaluation of the research results indicated that the SVSIDB has not only reduced the solve time but also improved the quality of the treatment plans. This is a remarkable achievement of the proposed model compared to the previous research and confirmed the significant effectiveness of the SVSIDB method which has the potential of even more improvement of the computation efficiency.

physics.med-ph

How to Apply 3D3 Prediction? A Novel Mathematical Model to Generate Pareto Optimal Clinical Applicable IMRT Treatment Plan On the Foundation of Dose Prediction and Prescription

In this paper knowledge based planning has been revolutionized via a novel mathematical model which converts three dimensional dose distribution (3D3) prediction to a clinical utilizable IMRT treatment plan. Presented model has benefited from both prescribed dose as well as predicted dose and its objective function includes both quadratic and linear phrases, so it was called QuadLin model. The model has been run on the data of 30 patients with head and neck cancer randomly selected from the Open KBP dataset. For each patient, there are 19 sets of dose prediction data in this database. Therefore, a total of 570 problems have been solved in the CVX framework and the results have been evaluated by two plan quality approaches: 1- DVH points differences, and 2- satisfied clinical criteria. The results of the current study indicate a strong significant improvement in clinical indicators compared to the reference plan of the dataset, 3D3 predictions, as well as the results of previous researches. Accordingly, on average for 570 problems and total ROIs, clinical indicators have improved by more than 21% and 15% compared to the predicted dose and previous research, respectively.

math.OC

Latent Factor Decomposition Model: Applications for Questionnaire Data

The analysis of clinical questionnaire data comes with many inherent challenges. These challenges include the handling of data with missing fields, as well as the overall interpretation of a dataset with many fields of different scales and forms. While numerous methods have been developed to address these challenges, they are often not robust, statistically sound, or easily interpretable. Here, we propose a latent factor modeling framework that extends the principal component analysis for both categorical and quantitative data with missing elements. The model simultaneously provides the principal components (basis) and each patients' projections on these bases in a latent space. We show an application of our modeling framework through Irritable Bowel Syndrome (IBS) symptoms, where we find correlations between these projections and other standardized patient symptom scales. This latent factor model can be easily applied to different clinical questionnaire datasets for clustering analysis and interpretable inference.

cs.LG

Regimes of heat transfer in particle suspensions

We present results of interface-resolved simulations of heat transfer in suspensions of finite-size neutrally-buoyant spherical particles for solid volume fractions up to 35% and bulk Reynolds numbers from 500 to 5600. An Immersed Boundary-Volume of Fluid method is used to solve the energy equation in the fluid and solid phase. We relate the heat transfer to the regimes of particle motion previously identified, i.e. a viscous regime at low volume fractions and low Reynolds number, particle-laden turbulence at high Reynolds and moderate volume fraction and particulate regime at high volume fractions. We show that in the viscous dominated regime, the heat transfer is mainly due to thermal diffusion with enhancement due to the particle-induced fluctuations. In the turbulent-like regime, we observe the largest enhancement of the global heat transfer, dominated by the turbulent heat flux. In the particulate shear-thickening regime, however, the heat transfer enhancement decreases as mixing is quenched by the particle migration towards the channel core. As a result, a compact loosely-packed core region forms and the contribution of thermal diffusion to the total heat transfer becomes significant once again. The global heat transfer becomes, in these flows at volume fractions larger than 25%, lower than in single-phase turbulence.

physics.flu-dyn

Time Divergence-Convergence Learning Scheme in Multi-Layer Dynamic Synapse Neural Networks

A new learning scheme called time divergence-convergence (TDC) is proposed for two-layer dynamic synapse neural networks (DSNN). DSNN is an artificial neural network model, in which the synaptic transmission is modeled by a dynamic process and the information between neurons are transmitted through spike timing. In TDC, the intra-layer neurons of a DSNN are trained to map input spike trains to a higher dimension of spike trains called a feature-domain, and the output neurons are trained to build the desired spike trains by processing the spike timing of intralayer neurons. The DSNN performance was examined in a jittered spike train classification task which shows more than 92\% accuracy in classifying different spike trains. The DSNN performance is comparable with the recurrent multi-layer neural networks and surpasses a single-layer DSNN with a 22\% margin. Synaptic dynamics have been proposed as the neural substrate for sub-second temporal processing; we can utilize TDC to train a DSNN to perform diverse forms of sub-second temporal processing. The TDC learning proposed here is scalable in terms of the synaptic adaptation of deeper layers of multi-layer DSNNs. The DSNN along with TDC learning proposed here can be used in to replicate the processing observed in neural circuitry and in pattern recognition tasks.

q-bio.NC

Foot anthropometry device and single object image thresholding

This paper introduces a device, algorithm and graphical user interface to obtain anthropometric measurements of foot. Presented device facilitates obtaining scale of image and image processing by taking one image from side foot and underfoot simultaneously. Introduced image processing algorithm minimizes a noise criterion, which is suitable for object detection in single object images and outperforms famous image thresholding methods when lighting condition is poor. Performance of image-based method is compared to manual method. Image-based measurements of underfoot in average was 4mm less than actual measures. Mean absolute error of underfoot length was 1.6mm, however length obtained from side foot had 4.4mm mean absolute error. Furthermore, based on t-test and f-test results, no significant difference between manual and image-based anthropometry observed. In order to maintain anthropometry process performance in different situations user interface designed for handling changes in light conditions and altering speed of the algorithm.

cs.CV