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

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for image compressive sensing

CSDM integrates compressed sensing into diffusion models for faster data generation.

problem Efficiently generating synthetic data in high-dimensional spaces.
method Integrating compressed sensing into diffusion models (CSDM) to reduce dimensionality and accelerate inference.
result Achieves provably faster convergence and better latent space dimension selection.

Untrained neural networks can recover natural images from few measurements.

problem Recovering natural images from a small number of measurements.
method Gradient descent on un-trained convolutional neural networks.
result Untrained neural networks can approximate reconstruct signals/images from a near minimal number of random measurements.

A new compressed sensing system speeds up PSTE detection.

problem Accurately detecting fast, small optical events (PSTEs) is challenging.
method Developed a novel compressed sensing algorithm for rolling shutter systems.
result Accurately recovered PSTEs with spatial undersampling, showing speed and quality advantages.

Paper offers robust recovery for 1-bit sensing with partial Gaussian circulant matrices.

problem Accurately recovering vectors from 1-bit measurements using structured matrices.
method Correlation-based optimization with randomly signed partial Gaussian circulant matrices and generative models.
result Recovery guarantees match those for i.i.d. Gaussian matrices but with faster computation.

Optimized sampling scheme for compressed sensing combining randomness and determinism.

problem Improving compressed sensing performance with deterministic sampling.
method Optimized sampling scheme combining random and deterministic selection of rows.
result Measurable improvements in image compressed sensing for generative and sparse priors.

Develops a multichannel deep network for faster, artifact-free image CS.

problem Block-wise sampling artifacts in image CS with multiple sampling rates.
method Multichannel deep network for block-based image CS, removing blocking artifacts.
result Significantly outperforms state-of-the-art CS methods in objective and subjective metrics.

We solve the compressive sensing problem via convolutional factor analysis, where the convolutional dictionaries are learned {\em in situ} from the compressed measurements. An alternating direction method of multipliers (ADMM) paradigm for compressive sensing inversion based on convolutional factor analysis is develope…

2017-01-11abs ↗pdf ↗

We develop a new compressive sensing (CS) inversion algorithm by utilizing the Gaussian mixture model (GMM). While the compressive sensing is performed globally on the entire image as implemented in our lensless camera, a low-rank GMM is imposed on the local image patches. This low-rank GMM is derived via eigenvalue th…

2015-08-27abs ↗pdf ↗

Compressive Sensing (CS) theory asserts that sparse signal reconstruction is possible from a small number of linear measurements. Although CS enables low-cost linear sampling, it requires non-linear and costly reconstruction. Recent literature works show that compressive image classification is possible in CS domain wi…

2018-10-15abs ↗pdf ↗

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.

Compressed sensing (CS) provides an elegant framework for recovering sparse signals from compressed measurements. For example, CS can exploit the structure of natural images and recover an image from only a few random measurements. CS is flexible and data efficient, but its application has been restricted by the strong…

2019-05-16abs ↗pdf ↗

This paper introduces a novel generative encoder (GE) model for generative imaging and image processing with applications in compressed sensing and imaging, image compression, denoising, inpainting, deblurring, and super-resolution. The GE model consists of a pre-training phase and a solving phase. In the pre-training …

2019-05-23abs ↗pdf ↗

We propose a novel method for compressed sensing recovery using untrained deep generative models. Our method is based on the recently proposed Deep Image Prior (DIP), wherein the convolutional weights of the network are optimized to match the observed measurements. We show that this approach can be applied to solve any…

2018-06-17abs ↗pdf ↗

New result on tensor recovery without strong assumptions.

problem Recoverability of randomly compressed tensors with low CP rank.
method Deriving restricted isometry property (R.I.P.) via set covering techniques.
result The tensor is recoverable if the number of measurements is proportional to the model parameters.

This paper proposes a simple adaptive sensing and group testing algorithm for sparse signal recovery. The algorithm, termed Compressive Adaptive Sense and Search (CASS), is shown to be near-optimal in that it succeeds at the lowest possible signal-to-noise-ratio (SNR) levels, improving on previous work in adaptive comp…

2013-06-26abs ↗pdf ↗

Improved image recovery with minimal data using untrained neural networks.

problem Solving inverse problems with limited data.
method Pre-training neural networks with a small number of examples to improve performance.
result Performance increases as data increases, matching generative models with less than 1% of training data.

In compressed sensing, we wish to reconstruct a sparse signal xx from observed data yy. In sparse coding, on the other hand, we wish to find a representation of an observed signal yy as a sparse linear combination, with coefficients xx, of elements from an overcomplete dictionary. While many algorithms are competit…

2013-10-31abs ↗pdf ↗

Paper tackles image reconstruction from limited data using polyhedral norms and convex regularizers.

problem Learning convex regularizers for image reconstruction from limited data.
method Imposes amplitude-equivariance, approximates functionals with polyhedral norms, identifies synthesis and analysis forms, proposes a trainable tight frame architecture.
result Proposed framework outperforms sparsity-based methods in denoising and biomedical image reconstruction.

Parametric images provide insight into the spatial distribution of physiological parameters, but they are often extremely noisy, due to low SNR of tomographic data. Direct estimation from projections allows accurate noise modeling, improving the results of post-reconstruction fitting. We propose a method, which we name…

2018-03-27abs ↗pdf ↗

Study 1-bit compressive sensing with generative models, improving recovery accuracy.

problem Accurately recover sparse vectors from binary measurements with generative models.
method Analyzes noiseless and noisy 1-bit measurements with i.i.d.~Gaussian and Lipschitz continuous generative priors, proving sample complexity bounds and stability properties.
result Proves sample complexity bounds and stability properties for 1-bit compressive sensing with generative models.

The problem of high-dimensional and large-scale representation of visual data is addressed from an unsupervised learning perspective. The emphasis is put on discrete representations, where the description length can be measured in bits and hence the model capacity can be controlled. The algorithmic infrastructure is de…

2019-01-24abs ↗pdf ↗