English
Related papers

Related papers: Hierarchical restricted isometry property for Kron…

200 papers

There are two main algorithmic approaches to sparse signal recovery: geometric and combinatorial. The geometric approach starts with a geometric constraint on the measurement matrix and then uses linear programming to decode information…

Discrete Mathematics · Computer Science 2008-04-30 R. Berinde , A. C. Gilbert , P. Indyk , H. Karloff , M. J. Strauss

Over the past years, there are increasing interests in recovering the signals from undersampling data where such signals are sparse under some orthogonal dictionary or tight framework, which is referred to be sparse synthetic model. More…

Information Theory · Computer Science 2012-02-10 Lianlin Li

Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Cand\`{e}s and Tao showed that sparse reconstruction is possible if the sensing matrix acts as a near isometry on all $\boldsymbol{k}$-sparse…

Information Theory · Computer Science 2009-10-18 Robert Calderbank , Stephen Howard , Sina Jafarpour

Recovery of the initial state of a high-dimensional system can require a large number of measurements. In this paper, we explain how this burden can be significantly reduced when randomized measurement operators are employed. Our work…

Systems and Control · Computer Science 2013-07-17 Borhan M. Sanandaji , Michael B. Wakin , Tyrone L. Vincent

Inspired by significant real-life applications, in particular, sparse phase retrieval and sparse pulsation frequency detection in Asteroseismology, we investigate a general framework for compressed sensing, where the measurements are…

Numerical Analysis · Mathematics 2017-09-04 Martin Ehler , Massimo Fornasier , Juliane Sigl

Compressed sensing is a paradigm within signal processing that provides the means for recovering structured signals from linear measurements in a highly efficient manner. Originally devised for the recovery of sparse signals, it has become…

Information Theory · Computer Science 2021-12-09 Jens Eisert , Axel Flinth , Benedikt Groß , Ingo Roth , Gerhard Wunder

The problem of wideband massive MIMO channel estimation is considered. Targeting for low complexity algorithms as well as small training overhead, a compressive sensing (CS) approach is pursued. Unfortunately, due to the Kronecker-type…

Information Theory · Computer Science 2018-03-30 Gerhard Wunder , Ingo Roth , Axel Flinth , Mahdi Barzegar , Saeid Haghighatshoar , Giuseppe Caire , Gitta Kutyniok

Group-sparsity is a common low-complexity signal model with widespread application across various domains of science and engineering. The recovery of such signal ensembles from compressive measurements has been extensively studied in the…

Information Theory · Computer Science 2022-03-25 Niklas Koep , Arash Behboodi , Rudolf Mathar

The restricted isometry property (RIP) has become well-known in the compressed sensing community. Recently, a weaken version of RIP was proposed for exact sparse recovery under weak moment assumptions. In this note, we prove that the weaken…

Information Theory · Computer Science 2015-04-02 Hui Zhang

Many inverse problems in signal processing deal with the robust estimation of unknown data from underdetermined linear observations. Low dimensional models, when combined with appropriate regularizers, have been shown to be efficient at…

Information Theory · Computer Science 2016-12-07 Yann Traonmilin , Rémi Gribonval

Compressed Sensing (CS) seeks to recover an unknown vector with $N$ entries by making far fewer than $N$ measurements; it posits that the number of compressed sensing measurements should be comparable to the information content of the…

Information Theory · Computer Science 2010-04-29 Jeffrey D. Blanchard , Coralia Cartis , Jared Tanner

This paper presents a new analysis for the orthogonal matching pursuit (OMP) algorithm. It is shown that if the restricted isometry property (RIP) is satisfied at sparsity level $O(\bar{k})$, then OMP can recover a $\bar{k}$-sparse signal…

Information Theory · Computer Science 2011-06-06 Tong Zhang

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

This paper considers approximately sparse signal and low-rank matrix's recovery via truncated norm minimization $\min_{x}\|x_T\|_q$ and $\min_{X}\|X_T\|_{S_q}$ from noisy measurements. We first introduce truncated sparse approximation…

Information Theory · Computer Science 2021-05-28 Wengu Chen , Peng Li

The hierarchical sparsity framework, and in particular the HiHTP algorithm, has been successfully applied to many relevant communication engineering problems recently, particularly when the signal space is hierarchically structured. In this…

Information Theory · Computer Science 2024-11-12 Axel Flinth , Ingo Roth , Gerhard Wunder

A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, solutions of underdetermined linear systems of equations. Many…

Information Theory · Computer Science 2010-04-13 Jeffrey D. Blanchard , Coralia Cartis , Jared Tanner , Andrew Thompson

We formulate a generalization of the Restricted Isometry Property (RIP) referred to as the Restricted Quasiconvexity Isometry Property (RQIP) for alpha stable random projections with $0<\alpha<1$. A lower bound on the number of rows for…

Probability · Mathematics 2025-07-04 Sunder Ram Krishnan

Millimeter wave beam alignment (BA) is a challenging problem especially for large number of antennas. Compressed sensing (CS) tools have been exploited due to the sparse nature of such channels. This paper presents a novel deterministic CS…

Signal Processing · Electrical Eng. & Systems 2020-04-03 Erfan Khordad , Iain B. Collings , Stephen V. Hanly

A spectrally sparse signal of order $r$ is a mixture of $r$ damped or undamped complex sinusoids. This paper investigates the problem of reconstructing spectrally sparse signals from a random subset of $n$ regular time domain samples, which…

Information Theory · Computer Science 2016-06-07 Jian-Feng Cai , Tianming Wang , Ke Wei

Many emerging applications involve sparse signals, and their processing is a subject of active research. We desire a large class of sensing matrices which allow the user to discern important properties of the measured sparse signal. Of…

Functional Analysis · Mathematics 2012-04-27 Dustin G. Mixon