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

Trend · papers per month

65131196261 · May 202619922001200920172026
48 results for k-space consistency

The annihilating filter-based low-rank Hankel matrix approach (ALOHA) is one of the state-of-the-art compressed sensing approaches that directly interpolates the missing k-space data using low-rank Hankel matrix completion. The success of ALOHA is due to the concise signal representation in the k-space domain thanks to…

2018-05-10abs ↗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 ↗

Study benchmarks methods for learning non-Cartesian k-space trajectories and reconstruction.

problem Benchmarking methods for learning non-Cartesian k-space trajectories and reconstruction.
method Comparing PILOT, BJORK, and HybLearn schemes to learn non-Cartesian k-space trajectories and reconstruction.
result HybLearn scheme outperforms other methods in learning and comparing non-Cartesian k-space trajectories and reconstruction.

Quantifies Schur's theorem for curves in CAT(k) spaces.

problem Quantifying Schur's comparison theorem for curves in CAT(k) spaces.
method Comparison formula for curves in model planes, curvature measures, moment arm, and Reshetnyak's theorem.
result Sharpens and extends classical arm and bow lemmas and Riemannian analogues.

This paper presents a deep learning method for faster magnetic resonance imaging (MRI) by reducing k-space data with sub-Nyquist sampling strategies and provides a rationale for why the proposed approach works well. Uniform subsampling is used in the time-consuming phase-encoding direction to capture high-resolution im…

2017-09-08abs ↗pdf ↗

DeepcomplexMRI uses deep residual networks for faster MRI imaging.

problem Accelerating parallel MR imaging with high accuracy.
method Deep complex convolutional neural network with residual connections and k-space consistency.
result The method can accurately reconstruct multi-channel MRI images.

Deep learning improves MRI image quality from down-sampled data.

problem Improving MRI image quality from accelerated, down-sampled k-space data.
method Deep Residual Dense U-Net architecture with Residual Dense Block and new loss function.
result The proposed method achieves better performance in reconstructing high-quality images from down-sampled k-space data.

Paper studies weighted Fermat-Frechet problem for simplex edge lengths.

problem Finding optimal edge lengths for simplex deformations.
method Isometric embedding techniques for KK-Space.
result New variational method to solve weighted Fermat-Frechet problem.

In the present paper we study geodesic mappings of special pseudo-Riemannian manifolds called Vn(K)V_n(K)-spaces. We prove that the set of solutions of the system of equations of geodesic mappings on Vn(K)V_n(K)-spaces (K0)(K\neq0) forms a special Jordan algebra and the set of solutions generated by consircular fields is an id…

2019-05-07abs ↗pdf ↗

The paper proves inequalities linking Wasserstein distances and eigenfunctions in RCD(K,∞) spaces.

problem Estimating Wasserstein distances and their bounds in RCD(K,∞) spaces.
method Similar techniques used to prove inequalities involving pp-Wasserstein distances and Laplace eigenfunctions.
result Proves a conjectured lower bound on pp-Wasserstein distance between positive and negative parts of Laplace eigenfunctions.

It is well known that the space of oriented lines of Euclidean space has a natural symplectic structure. Moreover, given an immersed, oriented hypersurface S the set of oriented lines that cross S orthogonally is a Lagrangian submanifold. Conversely, if \bar{S} an n-dimensional family of oriented lines is Lagrangian, t…

2015-07-14abs ↗pdf ↗

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.

AFP-CKSAAP predicts antifreeze proteins using k-spaced amino acid pairs with deep neural networks.

problem Predicting antifreeze proteins due to their diverse sequence characteristics.
method Deep neural network with skipped connections and ReLU non-linearity to learn protein sequence descriptors.
result AFP-CKSAAP achieves excellent prediction scores and high Youden's index (0.82) on independent dataset.

The paper shows neural networks can approximate functions over non-compact domains with non-polynomial activation.

