Image reconstruction from undersampled k-space data has been playing an important role for fast MRI. Recently, deep learning has demonstrated tremendous success in various fields and also shown potential to significantly speed up MR reconstruction with reduced measurements. This article gives an overview of deep learni…
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 “fast reconstruction”
This paper presents a novel method for the reconstruction of a neural network connectivity using calcium fluorescence data. We introduce a fast unsupervised method to integrate different networks that reconstructs structural connectivity from neuron activity. Our method improves the state-of-the-art reconstruction meth…
The augmented Lagrangian (AL) method that solves convex optimization problems with linear constraints has drawn more attention recently in imaging applications due to its decomposable structure for composite cost functions and empirical fast convergence rate under weak conditions. However, for problems such as X-ray co…
In this work we address the problem of real-time dynamic medical MRI and X Ray CT image reconstruction from parsimonious samples Fourier frequency space for MRI and sinogram tomographic projections for CT. Today the de facto standard for such reconstruction is compressed sensing. CS produces high quality images (with m…
New neural network improves MRI reconstruction for non-Cartesian data.
problem Improving MRI reconstruction for non-Cartesian data acquisitions.
method Density-compensated unrolled neural networks.
result Density-compensated unrolled neural networks outperform baselines.
Stochastic image reconstruction is a key part of modern digital rock physics and materials analysis that aims to create numerous representative samples of material micro-structures for upscaling, numerical computation of effective properties and uncertainty quantification. We present a method of three-dimensional stoch…
A new algorithm speeds up EEG source localization using regularization.
problem Challenging inverse problem in mapping EEG readings to brain activity.
method Formulated as a graphical generalized elastic net inverse problem, solved with a variable projected algorithm (VPAL).
result VPAL provides faster and more accurate EEG source localization compared to existing methods.
A fast method approximates likelihood scores for noisy linear inverse problems.
problem Solving noisy linear inverse problems efficiently.
method Proposes a simple closed-form approximation to the likelihood score for diffusion and flow-based models.
result Significantly faster than baseline methods while maintaining competitive or better reconstruction performances.
Generative adversarial networks reconstruct MRI images without full data.
problem Lack of fully-sampled ground truth data for supervised MRI reconstruction.
method Generative adversarial networks for unsupervised MRI reconstruction.
result Reconstructed images show more anatomical structure than conventional methods.
Statistical image reconstruction (SIR) methods are studied extensively for X-ray computed tomography (CT) due to the potential of acquiring CT scans with reduced X-ray dose while maintaining image quality. However, the longer reconstruction time of SIR methods hinders their use in X-ray CT in practice. To accelerate st…
A1GM method improves efficiency in reconstructing missing data using KL divergence.
problem Efficiently reconstructing missing data in matrices.
method Fast non-gradient-based rank-1 NMF using KL divergence.
result A1GM outperforms gradient methods in efficiency with competitive reconstruction errors.
Solving Inverse Problems with Conditional-GAN Prior via Fast Network-Projected Gradient Descentcs.LG
Faster reconstruction of compressed signals using conditional GAN and NPGD.
problem Recovering compressed signals from measurements.
method Network-based projected gradient descent (NPGD) combined with measurement-conditional generative adversarial networks (GANs/BEGANs).
result Significant speed-up in reconstruction (up to 140-175 times faster).
Gaussian processes (GPs) with derivatives are useful in many applications, including Bayesian optimization, implicit surface reconstruction, and terrain reconstruction. Fitting a GP to function values and derivatives at points in dimensions requires linear solves and log determinants with an ${n(d+1) \times n(d…
We adopt data structure in the form of cover trees and iteratively apply approximate nearest neighbour (ANN) searches for fast compressed sensing reconstruction of signals living on discrete smooth manifolds. Levering on the recent stability results for the inexact Iterative Projected Gradient (IPG) algorithm and by us…
Improved particle-flow event reconstruction with scalable neural networks for current and future particle detectorsphysics.data-an
Improved particle-flow event reconstruction for future colliders using scalable neural networks.
problem Efficient and accurate particle reconstruction in future particle detectors.
method Comparative study of scalable machine learning models (graph neural network and kernel-based transformer) for event reconstruction.
result Graph neural network model improves jet transverse momentum resolution by up to 50%.
We propose a general framework for reconstructing and denoising single entries of incomplete and noisy entries. We describe: effective algorithms for deciding if and entry can be reconstructed and, if so, for reconstructing and denoising it; and a priori bounds on the error of each entry, individually. In the noiseless…
We present a Bayesian method for feature selection in the presence of grouping information with sparsity on the between- and within group level. Instead of using a stochastic algorithm for parameter inference, we employ expectation propagation, which is a deterministic and fast algorithm. Available methods for feature …
This paper deals with two related problems, namely distance-preserving binary embeddings and quantization for compressed sensing . First, we propose fast methods to replace points from a subset , associated with the Euclidean metric, with points in the cube and we associa…
Fast and accurate MRI image reconstruction from undersampled data is crucial in clinical practice. Deep learning based reconstruction methods have shown promising advances in recent years. However, recovering fine details from undersampled data is still challenging. In this paper, we introduce a novel deep learning bas…
Noise2Filter: fast, self-supervised learning and real-time reconstruction for 3D Computed Tomographyeess.IV
Noise2Filter improves 3D tomography reconstruction efficiency and accuracy.
problem Efficiently reconstructing 3D tomographic images in real-time with limited data.
method Self-supervised learning and a learned filter method.
result Noise2Filter achieves real-time reconstruction with limited loss of accuracy.
Compressive sensing is an impressive approach for fast MRI. It aims at reconstructing MR image using only a few under-sampled data in k-space, enhancing the efficiency of the data acquisition. In this study, we propose to learn priors based on undecimated wavelet transform and an iterative image reconstruction algorith…
Obtaining accurate and reliable images from low-dose computed tomography (CT) is challenging. Regression convolutional neural network (CNN) models that are learned from training data are increasingly gaining attention in low-dose CT reconstruction. This paper modifies the architecture of an iterative regression CNN, BC…
Magnetic resonance imaging (MRI) is known to be a slow imaging modality and undersampling in k-space has been used to increase the imaging speed. However, image reconstruction from undersampled k-space data is an ill-posed inverse problem. Iterative algorithms based on compressed sensing have been used to address the i…
A Hybrid Frequency-domain/Image-domain Deep Network for Magnetic Resonance Image Reconstructioneess.IV
Decreasing magnetic resonance (MR) image acquisition times can potentially reduce procedural cost and make MR examinations more accessible. Compressed sensing (CS)-based image reconstruction methods, for example, decrease MR acquisition time by reconstructing high-quality images from data that were originally sampled a…
Auto-encoding is an important task which is typically realized by deep neural networks (DNNs) such as convolutional neural networks (CNN). In this paper, we propose EncoderForest (abbrv. eForest), the first tree ensemble based auto-encoder. We present a procedure for enabling forests to do backward reconstruction by ut…
Neural net modeling of equilibria in NSTX-Uphysics.plasm-ph
Neural nets improve plasma equilibrium modeling for NSTX-U.
problem Modeling plasma equilibrium and shape control for NSTX-U.
method Developed two neural networks: Eqnet and Pertnet.
result NNs offer faster and more flexible prediction of plasma scenarios.
Cake wavelets minimize orientation score uncertainty.
problem Minimizing uncertainty in orientation scores.
method Axiomatically derived wavelets for orientation score lifting.
result Uncertainty gap of cake wavelets is less than 1.1.
Probabilistic Autoencoder learns latent space weights' distribution.
problem Nonlinear model reconstruction error and sample quality.
method Normalizing flow for latent space weights' probability distribution.
result PAE achieves small reconstruction errors, high sample quality, and good performance.
CycleQSM uses deep learning to accurately map tissue magnetic susceptibility without needing paired data.
problem Accurately mapping magnetic susceptibility values from phase images using QSM.
method Unsupervised deep learning approach using physics-informed cycleGAN.
result The method provides more accurate QSM maps compared to existing deep learning approaches.
In this work we investigate approaches to reconstruct generator models from measurements available at the generator terminal bus using machine learning (ML) techniques. The goal is to develop an emulator which is trained online and is capable of fast predictive computations. The training is illustrated on synthetic dat…
EnVAE uses energy score for likelihood-free VAEs, improving image reconstructions.
problem Likelihood misspecification in VAEs leads to blurry reconstructions and poor data fidelity.
method Deterministic decoder, energy score as reconstruction loss, fast variant for efficiency.
result EnVAE achieves superior reconstruction and generation quality compared to likelihood-based baselines.
Fast reconstruction of degenerate populations of conductance-based neuron models from spike timesq-bio.NC
Method reconstructs neuron models from spike times efficiently.
problem Reconstructing neuron models from spike times in degenerate populations.
method Combining deep learning with DICs to map spike times to DIC densities and generate degenerate CBM populations.
result Fast and scalable reconstruction of degenerate populations from spike recordings.
Metalearning optimizes autoencoder dimensions for efficient data representation.
problem Selecting optimal dimension for autoencoder output to balance accuracy and complexity.
method Metalearning approach using actor-critic algorithm to dynamically adjust dimension.
result Automatic selection of minimum number of bases for optimal reconstruction.
Recent advances in Bayesian optimization with applications to parameter reconstruction in optical nano-metrologyphysics.comp-ph
Bayesian optimization speeds up parameter reconstruction in optical nano-metrology.
problem Efficiently reconstructing parameters from time-consuming measurements in optical nano-metrology.
method Combines Bayesian optimization and curve fitting for faster, more efficient model fitting.
result The presented Bayesian Target Vector Optimization scheme achieves similar reconstruction performance with fewer model function calls.
Deep learning models have significantly improved the visual quality and accuracy on compressive sensing recovery. In this paper, we propose an algorithm for signal reconstruction from compressed measurements with image priors captured by a generative model. We search and constrain on latent variable space to make the m…
We propose denoising dictionary learning (DDL), a simple yet effective technique as a protection measure against adversarial perturbations. We examined denoising dictionary learning on MNIST and CIFAR10 perturbed under two different perturbation techniques, fast gradient sign (FGSM) and jacobian saliency maps (JSMA). W…
New quantum state reconstruction method accelerates convergence.
problem Quantum state reconstruction for larger systems.
method Momentum-Inspired Factored Gradient Descent (MiFGD) combining compressed sensing, non-convex optimization, and acceleration.
result Converges to true density matrix at an accelerated linear rate, provably close to the true matrix.
In this paper, we study the properties of the Frank-Wolfe algorithm to solve the \ExactSparse reconstruction problem. We prove that when the dictionary is quasi-incoherent, at each iteration, the Frank-Wolfe algorithm picks up an atom indexed by the support. We also prove that when the dictionary is quasi-incoherent, t…
Reconstructing transcriptional regulatory networks is an important task in functional genomics. Data obtained from experiments that perturb genes by knockouts or RNA interference contain useful information for addressing this reconstruction problem. However, such data can be limited in size and/or are expensive to acqu…
Aims to create a world model without baggage, achieving good performance.
problem Creating world models without baggage and limitations.
method Self-supervised representation learning, frame and action stacking, data augmentation.
result Good performance on the Atari 100k benchmark.
A fast method for Lasso and Logistic Lasso problems.
problem Solving Lasso and Logistic Lasso regression problems efficiently.
method Iterative active set approach using solver updates.
result 31.41 times faster on average for compressed sensing.
Dynamical Stationarity as a Result of Sustained Random Growthcond-mat.stat-mech
In sustained growth with random dynamics stationary distributions can exist without detailed balance. This suggests thermodynamical behavior in fast growing complex systems. In order to model such phenomena we apply both a discrete and a continuous master equation. The derivation of elementary rates from known stationa…
We found hidden convexity in FPCA and developed a faster algorithm.
problem Bias in PCA leading to unequal subgroup outcomes.
method Convex optimization via eigenvalue optimization.
result Faster and fairer PCA algorithm.
The field of medical image reconstruction has seen roughly four types of methods. The first type tended to be analytical methods, such as filtered back-projection (FBP) for X-ray computed tomography (CT) and the inverse Fourier transform for magnetic resonance imaging (MRI), based on simple mathematical models for the …
Dictionary learning is the task of determining a data-dependent transform that yields a sparse representation of some observed data. The dictionary learning problem is non-convex, and usually solved via computationally complex iterative algorithms. Furthermore, the resulting transforms obtained generally lack structure…
Bayesian model reconstructs time and frequency data robustly.
problem Missing observations and noise in time/frequency data.
method Probabilistic model, Bayesian update, joint reconstruction.
result Effective joint time/frequency reconstruction with missing data.
We present a generative autoencoder that provides fast encoding, faithful reconstructions (eg. retaining the identity of a face), sharp generated/reconstructed samples in high resolutions, and a well-structured latent space that supports semantic manipulation of the inputs. There are no current autoencoder or GAN model…
This paper improves signal reconstruction using determinantal sampling from random nodes.
problem Approximating square-integrable functions from random node evaluations.
method Combines determinantal point processes and mixtures thereof for RKHS-adapted approximations.
result Proves mean-square guarantees in norm and shows faster convergence rates.