1-Bit Compressive Sensing via Approximate Message Passing with Built-in Parameter Estimation

arXiv2007.07679MaRDI QIDQ6345152

Author name not available (Why is that?)

Publication date: 15 July 2020

Abstract: 1-bit compressive sensing aims to recover sparse signals from quantized 1-bit measurements. Designing efficient approaches that could handle noisy 1-bit measurements is important in a variety of applications. In this paper we use the approximate message passing (AMP) to achieve this goal due to its high computational efficiency and state-of-the-art performance. In AMP the signal of interest is assumed to follow some prior distribution, and its posterior distribution can be computed and used to recover the signal. In practice, the parameters of the prior distributions are often unknown and need to be estimated. Previous works tried to find the parameters that maximize either the measurement likelihood via expectation maximization, which becomes increasingly difficult to solve in cases of complicated probability models. Here we propose to treat the parameters as unknown variables and compute their posteriors via AMP as well, so that the parameters and the signal can be recovered jointly. Compared to previous methods, the proposed approach leads to a simple and elegant parameter estimation scheme, allowing us to directly work with 1-bit quantization noise model. Experimental results show that the proposed approach generally perform much better than the other state-of-the-art methods in the zero-noise and moderate-noise regimes, and outperforms them in most of the cases in the high-noise regime.

Has companion code repository: https://github.com/shuai-huang/1Bit-CS

This page was built for publication: 1-Bit Compressive Sensing via Approximate Message Passing with Built-in Parameter Estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345152)