problem Approximating functions over non-compact domains using neural networks.
method Using single-hidden-layer feedforward neural networks with non-polynomial activation functions over non-compact subsets of Euclidean spaces.
result Neural networks can approximate functions in weighted CkC^k-spaces and weighted Sobolev spaces over unbounded domains.

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 this paper, we show a local energy convexity of W1,2W^{1,2} maps into CAT(K)CAT(K) spaces. This energy convexity allows us to extend Colding and Minicozzi's width-sweepout construction to produce closed geodesics in any closed Alexandrov space of curvature bounded from above, which also provides a generalized version of t…

2009-09-28abs ↗pdf ↗

This article is a survey article on geometric group theory from the point of view of a non-expert who likes geometric group theory and uses it in his own research. The sections are: classical examples, basics about quasiisometry,properties and invariants of groups invariant under quasiisometry, rigidity, hyperbolic spa…

2008-06-23abs ↗pdf ↗

Let MkM_k be the complete, simply connected, Riemannian 2-manifold of constant curvature k0k \le 0. Let EE be a closed, simply connected subspace of MkM_k with the property that every two points in EE is connected by a rectifiable path in EE. We show that under the induced path metric, EE is a complete CAT(kk) spa…

2010-01-14abs ↗pdf ↗

New method corrects motion artifacts in MR images without paired data.

problem Lack of paired data for supervised training in deep learning for MR motion correction.
method Outlier-rejecting bootstrap subsampling and aggregation, using optimal transport cycleGAN.
result Outperforms existing deep learning methods in correcting motion artifacts from TSM.

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 an analogue of the theory of length spaces into the setting of Lorentzian geometry and causality theory. The rôle of the metric is taken over by the time separation function, in terms of which all basic notions are formulated. In this way we recover many fundamental results in greater generality, while at …

2017-11-24abs ↗pdf ↗

It is well known that in compact local Lipschitz neighborhood retracts in Euclidean space flat convergence for integer rectifiable currents amounts just to weak convergence. In the present paper we extend this result to integral currents in complete metric spaces admitting a local cone type inequality. These include in…

2005-08-03abs ↗pdf ↗

We show that if G is a discrete subgroup of the group of the isometries of the hyperbolic k-space H^k, and if R is a representation of G into the group of the isometries of H^n, then any R-equivariant map F from H^k to H^n extends to the boundary in a weak sense in the setting of Borel measures. As a consequence of thi…

2004-05-03abs ↗pdf ↗

Critical nets in k-space have bounded edge lengths and vertices.

problem Understanding the structure and constraints of critical nets in k-dimensional space.
method Analyzing the properties of critical nets under fixed leaf positions and constraints.
result The total length of edges not incident with 1-valent vertices is bounded, and the degree and number of vertices are also bounded.

Study proposes a new method for MRI image reconstruction using denoising autoencoders and undecimated wavelet transforms.

problem Efficient MRI image reconstruction using under-sampled data.
method Undecimated wavelet transform, denoising autoencoder, proximal gradient algorithm.
result The proposed method enhances MRI image reconstruction efficiency and robustness.

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.

Acquisition of Magnetic Resonance Imaging (MRI) scans can be accelerated by under-sampling in k-space (i.e., the Fourier domain). In this paper, we consider the problem of optimizing the sub-sampling pattern in a data-driven fashion. Since the reconstruction model's performance depends on the sub-sampling pattern, we c…

2019-01-07abs ↗pdf ↗

Enhances deep neural networks for MRI reconstruction by increasing expressivity.

problem Balancing network complexity and performance in deep learning MRI reconstruction.
method Geometric approach using bootstrapping and subnetwork aggregation with attention module.
result Significant improvement in MRI reconstruction performance with minimal complexity increase.

A n n-body system is a labelled collection of n point masses in Euclidean space, and their congruence and internal symmetry properties involve a rich mathematical structure which is investigated in the framework of equivariant Riemannian geometry. Some basic concepts are n-configuration, configuration space, internal s…

2006-09-05abs ↗pdf ↗