Research
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,742 papers · 148 categories

Trend · papers per month

96192288384 · May 202619922001200920172026
48 results for coil condition

Predicting MRI coil failures using image features and ensemble learning.

problem Ensuring trouble-free operation of MRI systems by predicting hardware failures.
method Two-level data analysis with neural networks and Random Forest ensemble learning.
result Improved prediction results with an F-score of 94.14% and an accuracy of 99.09%.

Predicting MRI coil failures using time series classification.

problem Early detection of MRI hardware failures to prevent downtime.
method Training a statistical model on sequential image data features over time.
result LSTMs achieved an F-score of 86.43% and 98.33% accuracy in predicting coil damage.

Study on helix curves and their Möbius energy asymptotics.

problem Understanding the asymptotic behavior of Möbius energy for helix curves.
method Investigation of helix curves with fixed radius, focusing on energy decay and blow-up.
result Proven asymptotics for both uncoiling and coiling helix curves, revealing distinct strategies for each.

The paper studies Möbius energy gradient of helix pairs and finds limiting behavior as coiling ratio increases.

problem Characterizing the limiting behavior of Möbius energy gradient for symmetric helix pairs.
method Complex asymptotics
result The gradient diverges in opposing directions based on radius, approaching 1/2 as coiling ratio increases.

Ensembled neural networks improve MRI image quality.

problem Accelerated parallel MR imaging with high SSIM scores.
method Ensembled ΣΣ-net combining parallel coil and sensitivity networks, trained with supervised and semi-supervised methods.
result Ensembling models achieves visually sharp and textured images with robust SSIM scores.

In recent years, several families of hyperbolic knots have been shown to have both volume and λ1λ_1 (first eigenvalue of the Laplacian) bounded in terms of the twist number of a diagram, while other families of knots have volume bounded by a generalized twist number. We show that for general knots, neither the twist nu…

2009-01-02abs ↗pdf ↗

Algorithms for Magnetic Resonance (MR) image reconstruction from undersampled measurements exploit prior information to compensate for missing k-space data. Deep learning (DL) provides a powerful framework for extracting such information from existing image datasets, through learning, and then using it for reconstructi…

2017-11-30abs ↗pdf ↗

We introduce a new unsupervised representation learning and visualization using deep convolutional networks and self organizing maps called Deep Neural Maps (DNM). DNM jointly learns an embedding of the input data and a mapping from the embedding space to a two-dimensional lattice. We compare visualizations of DNM with…

2018-10-16abs ↗pdf ↗

Nyquist ghost artifacts in EPI are originated from phase mismatch between the even and odd echoes. However, conventional correction methods using reference scans often produce erroneous results especially in high-field MRI due to the non-linear and time-varying local magnetic field changes. Recently, it was shown that …

2018-06-01abs ↗pdf ↗

This study uses CNN-IOs to estimate MRI image reconstruction performance bounds.

problem Estimating task-based performance limits for MRI image reconstruction methods.
method Utilized stylized multi-coil SENSE MRI systems and deep-generated stochastic models to estimate IO performance.
result Estimation of IO performance provides guidance for designing under-sampled MRI systems.

We propose a novel end-to-end neural network architecture that, once trained, directly outputs a probabilistic clustering of a batch of input examples in one pass. It estimates a distribution over the number of clusters kk, and for each 1kkmax1 \leq k \leq k_\mathrm{max}, a distribution over the individual cluster assignm…

2018-07-11abs ↗pdf ↗

Generative model learns object variability from MRI measurements.

problem Establishing stochastic object models from medical imaging data.
method Advanced AmbientGANs with multiresolution training.
result AmbientGANs reliably learn object distributions from incomplete or noisy data.

We present two graph-based algorithms for multiclass segmentation of high-dimensional data. The algorithms use a diffuse interface model based on the Ginzburg-Landau functional, related to total variation compressed sensing and image processing. A multiclass extension is introduced using the Gibbs simplex, with the fun…

2013-02-15abs ↗pdf ↗

Jointly correct bias fields and reconstruct undersampled MRI images.

problem Recovering fully sampled MRI images from undersampled data while accounting for bias field differences.
method An unsupervised learning-based reconstruction algorithm combined with a N4-based bias field estimation method in a joint optimization scheme.
result The proposed method improves reconstruction quality, both visually and in terms of RMSE.

New algorithms for clustering and dimension reduction using relative von Neumann entropy.

problem Clustering and dimension reduction for complex data sets.
method Construct graphs from data points, select graph maximizing relative von Neumann entropy, use eigenvectors for dimension reduction.
result Outperforms existing methods on non-trivial data sets.

MosaicMRI expands public datasets for musculoskeletal MRI, revealing cross-anatomical correlations.

problem Limited diversity in public MRI datasets hinders model evaluation across different anatomical settings.
method Developed a large, diverse dataset (MosaicMRI) and conducted experiments on a baseline model (VarNet).
result Models trained on combined anatomies outperform anatomy-specific models in low-sample regimes.

A new diffusion sampling method combines Krylov subspace and diffusion models for faster and more efficient inverse problems.

problem Efficiently solving large-scale inverse problems in high-performance computing.
method Proposes a novel diffusion sampling strategy that integrates Krylov subspace methods with diffusion models.
result Demonstrates significant speedup (80x faster inference time) and improved reconstruction quality on real-world medical imaging problems.

The paper develops a new approach to conditional risk measures using modular convex analysis.

problem Developing a new method for conditional risk measures.
method Random modular approach to conditional certainty equivalents and niveloids in the conditional LL^{\infty}-space.
result Retrieves a conditional variational formula for optimized certainty equivalents and applies it to the conditional entropic risk measure.

Paper constructs solutions to Bogomolny equations with specific boundary and asymptotic conditions.

problem Constructing solutions to Bogomolny equations with given boundary and asymptotic conditions.
method Using generalized Nahm pole boundary condition and real symmetry breaking condition.
result Solutions analogous to instanton solutions, satisfying different asymptotic conditions.

We extend probabilistic programming to handle conditioning on marginal distributions.

problem Conditioning probabilistic programs on marginal distributions of observable variables.
method We define and implement stochastic conditioning, allowing inference in probabilistic programs conditioned on marginal distributions.
result We demonstrate the effectiveness of stochastic conditioning in various real-life scenarios.

Paper finds necessary condition for logarithmic Minkowski problem in higher dimensions.

problem Logarithmic Minkowski problem in higher dimensions.
method Established a necessary condition through generalization and refinement of previous work.
result Generalizes and refines necessary condition for logarithmic Minkowski problem.

This paper introduces a neural operator for probabilistic conditioning.

problem Probabilistic conditioning of random variables XX given YY.
method Develops a single operator that maps any joint density to its conditional, approximated by neural operators.
result Neural operators can approximate the conditioning operator to arbitrary accuracy.

CSI method learns conditional distributions by estimating flow equations.

problem Learning conditional distributions in generative models.
method Estimates probability flow equations to transport reference to target distribution.
result Derives explicit expressions for conditional drift and score functions.

New conditional risk measures called conditional generalized quantiles defined and characterized.

problem Developing new risk measures for dynamic risk assessment.
method Propose and characterize conditional generalized quantiles using expected utility model and equivalent conditions.
result Characterized conditional generalized quantiles as well-defined and equivalent to a conditional first order condition.

A new method for learning conditional distributions using ODEs and neural networks.

problem Learning conditional distributions efficiently and accurately.
method Conditional Föllmer Flow, discretized with Euler's method, using nonparametric velocity estimation.
result Effective approximation of target conditional distributions, with convergence results for Wasserstein-2 distance.