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

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for Iterative Reconstruction

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.

Novel tensor perturbation bounds for orthogonal iteration methods.

problem Developing robust bounds for tensor reconstruction and subspace estimation.
method Blockwise tensor perturbation bounds for high-order orthogonal iteration (HOOI).
result Upper bounds for singular subspace estimation converge linearly and tensor reconstruction error bound is characterized by a simple quantity.

Improved neural network reconstruction from sparse measurements with theoretical guarantees.

problem Improving neural network performance in sparse signal reconstruction from few measurements.
method Combining iterative reconstruction algorithms with neural networks, analyzing generalization properties, and deriving a generalization bound.
result Theoretical guarantees for neural network reconstruction from compressive linear measurements, with generalization error scaling logarithmically in the number of layers and linearly in the number of measurements.

Neurally Augmented ALISTA improves sparse reconstruction performance.

problem Improving sparse reconstruction performance with theoretical guarantees and empirical improvements.
method Integrates an LSTM network to compute adaptive step sizes and thresholds for each target vector during reconstruction.
result Empirical performance is further improved, especially as compression ratios become more challenging.

An axiomatic approach to signal reconstruction is formulated, involving a sample consistent set and a guiding set, describing desired reconstructions. New frame-less reconstruction methods are proposed, based on a novel concept of a reconstruction set, defined as a shortest pathway between the sample consistent set and…

2017-02-02abs ↗pdf ↗

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…

2019-08-07abs ↗pdf ↗

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…

2017-06-23abs ↗pdf ↗

A denoising algorithm seeks to remove noise, errors, or perturbations from a signal. Extensive research has been devoted to this arena over the last several decades, and as a result, today's denoisers can effectively remove large amounts of additive white Gaussian noise. A compressed sensing (CS) reconstruction algorit…

2014-06-16abs ↗pdf ↗

The last decade has shown a tremendous success in solving various computer vision problems with the help of deep learning techniques. Lately, many works have demonstrated that learning-based approaches with suitable network architectures even exhibit superior performance for the solution of (ill-posed) image reconstruc…

2019-04-05abs ↗pdf ↗

A very simple heuristic approach to the unfolding problem will be described. An iterative algorithm starts with an empty histogram and every iteration aims to add one entry to this histogram. The entry to be added is selected according to a criteria which includes a χ2χ^2 test and a regularization. After a relatively s…

2014-10-17abs ↗pdf ↗

Iterative thresholding algorithms are well-suited for high-dimensional problems in sparse recovery and compressive sensing. The performance of this class of algorithms depends heavily on the tuning of certain threshold parameters. In particular, both the final reconstruction error and the convergence rate of the algori…

2013-10-31abs ↗pdf ↗

This paper presents a novel Block Iterative Bayesian Algorithm (Block-IBA) for reconstructing block-sparse signals with unknown block structures. Unlike the existing algorithms for block sparse signal recovery which assume the cluster structure of the nonzero elements of the unknown signal to be independent and identic…

2014-12-07abs ↗pdf ↗

This article deals with stability issues related to geodesic X-ray transforms, where an interplay between the (attenuation type) weight in the transform and the underlying geometry strongly impact whether the problem is stable or unstable. In the unstable case, we also explain what types of artifacts are expected in te…

2017-08-29abs ↗pdf ↗

Gradient descent with small random init mimics spectral methods for low-rank matrix recovery.

problem Reconstructing a low-rank matrix from few measurements.
method Gradient descent with small random initialization followed by a few iterations.
result Gradient descent from small random init converges to a well-generalizing solution.

This work tackles uncertainty quantification in tomography reconstruction.

problem Ill-posed nature of tomographic reconstruction leading to no unique solution.
method Gaussian process modeling to incorporate prior knowledge and experimental noises.
result Efficient uncertainty quantification in tomographic reconstruction.

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 nn points in dd dimensions requires linear solves and log determinants with an ${n(d+1) \times n(d…

2018-10-29abs ↗pdf ↗

Deep network improves electrical tomography across multiple frequencies.

problem Nonlinear multi-frequency electrical impedance tomography (mfEIT) for tissue conductivity estimation.
method Integrates graph neural networks (GNNs) into the iterative Proximal Regularized Gauss Newton (PRGN) framework to reconstruct tissue concentrations accurately.
result Accurate reconstruction of overlapping tissue fraction concentrations across multiple frequencies.

EggNet reconstructs particle tracks from hits using evolving graph attention networks.

problem Particle track reconstruction is computationally expensive and combinatorial.
method EggNet uses a one-shot object condensation approach with evolving graph attention networks.
result EggNet outperforms methods requiring fixed input graphs on TrackML dataset.

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…

2018-12-18abs ↗pdf ↗

Study geodesic X-ray transforms on hyperbolic surfaces, proposing new reconstruction methods.

problem Inverting geodesic X-ray transforms for symmetric tensor fields on asymptotically hyperbolic surfaces.
method Developed a decomposition theorem for m-tensor fields, used Guillemin-Kazhdan operators and 0-calculus, and provided explicit reconstruction methods.
result Explicit reconstruction methods for even tensor fields from their X-ray transform or normal operator.

Paper uses ResUNet-CMB to reconstruct cosmic polarization rotation from CMB data.

problem Reconstructing anisotropic cosmic polarization rotation from CMB data.
method Extended ResUNet-CMB to handle gravitational lensing and patchy reionization.
result ResUNet-CMB outperforms standard quadratic estimator in reconstructing all three effects.

A new CNN-based algorithm improves Fourier ptychography for faster, more robust image reconstruction.

problem Slow and inefficient Fourier ptychography reconstruction under system aberrations.
method A CNN-based iterative phase retrieval algorithm trained on GPUs.
result Significantly faster and more robust image reconstruction under system aberrations.

A new method learns high-frequency components for better image reconstruction.

problem Efficiently reconstructing feature details in under-sampled imaging.
method Proposes HF-DAEP, a denoising autoencoder using multi-profile high-frequency components.
result Demonstrates improved reconstruction of feature details in MRI and CT.