English
Related papers

Related papers: RIP sensing matrices construction for sparsifying …

200 papers

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 involves the inversion of a mapping $SD \in \mathbb{R}^{m \times n}$, where $m < n$, $S$ is a sensing matrix, and $D$ is a sparisfying dictionary. The restricted isometry property is a powerful sufficient condition for…

Information Theory · Computer Science 2022-07-13 Jinn Ho , Wen-Liang Hwang

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 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

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

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 is the art of reconstructing a sparse vector from its inner products with respect to a small set of randomly chosen measurement vectors. It is usually assumed that the ensemble of measurement vectors is in isotropic…

Information Theory · Computer Science 2014-02-25 Richard Kueng , David Gross

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

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

This paper deals with the design of a sensing matrix along with a sparse recovery algorithm by utilizing the probability-based prior information for compressed sensing system. With the knowledge of the probability for each atom of the…

Machine Learning · Computer Science 2019-10-29 Q. Jiang , S. Li , Z. Zhu , H. Bai , X. He , R. C. de Lamare

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a $K \times N$ measurement matrix for compressed sensing is deterministically constructed via additive…

Information Theory · Computer Science 2010-10-04 Nam Yul Yu

The paper introduces a framework for the recoverability analysis in compressive sensing for imaging applications such as CI cameras, rapid MRI and coded apertures. This is done using the fact that the Spherical Section Property (SSP) of a…

Information Theory · Computer Science 2012-12-07 Mahdi S. Hosseini , Konstantinos N. Plataniotis

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

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

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

Compressed sensing is a signal processing technique whereby the limits imposed by the Shannon--Nyquist theorem can be exceeded provided certain conditions are imposed on the signal. Such conditions occur in many real-world scenarios, and…

Information Theory · Computer Science 2018-02-16 Fintan Hegarty , Padraig Ó Catháin , Yunbin Zhao

Magnetic resonance imaging (MRI) is an essential medical tool with inherently slow data acquisition process. Slow acquisition process requires patient to be long time exposed to scanning apparatus. In recent years significant efforts are…

Computer Vision and Pattern Recognition · Computer Science 2015-03-05 Jelena Badnjar

The restricted isometry property (RIP) for design matrices gives guarantees for optimal recovery in sparse linear models. It is of high interest in compressed sensing and statistical learning. This property is particularly important for…

Machine Learning · Computer Science 2016-06-01 Tengyao Wang , Quentin Berthet , Yaniv Plan

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

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a $K \times N$ measurement matrix for compressed sensing is deterministically constructed via multiplicative…

Information Theory · Computer Science 2010-11-12 Nam Yul Yu
‹ Prev 1 2 3 10 Next ›