English
Related papers

Related papers: Stable Manifold Embeddings with Structured Random …

200 papers

In compressed sensing, the "restricted isometry property" (RIP) is a sufficient condition for the efficient reconstruction of a nearly k-sparse vector x in C^d from m linear measurements Phi x. It is desirable for m to be small, and for Phi…

Data Structures and Algorithms · Computer Science 2012-11-07 Jelani Nelson , Eric Price , Mary Wootters

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

We study statistical restricted isometry, a property closely related to sparse signal recovery, of deterministic sensing matrices of size $m \times N$. A matrix is said to have a statistical restricted isometry property (StRIP) of order $k$…

Information Theory · Computer Science 2016-11-17 Alexander Barg , Arya Mazumdar , Rongrong Wang

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

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 restricted isometry property (RIP) is a well-known matrix condition that provides state-of-the-art reconstruction guarantees for compressed sensing. While random matrices are known to satisfy this property with high probability,…

Functional Analysis · Mathematics 2012-02-24 Afonso S. Bandeira , Matthew Fickus , Dustin G. Mixon , Percy Wong

This paper introduces a new framework of fast and efficient sensing matrices for practical compressive sensing, called Structurally Random Matrix (SRM). In the proposed framework, we pre-randomize a sensing signal by scrambling its samples…

Information Theory · Computer Science 2015-05-28 Thong T. Do , Lu Gan , Nam H. Nguyen , Trac D. Tran

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

The study of the restricted isometry property (RIP) of corrupted random matrices is particularly important in the field of compressed sensing (CS) with corruptions. If a matrix still satisfies the RIP after that a certain portion of rows…

Probability · Mathematics 2019-03-22 Ran Lu

Compressed sensing (CS) enables people to acquire the compressed measurements directly and recover sparse or compressible signals faithfully even when the sampling rate is much lower than the Nyquist rate. However, the pure random sensing…

Information Theory · Computer Science 2016-11-24 Kezhi Li , Shuang Cong

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

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

Dimensionality reduction is in demand to reduce the complexity of solving large-scale problems with data lying in latent low-dimensional structures in machine learning and computer version. Motivated by such need, in this work we study the…

Information Theory · Computer Science 2018-01-31 Gen Li , Qinghua Liu , Yuantao Gu

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

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

Compressed sensing (CS) shows that a signal having a sparse or compressible representation can be recovered from a small set of linear measurements. In classical CS theory, the sampling matrix and representation matrix are assumed to be…

Information Theory · Computer Science 2015-07-03 Yipeng Liu

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

The expicit restricted isometry property (RIP) measurement matrices are needed in practical application of compressed sensing in signal processing. RIP matrices from Reed-Solomon codes, BCH codes, orthogonal codes, expander graphs have been…

Information Theory · Computer Science 2015-06-15 Liqing Xu , Hao Chen

Compressed sensing and its extensions have recently triggered interest in randomized signal acquisition. A key finding is that random measurements provide sparse signal reconstruction guarantees for efficient and stable algorithms with a…

Information Theory · Computer Science 2014-07-08 Felix Krahmer , Holger Rauhut

Our objective is to efficiently design a robust projection matrix $\Phi$ for the Compressive Sensing (CS) systems when applied to the signals that are not exactly sparse. The optimal projection matrix is obtained by mainly minimizing the…

Machine Learning · Computer Science 2017-09-07 Tao Hong , Zhihui Zhu