English
Related papers

Related papers: Technical Report: Observability with Random Observ…

200 papers

In Compressive Sensing, the Restricted Isometry Property (RIP) ensures that robust recovery of sparse vectors is possible from noisy, undersampled measurements via computationally tractable algorithms. It is by now well-known that Gaussian…

Information Theory · Computer Science 2014-02-17 Armin Eftekhari , Han Lun Yap , Christopher J. Rozell , Michael B. Wakin

In this paper we consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is…

Information Theory · Computer Science 2012-11-22 Mohammad Golbabaee , Pierre Vandergheynst

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) is essential for the linear map to guarantee the successful recovery of low-rank matrices. The existing works show that the linear map generated by the measurement matrices with independent and…

Information Theory · Computer Science 2024-05-08 Wei Zhang , Zhenni Wang

The restricted isometry property (RIP) is a universal tool for data recovery. We explore the implication of the RIP in the framework of generalized sparsity and group measurements introduced in the Part I paper. It turns out that for a…

Machine Learning · Statistics 2017-07-03 Marius Junge , Kiryung Lee

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

Consider the problem of recovering an unknown signal from undersampled measurements, given the knowledge that the signal has a sparse representation in a specified dictionary $D$. This problem is now understood to be well-posed and…

Information Theory · Computer Science 2015-06-09 Felix Krahmer , Deanna Needell , Rachel Ward

The fields of compressed sensing (CS) and matrix completion have shown that high-dimensional signals with sparse or low-rank structure can be effectively projected into a low-dimensional space (for efficient acquisition or processing) when…

Information Theory · Computer Science 2013-05-16 Han Lun Yap , Michael B. Wakin , Christopher J. Rozell

The most frequently used condition for sampling matrices employed in compressive sampling is the restricted isometry (RIP) property of the matrix when restricted to sparse signals. At the same time, imposing this condition makes it…

Information Theory · Computer Science 2013-03-11 Alexander Barg , Arya Mazumdar , Rongrong Wang

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

Consider an n-dimensional linear system where it is known that there are at most k<n non-zero components in the initial state. The observability problem, that is the recovery of the initial state, for such a system is considered. We obtain…

Information Theory · Computer Science 2012-04-17 Wei Dai , Serdar Yüksel

In this work, we analyze modulated sampling schemes, such as the Nyquist Folding Receiver, which are highly efficient, readily implementable, non-uniform sampling schemes that allows for the blind estimation of a narrow-band signal's…

Information Theory · Computer Science 2012-08-01 Ray Maleh , Gerald L. Fudge

The purpose of this paper is twofold. The first is to point out that the Restricted Isometry Property (RIP) does not hold in many applications where compressed sensing is successfully used. This includes fields like Magnetic Resonance…

Information Theory · Computer Science 2015-10-19 Alexander Bastounis , Anders C. Hansen

Restricted Isometry Property (RIP) is of fundamental importance in the theory of compressed sensing and forms the base of many exact and robust recovery guarantees in this field. A quantitative description of RIP involves bounding the…

Information Theory · Computer Science 2020-07-15 Gen Li , Xingyu Xu , Yuantao Gu

It is known that sparse recovery by measurements from random circulant matrices provides good recovery bounds. We generalize this to measurements that arise as a random orbit of a group representation for some finite group G. We derive…

Information Theory · Computer Science 2025-09-17 Hartmut Führ , Timm Gilles

Compressed Sensing aims to capture attributes of $k$-sparse signals using very few measurements. In the standard Compressed Sensing paradigm, the $\m\times \n$ measurement matrix $\A$ is required to act as a near isometry on the set of all…

Information Theory · Computer Science 2015-05-14 Robert Calderbank , Stephen Howard , Sina Jafarpour

In the context of compressed sensing (CS), both Subspace Pursuit (SP) and Compressive Sampling Matching Pursuit (CoSaMP) are very important iterative greedy recovery algorithms which could reduce the recovery complexity greatly comparing…

Information Theory · Computer Science 2015-06-17 Chao-Bing Song , Shu-Tao Xia , Xin-ji Liu

In this paper, {the goal is to design deterministic sampling patterns on the sphere and the rotation group} and, thereby, construct sensing matrices for sparse recovery of band-limited functions. It is first shown that random sensing…

Information Theory · Computer Science 2020-04-22 Arya Bangun , Arash Behboodi , Rudolf Mathar

We analyze a multiple-input multiple-output (MIMO) radar model and provide recovery results for a compressed sensing (CS) approach. In MIMO radar different pulses are emitted by several transmitters and the echoes are recorded at several…

Information Theory · Computer Science 2015-09-14 Dominik Dorsch , Holger Rauhut

Compressive sensing (CS) is well-known for its unique functionalities of sensing, compressing, and security (i.e. CS measurements are equally important). However, there is a tradeoff. Improving sensing and compressing efficiency with prior…

Signal Processing · Electrical Eng. & Systems 2020-02-19 Thuong Nguyen Canh , Byeungwoo Jeon
‹ Prev 1 2 3 10 Next ›