English
Related papers

Related papers: Note on RIP-based Co-sparse Analysis

200 papers

This article presents novel results concerning the recovery of signals from undersampled data in the common situation where such signals are not sparse in an orthonormal basis or incoherent dictionary, but in a truly redundant dictionary.…

Numerical Analysis · Mathematics 2015-03-17 Emmanuel J. Candes , Yonina C. Eldar , Deanna Needell , Paige Randall

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

Compressive sensing (CS) has recently emerged as a powerful framework for acquiring sparse signals. The bulk of the CS literature has focused on the case where the acquired signal has a sparse or compressible representation in an…

Information Theory · Computer Science 2013-06-24 Mark A. Davenport , Deanna Needell , Michael B. Wakin

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

The recovery of sparsest overcomplete representation has recently attracted intensive research activities owe to its important potential in the many applied fields such as signal processing, medical imaging, communication, and so on. This…

Information Theory · Computer Science 2011-09-29 Lianlin Li

We formulate a unified framework for the separation of signals that are sparse in "morphologically" different redundant dictionaries. This formulation incorporates the so-called "analysis" and "synthesis" approaches as special cases and…

Information Theory · Computer Science 2016-11-17 Céline Aubel , Christoph Studer , Graeme Pope , Helmut Bölcskei

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

This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a…

Probability · Mathematics 2010-11-10 Holger Rauhut , Karin Schnass , Pierre Vandergheynst

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

The theory of Compressed Sensing, the emerging sampling paradigm 'that goes against the common wisdom', asserts that 'one can recover signals in Rn from far fewer samples or measurements, if the signal has a sparse representation in some…

Information Theory · Computer Science 2013-11-01 Ankit Kundu , Pradosh K. Roy

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

It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we…

Methodology · Statistics 2007-11-13 Emmanuel J. Candes , Michael B. Wakin , Stephen P. Boyd

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

Compressed sensing has a wide range of applications that include error correction, imaging, radar and many more. Given a sparse signal in a high dimensional space, one wishes to reconstruct that signal accurately and efficiently from a…

Numerical Analysis · Mathematics 2009-05-28 Deanna Needell

Compressed sensing (CS) theory considers the restricted isometry property (RIP) as a sufficient condition for measurement matrix which guarantees the recovery of any sparse signal from its compressed measurements. The RIP condition also…

Other Computer Science · Computer Science 2013-09-24 Seyed Hossein Hosseini , Mahrokh G. Shayesteh , Mehdi Chehel Amirani

Recently, many practical algorithms have been proposed to recover the sparse signal from fewer measurements. Orthogonal matching pursuit (OMP) is one of the most effective algorithm. In this paper, we use the restricted isometry property to…

Functional Analysis · Mathematics 2011-06-01 Yi Shen , Song Li

This paper discusses reconstruction of signals from few measurements in the situation that signals are sparse or approximately sparse in terms of a general frame via the $l_q$-analysis optimization with $0<q\leq 1$. We first introduce a…

Information Theory · Computer Science 2016-02-23 Junhong Lin , Song Li

The Restricted Isometry Property (RIP) is a fundamental property of a matrix enabling sparse recovery. Informally, an m x n matrix satisfies RIP of order k in the l_p norm if ||Ax||_p \approx ||x||_p for any vector x that is k-sparse, i.e.,…

Data Structures and Algorithms · Computer Science 2014-04-29 Piotr Indyk , Ilya Razenshteyn

Orthogonal Matching Pursuit (OMP) has long been considered a powerful heuristic for attacking compressive sensing problems; however, its theoretical development is, unfortunately, somewhat lacking. This paper presents an improved Restricted…

Data Structures and Algorithms · Computer Science 2011-02-22 Ray Maleh

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
‹ Prev 1 2 3 10 Next ›