Fast Compressive Sensing Recovery Using Generative Models with Structured Latent Variables
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 method stable when the number of compressed measurements is extremely limited. We show that, by exploiting certain structures of the latent variables, the proposed method produces improved reconstruction accuracy and preserves realistic and non-smooth features in the image. Our algorithm achieves high computation speed by projecting between the original signal space and the latent variable space in an alternating fashion.
Code (1)
Tasks
Compressive SensingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priors
In 1-bit compressive sensing, each measurement is quantized to a single bit, namely the sign of a linear function of an unknown vector, and the goal is to accurately recover the vector. While it is most popular to assume…
Compressive SensingGenerative Patch Priors for Practical Compressive Image Recovery
In this paper, we propose the generative patch prior (GPP) that defines a generative prior for compressive image recovery, based on patch-manifold models. Unlike learned, image-level priors that are restricted to the ran…
Compressive SensingImage ReconstructionRetrievalA Fast Noniterative Algorithm for Compressive Sensing Using Binary Measurement Matrices
In this paper we present a new algorithm for compressive sensing that makes use of binary measurement matrices and achieves exact recovery of ultra sparse vectors, in a single pass and without any iterations. Due to its …
AllCompressive SensingCompressive Sensing with Tensorized Autoencoder
Deep networks can be trained to map images into a low-dimensional latent space. In many cases, different images in a collection are articulated versions of one another; for example, same object with different lighting, b…
Compressive SensingDenoisingSample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors
The goal of standard 1-bit compressive sensing is to accurately recover an unknown sparse vector from binary-valued measurements, each indicating the sign of a linear function of the vector. Motivated by recent advances …
Compressive Sensing