English
Related papers

Related papers: One-Bit Phase Retrieval: Optimal Rates and Efficie…

200 papers

This paper investigates total variation minimization in one spatial dimension for the recovery of gradient-sparse signals from undersampled Gaussian measurements. Recently established bounds for the required sampling rate state that uniform…

Information Theory · Computer Science 2022-04-12 Martin Genzel , Maximilian März , Robert Seidel

The aim of this paper is to build up the theoretical framework for the recovery of sparse signals from the magnitude of the measurement. We first investigate the minimal number of measurements for the success of the recovery of sparse…

Information Theory · Computer Science 2013-10-07 Yang Wang , Zhiqiang Xu

Given a linear system in a real or complex domain, linear regression aims to recover the model parameters from a set of observations. Recent studies in compressive sensing have successfully shown that under certain conditions, a linear…

Statistics Theory · Mathematics 2016-11-15 Henrik Ohlsson , Allen Y. Yang , Roy Dong , S. Shankar Sastry

Sparse signals can be recovered from a reduced set of samples by using compressive sensing algorithms. In common methods the signal is recovered in the sparse domain. A method for the reconstruction of sparse signal which reconstructs the…

Information Theory · Computer Science 2015-04-28 Ljubisa Stankovic , Milos Dakovic

One-bit compressed sensing (1bCS) is a method of signal acquisition under extreme measurement quantization that gives important insights on the limits of signal compression and analog-to-digital conversion. The setting is also equivalent to…

Information Theory · Computer Science 2021-05-12 Larkin Flodin , Venkata Gandikota , Arya Mazumdar

We study the problem of jointly sparse support recovery with 1-bit compressive measurements in a sensor network. Sensors are assumed to observe sparse signals having the same but unknown sparse support. Each sensor quantizes its measurement…

Information Theory · Computer Science 2015-06-02 Vipul Gupta , Bhavya Kailkhura , Thakshila Wimalajeewa , Pramod K. Varshney

This paper addresses the classical problem of one-bit compressed sensing using a deep learning-based reconstruction algorithm that leverages a trained generative model to enhance the signal reconstruction performance. The generator, a…

Machine Learning · Computer Science 2025-02-19 Swatantra Kafle , Geethu Joseph , Pramod K. Varshney

Consider the recovery of an unknown signal ${x}$ from quantized linear measurements. In the one-bit compressive sensing setting, one typically assumes that ${x}$ is sparse, and that the measurements are of the form…

Machine Learning · Statistics 2016-01-20 Karin Knudson , Rayan Saab , Rachel Ward

Conventional sparse phase retrieval schemes can recover sparse signals from the magnitude of linear measurements only up to a global phase ambiguity. This work proposes a novel approach that instead utilizes the magnitude of affine…

Information Theory · Computer Science 2021-05-25 Ming-Hsun Yang , Y. -W. Peter Hong , Jwo-Yuh Wu

One-bit compressive sensing gains its popularity in signal processing and communications due to its low storage costs and low hardware complexity. However, it has been a challenging task to recover the signal only by exploiting the one-bit…

Optimization and Control · Mathematics 2022-04-20 Shenglong Zhou , Ziyan Luo , Naihua Xiu , Geoffrey Ye Li

Suppose we wish to recover a signal x in C^n from m intensity measurements of the form |<x,z_i>|^2, i = 1, 2,..., m; that is, from data in which phase information is missing. We prove that if the vectors z_i are sampled independently and…

Information Theory · Computer Science 2011-09-22 Emmanuel J. Candes , Thomas Strohmer , Vladislav Voroninski

The paper considers the problem of identifying the sparse different components between two high dimensional means of column-wise dependent random vectors. We show that the dependence can be utilized to lower the identification boundary for…

Methodology · Statistics 2014-10-13 Jun Li , Ping-Shou Zhong

In a variety of fields, in particular those involving imaging and optics, we often measure signals whose phase is missing or has been irremediably distorted. Phase retrieval attempts to recover the phase information of a signal from the…

Information Theory · Computer Science 2019-10-02 Gilles Baechler , Miranda Kreković , Juri Ranieri , Amina Chebira , Yue M. Lu , Martin Vetterli

This paper studies the problem of recovering a signal from one-bit compressed sensing measurements under a manifold model; that is, assuming that the signal lies on or near a manifold of low intrinsic dimension. We provide a convex recovery…

Information Theory · Computer Science 2020-07-24 Mark A. Iwen , Felix Krahmer , Sara Krause-Solberg , Johannes Maly

In one-bit compressed sensing, previous results state that sparse signals may be robustly recovered when the measurements are taken using Gaussian random vectors. In contrast to standard compressed sensing, these results are not extendable…

Information Theory · Computer Science 2013-04-10 Albert Ai , Alex Lapanowski , Yaniv Plan , Roman Vershynin

We consider the phase retrieval problem of reconstructing a $n$-dimensional real or complex signal $\mathbf{X}^{\star}$ from $m$ (possibly noisy) observations $Y_\mu = | \sum_{i=1}^n \Phi_{\mu i} X^{\star}_i/\sqrt{n}|$, for a large class of…

Statistics Theory · Mathematics 2021-02-18 Antoine Maillard , Bruno Loureiro , Florent Krzakala , Lenka Zdeborová

Phase retrieval (PR) is a popular research topic in signal processing and machine learning. However, its performance degrades significantly when the measurements are corrupted by noise or outliers. To address this limitation, we propose a…

Optimization and Control · Mathematics 2025-05-30 Jun Fan , Ailing Yan , Xianchao Xiu , Wanquan Liu

We propose a robust and efficient approach to the problem of compressive phase retrieval in which the goal is to reconstruct a sparse vector from the magnitude of a number of its linear measurements. The proposed framework relies on…

Information Theory · Computer Science 2015-10-28 Sohail Bahmani , Justin Romberg

In signal processing and data recovery, reconstructing a signal from quadratic measurements poses a significant challenge, particularly in high-dimensional settings where measurements $m$ is far less than the signal dimension $n$ (i.e., $m…

Information Theory · Computer Science 2025-07-11 Jinming Wen , Yi Hu , Meng Huang

A simple hard-thresholding operation is shown to be able to recover $L$ signals $\mathbf{x}_1,...,\mathbf{x}_L \in \mathbb{R}^n$ that share a common support of size $s$ from $m = \mathcal{O}(s)$ one-bit measurements per signal if $L \ge…

Information Theory · Computer Science 2018-09-18 Johannes Maly , Lars Palzer