DeepAI AI Chat
Log In Sign Up

QCM-SGM+: Improved Quantized Compressed Sensing With Score-Based Generative Models for General Sensing Matrices

by   Xiangming Meng, et al.

In realistic compressed sensing (CS) scenarios, the obtained measurements usually have to be quantized to a finite number of bits before transmission and/or storage, thus posing a challenge in recovery, especially for extremely coarse quantization such as 1-bit sign measurements. Recently Meng Kabashima proposed an efficient quantized compressed sensing algorithm called QCS-SGM using the score-based generative models as an implicit prior. Thanks to the power of score-based generative models in capturing the rich structure of the prior, QCS-SGM achieves remarkably better performances than previous quantized CS methods. However, QCS-SGM is restricted to (approximately) row-orthogonal sensing matrices since otherwise the likelihood score becomes intractable. To address this challenging problem, in this paper we propose an improved version of QCS-SGM, which we call QCS-SGM+, which also works well for general matrices. The key idea is a Bayesian inference perspective of the likelihood score computation, whereby an expectation propagation algorithm is proposed to approximately compute the likelihood score. Experiments on a variety of baseline datasets demonstrate that the proposed QCS-SGM+ outperforms QCS-SGM by a large margin when sensing matrices are far from row-orthogonal.


Quantized Compressed Sensing with Score-Based Generative Models

We consider the general problem of recovering a high-dimensional signal ...

On one-stage recovery for ΣΔ-quantized compressed sensing

Compressed sensing (CS) is a signal acquisition paradigm to simultaneous...

Compressed Sensing with Deep Image Prior and Learned Regularization

We propose a novel method for compressed sensing recovery using untraine...

Compressed sensing reconstruction using Expectation Propagation

Many interesting problems in fields ranging from telecommunications to c...

Compressed Sensing via Measurement-Conditional Generative Models

A pre-trained generator has been frequently adopted in compressed sensin...

New Algorithms and Improved Guarantees for One-Bit Compressed Sensing on Manifolds

We study the problem of approximately recovering signals on a manifold f...

Compressed Neighbour Discovery using Sparse Kerdock Matrices

We study the network-wide neighbour discovery problem in wireless networ...