English
Related papers

Related papers: The Noise-Sensitivity Phase Transition in Compress…

200 papers

Compressed sensing posits that, within limits, one can undersample a sparse signal and yet reconstruct it accurately. Knowing the precise limits to such undersampling is important both for theory and practice. We present a formula that…

Information Theory · Computer Science 2013-01-09 David Donoho , Iain Johnstone , Andrea Montanari

Compressed sensing deals with efficient recovery of analog signals from linear encodings. This paper presents a statistical study of compressed sensing by modeling the input signal as an i.i.d. process with known distribution. Three classes…

Information Theory · Computer Science 2012-07-12 Yihong Wu , Sergio Verdú

In this paper, we tackle the compressive phase retrieval problem in the presence of noise. The noisy compressive phase retrieval problem is to recover a $K$-sparse complex signal $s \in \mathbb{C}^n$, from a set of $m$ noisy quadratic…

Information Theory · Computer Science 2016-06-03 Dong Yin , Kangwook Lee , Ramtin Pedarsani , Kannan Ramchandran

Noiseless compressive sensing is a two-steps setting that allows for undersampling a sparse signal and then reconstructing it without loss of information. The LASSO algorithm, based on $\lone$ regularization, provides an efficient and…

Information Theory · Computer Science 2025-11-13 Damien Barbier , Carlo Lucibello , Luca Saglietti , Florent Krzakala , Lenka Zdeborová

Compressed sensing is a signal processing scheme that reconstructs high-dimensional sparse signals from a limited number of observations. In recent years, various problems involving signals with a finite number of discrete values have been…

Statistical Mechanics · Physics 2024-08-20 Mikiya Doi , Masayuki Ohzeki

We investigate a power-constrained sensing matrix design problem for a compressed sensing framework. We adopt a mean square error (MSE) performance criterion for sparse source reconstruction in a system where the source-to-sensor channel…

Information Theory · Computer Science 2014-09-29 Amirpasha Shirazinia , Subhrakanti Dey

The class of Lq-regularized least squares (LQLS) are considered for estimating a p-dimensional vector \b{eta} from its n noisy linear observations y = X\b{eta}+w. The performance of these schemes are studied under the high-dimensional…

Statistics Theory · Mathematics 2018-02-20 Haolei Weng , Arian Maleki

The goal of phase-only compressed sensing is to recover a structured signal $\mathbf{x}$ from the phases $\mathbf{z} = {\rm sign}(\mathbf{\Phi}\mathbf{x})$ under some complex-valued sensing matrix $\mathbf{\Phi}$. Exact reconstruction of…

Information Theory · Computer Science 2025-01-22 Junren Chen , Lexiao Lai , Arian Maleki

Compressed sensing is a signal processing technique in which data is acquired directly in a compressed form. There are two modeling approaches that can be considered: the worst-case (Hamming) approach and a statistical mechanism, in which…

Information Theory · Computer Science 2016-01-20 Wasim Huleihel , Neri Merhav

We propose an adversarial evaluation framework for sensitive feature inference based on minimum mean-squared error (MMSE) estimation with a finite sample size and linear predictive models. Our approach establishes theoretical lower bounds…

Machine Learning · Statistics 2025-05-15 Monica Welfert , Nathan Stromberg , Mario Diaz , Lalitha Sankar

Denoising has to do with estimating a signal $x_0$ from its noisy observations $y=x_0+z$. In this paper, we focus on the "structured denoising problem", where the signal $x_0$ possesses a certain structure and $z$ has independent normally…

Information Theory · Computer Science 2013-11-15 Samet Oymak , Babak Hassibi

In this paper, we investigate power-constrained sensing matrix design in a sparse Gaussian linear dimensionality reduction framework. Our study is carried out in a single--terminal setup as well as in a multi--terminal setup consisting of…

Information Theory · Computer Science 2015-10-28 Amirpasha Shirazinia , Subhrakanti Dey

We consider the problem of estimating an unknown signal $x_0$ from noisy linear observations $y = Ax_0 + z\in R^m$. In many practical instances, $x_0$ has a certain structure that can be captured by a structure inducing convex function…

Information Theory · Computer Science 2013-11-07 Samet Oymak , Christos Thrampoulidis , Babak Hassibi

Compressed sensing typically deals with the estimation of a system input from its noise-corrupted linear measurements, where the number of measurements is smaller than the number of input components. The performance of the estimation…

Information Theory · Computer Science 2016-11-17 Jin Tan , Danielle Carmon , Dror Baron

Minimum mean square error (MMSE) estimation of block sparse signals from noisy linear measurements is considered. Unlike in the standard compressive sensing setup where the non-zero entries of the signal are independently and uniformly…

Information Theory · Computer Science 2012-04-26 Mikko Vehkaperä , Saikat Chatterjee , Mikael Skoglund

Accurate phase extraction from sinusoidal signals is a crucial task in various signal processing applications. While prior research predominantly addresses the case of asynchronous sampling with unknown signal frequency, this study focuses…

Signal Processing · Electrical Eng. & Systems 2024-11-01 Emmanuel Dervieux , Florian Tilquin , Alexis Bisiaux , Wilfried Uhring

In the standard Gaussian linear measurement model $Y=X\mu_0+\xi \in \mathbb{R}^m$ with a fixed noise level $\sigma>0$, we consider the problem of estimating the unknown signal $\mu_0$ under a convex constraint $\mu_0 \in K$, where $K$ is a…

Statistics Theory · Mathematics 2022-01-24 Qiyang Han

This paper describes performance bounds for compressed sensing in the presence of Poisson noise when the underlying signal, a vector of Poisson intensities, is sparse or compressible (admits a sparse approximation). The signal-independent…

Information Theory · Computer Science 2009-04-30 Rebecca M. Willett , Maxim Raginsky

Quantum computing allows for the manipulation of highly correlated states whose properties quickly go beyond the capacity of any classical method to calculate. Thus one natural problem which could lend itself to quantum advantage is the…

Quantum Physics · Physics 2024-12-19 Kevin Lively , Tim Bode , Jochen Szangolies , Jian-Xin Zhu , Benedikt Fauseweh

The achievable and converse regions for sparse representation of white Gaussian noise based on an overcomplete dictionary are derived in the limit of large systems. Furthermore, the marginal distribution of such sparse representations is…

Information Theory · Computer Science 2017-02-13 Ori Shental
‹ Prev 1 2 3 10 Next ›