Time-resolved angiography with interleaved stochastic trajectories (TWIST) has been widely used for dynamic contrast enhanced MRI (DCE-MRI). To achieve highly accelerated acquisitions, TWIST combines the periphery of the k-space data from several adjacent frames to reconstruct one temporal frame. However, this view-sha…
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,657 papers · 148 categories
Trend · papers per month
23 results for “time-resolved”
New unsupervised deep learning method improves temporal resolution in tMRA.
problem Limited temporal resolution in tMRA due to fixed view-sharing scheme.
method Optimal transport driven cycle-consistent generative adversarial network (cycleGAN) without fully sampled k-space reference data.
result Can generate high quality reconstructions at various temporal resolutions.
Deep learning-based prediction of time-resolved adhesive forces in viscoelastic Hertzian contactscs.LG
Deep learning predicts adhesive forces in soft viscoelastic contacts quickly and accurately.
problem Predicting the full time-resolved force trajectory of adhesive soft viscoelastic contacts is computationally expensive and impractical.
method Trained a deep learning model to predict the full force evolution from a prescribed displacement history, using FMS representation and various architectures.
result Best-performing model predicts complete force trajectory with low error metrics and fast inference time.
In this work, a novel approach is proposed for joint analysis of high dimensional time-resolved cardiac motion features obtained from segmented cardiac MRI and low dimensional clinical risk factors to improve survival prediction in heart failure. Different methods are evaluated to find the optimal way to insert convent…
Causal Compressionstat.ML
We propose a new method of discovering causal relationships in temporal data based on the notion of causal compression. To this end, we adopt the Pearlian graph setting and the directed information as an information theoretic tool for quantifying causality. We introduce chain rule for directed information and use it to…
Empirical data on real complex systems are becoming increasingly available. Parallel to this is the need for new methods of reconstructing (inferring) the topology of networks from time-resolved observations of their node-dynamics. The methods based on physical insights often rely on strong assumptions about the proper…
We present a convolutional-recurrent neural network architecture with long short-term memory for real-time processing and classification of digital sensor data. The network implicitly performs typical signal processing tasks such as filtering and peak detection, and learns time-resolved embeddings of the input signal. …
Patient journeys are compared to find clusters of similar disease trajectories.
problem Discovering shared health outcomes among patient journeys.
method Comparing longitudinal health data to identify clusters of similar patient trajectories.
result Clusters of patient journeys with similar health outcomes can be identified.
Gaussian processes enhance EO with accurate and uncertain predictions.
problem Challenges in GP models for EO, including data-driven physics and causal inference.
method Data-driven physics-aware models respecting signal characteristics and physical laws.
result GP models need to evolve for better EO applications.
The last decades have not only been characterized by an explosive growth of data, but also an increasing appreciation of data as a valuable resource. Their value comes with the ability to extract meaningful patterns that are of economic, societal or scientific relevance. A particular challenge is the identification of …
Deep learning techniques have revolutionized the field of machine learning and were recently successfully applied to various classification problems in noninvasive electroencephalography (EEG). However, these methods were so far only rarely evaluated for use in intracranial EEG. We employed convolutional neural network…
TNDE quantifies dynamic gene drivers from single-cell snapshots.
problem Reconstructing time-resolved regulatory effects in biological processes.
method Time-varying Network Driver Estimation (TNDE) using shared graph attention encoder and partial optimal transport.
result TNDE identifies stage-specific driver genes in mouse erythropoiesis.
New model extracts shared brain activity patterns from fMRI data.
problem Challenges in aggregating multi-subject fMRI data due to variability.
method Shared Gaussian Process Factor Analysis (S-GPFA) incorporating temporal information.
result Model reveals ground truth latent structures and replicates experimental performance.
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…
Motion analysis is used in computer vision to understand the behaviour of moving objects in sequences of images. Optimising the interpretation of dynamic biological systems requires accurate and precise motion tracking as well as efficient representations of high-dimensional motion trajectories so that these can be use…
Gaussian processes (GPs) are flexible distributions over functions that enable high-level assumptions about unknown functions to be encoded in a parsimonious, flexible and general way. Although elegant, the application of GPs is limited by computational and analytical intractabilities that arise when data are sufficien…
A new method learns dynamic graph representations from time-varying data.
problem Learning dynamic graph representations from time-varying data.
method Higher-order skip-gram with negative sampling (HOSGNS) for tensor factorization.
result HOSGNS outperforms state-of-the-art methods in downstream tasks.
Autonomous Discovery of Unknown Reaction Pathways from Data by Chemical Reaction Neural Networkq-bio.MN
Chemical reactions occur in energy, environmental, biological, and many other natural systems, and the inference of the reaction networks is essential to understand and design the chemical processes in engineering and life sciences. Yet, revealing the reaction pathways for complex systems and processes is still challen…
Model tracks structural changes in Brownian particle configurations on a sphere.
problem Tracking structural changes in Brownian particle configurations on a sphere.
method Introduces Frustrated Distance Matrix (FDM) model for dynamic distance matrices on S^2.
result Preserves static BBS template with dynamics as redistributed spectral mass.
New model bridges pricing and reserving for insurance claims.
problem Incomplete claim data due to reporting and settlement delays.
method Develops an occurrence and development model to estimate both claims and premiums.
result Effective resolution of pricing and reserving inconsistencies.
Unified framework maps financial market dynamics using TE and KM, revealing directional information flow.
problem Challenges in traditional correlation analysis of financial markets, especially during crises.
method Combines Transfer Entropy (TE) and Kramers-Moyal (KM) expansion to analyze dynamic interactions among major indices.
result Increased directional information flow during crises, highlighting gold-dollar and oil-equity linkages.
Jointly estimates flow fields and particle properties from Lagrangian data.
problem Estimating flow fields and particle properties from sparse, noisy Lagrangian data.
method Data assimilation framework coupling Eulerian and Lagrangian models.
result Joint estimation of flow fields and particle properties in various flow regimes.
Project infinite time series graphs to finite marginal models using number theory.
problem Handling infinite time series graphs for causal inference.
method Projection method using number theory to find common ancestors in infinite graphs.
result Developed algorithm to project infinite graphs to finite marginal models.