English
Related papers

Related papers: RIP Analysis of Modulated Sampling Schemes for Rec…

200 papers

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

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

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

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 (CS) is a signal processing technique which can accurately recover sparse signals from linear measurements with far fewer number of measurements than those required by the classical Shannon-Nyquist theorem. Block sparse…

Information Theory · Computer Science 2019-01-30 Haifeng Li , Jinming Wen

Sparse representations have emerged as a powerful tool in signal and information processing, culminated by the success of new acquisition and processing techniques such as Compressed Sensing (CS). Fusion frames are very rich new signal…

Information Theory · Computer Science 2011-06-20 Petros T. Boufounos , Gitta Kutyniok , Holger Rauhut

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

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

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

As an extension of orthogonal matching pursuit (OMP) improving the recovery performance of sparse signals, generalized OMP (gOMP) has recently been studied in the literature. In this paper, we present a new analysis of the gOMP algorithm…

Information Theory · Computer Science 2015-06-15 Jian Wang , Suhyuk Kwon , Ping Li , Byonghyo Shim

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

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 limited availability of spectrum resources has been growing into a critical problem in wireless communications, remote sensing, and electronic surveillance, etc. To address the high-speed sampling bottleneck of wideband spectrum…

Signal Processing · Electrical Eng. & Systems 2023-08-15 Kaili Jiang , Dechang Wang , Kailun Tian , Hancong Feng , Yuxin Zhao , Sen Cao , Jian Gao , Xuying Zhang , Yanfei Li , Junyu Yuan , Ying Xiong , Bin Tang

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

We propose a novel random triggering based modulated wideband compressive sampling (RT-MWCS) method to facilitate efficient realization of sub-Nyquist rate compressive sampling systems for sparse wideband signals. Under the assumption that…

Information Theory · Computer Science 2017-03-07 Yijiu Zhao , Yu Hen Hu , Jingjing Liu

Traditional sampling theories consider the problem of reconstructing an unknown signal $x$ from a series of samples. A prevalent assumption which often guarantees recovery from the given measurements is that $x$ lies in a known subspace.…

Cellular Automata and Lattice Gases · Physics 2009-03-30 Yonina C. Eldar , Moshe Mishali

Because optical systems have huge bandwidth and are capable of generating low noise short pulses they are ideal for undersampling multi-band signals that are located within a very broad frequency range. In this paper we propose a new scheme…

Optics · Physics 2009-11-13 Amir Rosenthal , Alex Linden , Moshe Horowitz

The Random Demodulator (RD) and the Modulated Wideband Converter (MWC) are two recently proposed compressed sensing (CS) techniques for the acquisition of continuous-time spectrally-sparse signals. They extend the standard CS paradigm from…

Information Theory · Computer Science 2011-10-11 Michael A. Lexa , Mike E. Davies , John S. Thompson

Wideband analog signals push contemporary analog-to-digital conversion systems to their performance limits. In many applications, however, sampling at the Nyquist rate is inefficient because the signals of interest contain only a small…

Information Theory · Computer Science 2016-11-15 Joel A. Tropp , Jason N. Laska , Marco F. Duarte , Justin K. Romberg , Richard G. Baraniuk
‹ Prev 1 2 3 10 Next ›