English
Related papers

Related papers: Consistent Basis Pursuit for Signal and Matrix Est…

200 papers

Support recovery of sparse signals from noisy measurements with orthogonal matching pursuit (OMP) has been extensively studied in the literature. In this paper, we show that for any $K$-sparse signal $\x$, if the sensing matrix $\A$…

Information Theory · Computer Science 2018-07-13 JInming Wen , Zhengchun Zhou , Jian Wang , Xiaohu Tang , Qun Mo

Simulation-based inference (SBI) is constantly in search of more expressive and efficient algorithms to accurately infer the parameters of complex simulation models. In line with this goal, we present consistency models for posterior…

Machine Learning · Computer Science 2024-11-05 Marvin Schmitt , Valentin Pratz , Ullrich Köthe , Paul-Christian Bürkner , Stefan T Radev

Recently, there have been significant interests in studying the so-called "double-descent" of the generalization error of linear regression models under the overparameterized and overfitting regime, with the hope that such analysis may…

Machine Learning · Computer Science 2020-11-19 Peizhong Ju , Xiaojun Lin , Jia Liu

We consider the problem of estimating a deterministic sparse vector x from underdetermined measurements Ax+w, where w represents white Gaussian noise and A is a given deterministic dictionary. We analyze the performance of three sparse…

Statistics Theory · Mathematics 2015-05-13 Zvika Ben-Haim , Yonina C. Eldar , Michael Elad

The co-sparse analysis model for signals assumes that the signal of interest can be multiplied by an analysis dictionary \Omega, leading to a sparse outcome. This model stands as an interesting alternative to the more classical synthesis…

Information Theory · Computer Science 2012-03-14 Tomer Peleg , Michael Elad

In this work we address the problem of blindly reconstructing compressively sensed signals by exploiting the co-sparse analysis model. In the analysis model it is assumed that a signal multiplied by an analysis operator results in a sparse…

Information Theory · Computer Science 2013-03-27 Julian Wörmann , Simon Hawe , Martin Kleinsteuber

Sampling rate is the bottleneck for spectrum sensing over multi-GHz bandwidth. Recent progress in compressed sensing (CS) initialized several sub-Nyquist rate approaches to overcome the problem. However, efforts to design CS reconstruction…

Information Theory · Computer Science 2011-02-15 Peng Zhang , Robert Qiu

Let $X=(x_1,...,x_n)$ be a random vector that satisfies a weak small ball property and whose coordinates $x_i$ satisfy that $\|x_i\|_{L_p} \lesssim \sqrt{p} \|x_i\|_{L_2}$ for $p \sim \log n$. In \cite{LM_compressed}, it was shown that $N$…

Statistics Theory · Mathematics 2014-04-14 Guillaume Lecué , Shahar Mendelson

This paper proposes a belief propagation (BP)-based algorithm for sequential detection and estimation of multipath component (MPC) parameters based on radio signals. Under dynamic channel conditions with moving transmitter/receiver, the…

Information Theory · Computer Science 2022-05-24 Xuhong Li , Erik Leitinger , Alexander Venus , Fredrik Tufvesson

Highly coherent sensing matrices arise in discretization of continuum problems such as radar and medical imaging when the grid spacing is below the Rayleigh threshold as well as in using highly coherent, redundant dictionaries as…

Information Theory · Computer Science 2015-05-30 Albert Fannjiang , Wenjing Liao

A field known as Compressive Sensing (CS) has recently emerged to help address the growing challenges of capturing and processing high-dimensional signals and data sets. CS exploits the surprising fact that the information contained in a…

Machine Learning · Statistics 2010-02-08 Michael B. Wakin

In this correspondence, we obtain exact recovery conditions for regularized modified basis pursuit (reg-mod-BP) and discuss when the obtained conditions are weaker than those for modified-CS or for basis pursuit (BP). The discussion is also…

Information Theory · Computer Science 2015-05-30 Wei Lu , Namrata Vaswani

This paper considers a discrete-valued signal estimation scheme based on a low-complexity Bayesian optimal message passing algorithm (MPA) for solving massive linear inverse problems under highly correlated measurements. Gaussian belief…

Signal Processing · Electrical Eng. & Systems 2024-11-14 Tomoharu Furudoi , Takumi Takahashi , Shinsuke Ibi , Hideki Ochiai

In this paper we present a new coherence-based performance guarantee for the Orthogonal Matching Pursuit (OMP) algorithm. A lower bound for the probability of correctly identifying the support of a sparse signal with additive white Gaussian…

Information Theory · Computer Science 2017-09-28 Ehsan Miandji , Mohammad Emadi , Jonas Unger , Ehsan Afshari

The compressive sensing (CS) and 1-bit CS demonstrate superior efficiency in signal acquisition and resource conservation, while 1-bit CS achieves maximum resource efficiency through sign-only measurements. With the emergence of massive…

Methodology · Statistics 2025-05-06 Erbo Li , Qi Qin , Yifan Sun , Liping Zhu

In compressed sensing (CS), sparse signals can be reconstructed from significantly fewer samples than required by the Nyquist-Shannon sampling theorem. While non-sparse signals can be sparsely represented in appropriate transformation…

Information Theory · Computer Science 2026-03-13 Qi Qi , Abdelhamid Tayebi , Daizhan Cheng , Jun-e Feng

Orthogonal matching pursuit~(OMP) is a commonly used greedy algorithm for recovering sparse signals from compressed measurements. In this paper, we introduce a variant of the OMP algorithm to reduce the complexity of reconstructing a class…

Signal Processing · Electrical Eng. & Systems 2025-11-25 Xinwei Zhao , Jinming Wen , Hongqi Yang , Xiao Ma

Binary 0-1 measurement matrices, especially those from coding theory, were introduced to compressed sensing (CS) recently. Good measurement matrices with preferred properties, e.g., the restricted isometry property (RIP) and nullspace…

Information Theory · Computer Science 2013-09-24 Xin-Ji Liu , Shu-Tao Xia

Phase-only compressed sensing (PO-CS) concerns the recovery of sparse signals from the phases of complex measurements. Recent results show that sparse signals in the standard sphere $\mathbb{S}^{n-1}$ can be exactly recovered from complex…

Information Theory · Computer Science 2026-04-07 Junren Chen , Michael K. Ng , Jonathan Scarlett

Highly coherent sensing matrices arise in discretization of continuum imaging problems such as radar and medical imaging when the grid spacing is below the Rayleigh threshold. Algorithms based on techniques of band exclusion (BE) and local…

Information Theory · Computer Science 2011-06-28 A. Fannjiang , W. Liao