Machine learning (ML) techniques such as (deep) artificial neural networks (DNN) are solving very successfully a plethora of tasks and provide new predictive models for complex physical, chemical, biological and social systems. However, in most cases this comes with the disadvantage of acting as a black box, rarely pro…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “Gait Cycle”
PerCDL learns personalized dictionaries for physiological signals combining global and local structures.
problem Representing datasets with both global and local structures in human physiological signals.
method Personalized Convolutional Dictionary Learning (PerCDL) that combines a global and personalized local dictionary.
result PerCDL effectively learns interpretable representations for human locomotion data.
The fact that every human has a distinctive walking style has prompted a proposal to use gait recognition as an identification criterion. Using end-to-end learning, I investigated whether the center-of-pressure trajectory is sufficiently unique to identify a person with a high certainty. Thirty-six adults walked on a t…
Gait patterns reveal emotions, offering a non-invasive method for automated recognition.
problem Automated emotion recognition from gait patterns.
method Data collection, preprocessing, and classification techniques.
result Gait patterns can indicate different emotion states, making them a promising source for emotion detection.
Bayesian model predicts circular data with fast Gibbs sampling.
problem Predicting circular data in scientific fields.
method Expressive von Mises quasi-processes with Stratonovich augmentation for posterior inference.
result Fast Gibbs sampling for posterior inference.
In quadruped gait learning, policy search methods that scale high dimensional continuous action spaces are commonly used. In most approaches, it is necessary to introduce prior knowledge on the gaits to limit the highly non-convex search space of the policies. In this work, we propose a new approach to encode the symme…
Compared to other biometrics, gait is difficult to conceal and has the advantage of being unobtrusive. Inertial sensors, such as accelerometers and gyroscopes, are often used to capture gait dynamics. These inertial sensors are commonly integrated into smartphones and are widely used by the average person, which makes …
Phone sensors could be useful in assessing changes in gait that occur with alcohol consumption. This study determined (1) feasibility of collecting gait-related data during drinking occasions in the natural environment, and (2) how gait-related features measured by phone sensors relate to estimated blood alcohol concen…
ES-VAE models skeletal pose trajectories by removing nuisance factors.
problem Handling camera orientation, subject scale, viewpoint, and execution speed in skeletal data.
method ES-VAE uses TSRVF representation on Kendall's shape manifold to isolate shape dynamics.
result ES-VAE outperforms standard VAEs and sequence modeling baselines in gait cycle prediction and action recognition.
In this paper, we introduce a new gait segmentation method based on accelerometer data and develop a new distance function between two time series, showing novel and effectiveness in simultaneously identifying user and adversary. Comparing with the normally used Neural Network methods, our approaches use geometric feat…
The Poincaré map is widely used to study the qualitative behavior of dynamical systems. For instance, it can be used to describe the existence of periodic solutions. The Poincaré map for dynamical systems with impulse effects was introduced in the last decade and mainly employed to study the existence of limit cycles (…
Paper predicts TUG score from gait characteristics using machine learning.
problem Assessing fall risk in the elderly.
method 3D pose estimation, gait characteristics computation, copula entropy selection, predictive models.
result Effectiveness of the proposed method demonstrated on real-world data.
Gait is a person's natural walking style and a complex biological process that is unique to each person. Recently, the channel state information (CSI) of WiFi devices have been exploited to capture human gait biometrics for user identification. However, the performance of existing CSI-based gait identification systems …
Machine learning (ML) is increasingly used to support decision-making in the healthcare sector. While ML approaches provide promising results with regard to their classification performance, most share a central limitation, namely their black-box character. Motivated by the interest to understand the functioning of ML …
Gait event detection of the initial contact and toe off is essential for running gait analysis, allowing the derivation of parameters such as stance time. Heuristic-based methods exist to estimate these key gait events from tibial accelerometry. However, these methods are tailored to very specific acceleration profiles…
GAIT-prop derives a biologically plausible learning rule from backpropagation.
problem Biological implausibility in traditional backpropagation for neural networks.
method GAIT-prop uses a top-down model to convert output error into plausible targets for weight updates.
result GAIT-prop and backpropagation give identical weight updates under certain conditions.
The design of gaits for robot locomotion can be a daunting process which requires significant expert knowledge and engineering. This process is even more challenging for robots that do not have an accurate physical model, such as compliant or micro-scale robots. Data-driven gait optimization provides an automated alter…
Parkinson's disease is a neurodegenerative disorder characterized by the presence of different motor impairments. Information from speech, handwriting, and gait signals have been considered to evaluate the neurological state of the patients. On the other hand, user models based on Gaussian mixture models - universal ba…
Human movements are characterized by highly non-linear and multi-dimensional interactions within the motor system. Recently, an increasing emphasis on machine-learning applications has led to a significant contribution to the field of gait analysis, e.g., in increasing the classification performance. In order to ensure…
Pre-trained model from healthy ADLs improves gait pattern classification for Parkinson's disease.
problem Limited training data for deep learning models in healthcare applications.
method Used convolutional autoencoder to extract features from healthy ADLs data and trained a multi-layer perceptron model for Parkinson's disease classification.
result Features extracted from healthy ADLs data can be used to train an effective classification model for Parkinson's disease.
Wi-Fi signals-based person identification attracts increasing attention in the booming Internet-of-Things era mainly due to its pervasiveness and passiveness. Most previous work applies gaits extracted from WiFi distortions caused by the person walking to achieve the identification. However, to extract useful gait, a p…
Freezing of gait (FoG) is a common gait disability in Parkinson's disease, that usually appears in its advanced stage. Freeze episodes are associated with falls, injuries, and psychological consequences, negatively affecting the patients' quality of life. For detecting FoG episodes automatically, a highly accurate dete…
New framework for task-independent legged locomotion.
problem Building stable legged locomotion systems in robotics.
method Task-independent spiking central pattern generator using learning methods.
result Robotic legged locomotion at different speeds and within the same gait cycle.
Machine learning classifies Parkinson's Disease stages from walker sensors data.
problem Limited cost-effective methods for quantitatively assessing Parkinson's Disease stages.
method Machine learning applied to walker-mounted sensors data, feature selection methods compared.
result Feature selection method using ANOVA provides similar accuracy to full feature set and is clinically interpretable.
New system uses wearable bio-signals for easy authentication.
problem Security of private information on wearables is a concern.
method Context-dependent soft-biometric authentication using heart rate, gait, and breathing audio.
result Binary SVM with RBF kernel achieves high accuracy and low EER.
Model uses smartphone data to assess MS trajectories.
problem Personalized longitudinal MS assessment.
method Imputation, generalized estimation equation, ensemble learning, fine-tuning.
result Promising model for predicting MS over time.
Deep reinforcement learning (deep RL) holds the promise of automating the acquisition of complex controllers that can map sensory inputs directly to low-level actions. In the domain of robotic locomotion, deep RL could enable learning locomotion skills with minimal engineering and without an explicit model of the robot…
Study shows not all ML models are uniquely identifiable from data.
problem Identifiability issues in machine learning models.
method Investigated through a case study on gait dynamics using a bipedal-spring mass model.
result Some parameters can be identified, but others remain unidentifiable.
Odd crossing numbers and even rotation numbers for cycles in plane immersions.
problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.
Proves inequality for 1-dimensional cycles.
problem Proving the Parametric Coarea Inequality for 1-cycles.
method Analytical proof based on conjecture by Guth and Liokumovich.
result Proved the Parametric Coarea Inequality for 1-cycles.
This work introduces novel methods to identify and compare cycles across topological objects.
problem Identifying and comparing topological features, particularly cycles, across different topological objects.
method Two complementary approaches: dendrogram-based merge-tree algorithms and Stratified Gradient Sampling.
result Transformed cycle matching into hierarchical clustering and topological optimization framework.
This article introduces proximal planar vortex 1-cycles, resembling the structure of vortex atoms introduced by William Thomson (Lord Kelvin) in 1867 and recent work on the proximity of sets that overlap either spatially or descriptively. Vortex cycles resemble Thomson's model of a vortex atom, inspired by P.G. Tait's …
This paper identifies the unique efficient cycle for most hyperbolic manifolds but not for the figure-8 knot complement.
problem Identifying the unique efficient cycle for hyperbolic manifolds.
method Analyzing the limit of fundamental cycles and their -norm convergence.
result The uniqueness of the efficient cycle is proven for most hyperbolic manifolds but not for the figure-8 knot complement.
Study Agol cycles for pseudo-Anosov 3-braids.
problem Conditions for equivalent Agol cycles of pseudo-Anosov 3-braids.
method Investigate necessary and sufficient conditions.
result Necessary and sufficient conditions for equivalent Agol cycles of pseudo-Anosov 3-braids.
Study shows credit expansion in mortgage markets influenced U.S. business cycle.
problem Lack of causal evidence in cross-country business cycle studies.
method Unique research design combining cross-metropolitan U.S. data.
result Credit expansion caused stronger booms and busts in house-related industries.
Researchers compute Connes-Chamseddine cycle on 6D manifolds using noncommutative integral.
problem Computing the Connes-Chamseddine cycle for 6D manifolds.
method Using noncommutative integral on 6D manifolds, they compute the cycle.
result The Connes-Chamseddine cycle on 6D manifolds is computed.
Gauss diagrams' properties can change with Hamiltonian cycle choice.
problem The impact of Hamiltonian cycle choice on Gauss diagrams.
method Examined realizable and unrealizable Gauss diagrams, and proved preservation of realizability under certain Hamiltonian cycle changes.
result Properties of Gauss diagrams can vary with Hamiltonian cycle choice.
Proximal algorithms applied to current deformation into cycles.
problem Deformation of de Rham currents into cycles.
method Proximal algorithms, total variation denoising for differential forms.
result Calibrated cycles constructed in calibrated manifolds.
New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.
problem Learning causal structures with cycles in linear non-Gaussian models.
method Characterizing when graphs determine the same model, using quadratic and cubic polynomial relations, and a strategy of decorrelating cycles and multivariate regression.
result Consistent and computationally efficient algorithm for learning causal structures with disjoint cycles.
Credit expansion led to stronger household leverage cycles during the U.S. business cycle.
problem Understanding the role of credit supply in the U.S. business cycle.
method Causal evidence from 1999-2010 U.S. business cycle data.
result Credit expansion, particularly in private-label mortgages, caused stronger household leverage cycles.
In the current article we study complex cycles of higher multiplicity in a specific polynomial family of holomorphic foliations in the complex plane. The family in question is a perturbation of an exact polynomial one-form giving rise to a foliation by Riemann surfaces. In this setting, a complex cycle is defined as a …
In this paper, we introduce a novel task for machine learning in healthcare, namely personalized modeling of the female hormonal cycle. The motivation for this work is to model the hormonal cycle and predict its phases in time, both for healthy individuals and for those with disorders of the reproductive system. Becaus…
AdaBoost cycles in probability simplex dynamics.
problem Understanding cycling behavior in AdaBoost.
method Computational methods and dynamical systems analysis.
result Correspondence between AdaBoost cycling and continued fractions dynamics.
Smooth approximation of integral cycles mod 2 in Riemannian manifolds.
problem Approximating mod 2 integral cycles by smooth submanifolds.
method Approximation of mod 2 integral cycles by smooth submanifolds with controlled singularities.
result Every mod 2 integral cycle can be approximated by a smooth submanifold with a controlled singular set.
Constructs an explicit cycle in arithmetic group cohomology.
problem Cohomology of SL at virtual cohomological dimension.
method Geometric rigidity of Voronoi tessellations and abstract framework for polyhedral tessellations.
result Explicit canonical cycle in top-dimensional homology of Voronoi complex.
Using Kontsevich's identification of the homology of the Lie algebra l_infty with the cohomology of Out(F_r), Morita defined a sequence of 4k-dimensional classes mu_k in the unstable rational homology of Out(F_{2k+2}). He showed by a computer calculation that the first of these is non-trivial, so coincides with the uni…
We introduce a notion of vanishing Maslov index for lagrangian varifolds and lagrangian integral cycles in a Calabi-Yau manifold. We construct mass-decreasing flows of lagrangian varifolds and lagrangian cycles which satisfy this condition. The flow of cycles converges, at infinite time, to a sum of special lagrangian …
Approximates cycles in planar and bounded-genus graphs.
problem Finding many disjoint cycles in planar and bounded-genus graphs.
method Constant-factor approximation algorithms for vertex-disjoint and edge-disjoint cycles.
result First algorithms for vertex-disjoint paths in fully planar and bounded-genus instances.