English
Related papers

Related papers: Compressed Sensing for Analog Signals

200 papers

Compressed Sensing refers to extracting a low-dimensional structured signal of interest from its incomplete random linear observations. A line of recent work has studied that, with the extra prior information about the signal, one can…

Information Theory · Computer Science 2017-04-19 Sajad Daei , Farzan Haddadi

We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As demonstrated heuristically and…

Information Theory · Computer Science 2015-03-19 David L. Donoho , Adel Javanmard , Andrea Montanari

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

We advocate a compressed sensing strategy that consists of multiplying the signal of interest by a wide bandwidth modulation before projection onto randomly selected vectors of an orthonormal basis. Firstly, in a digital setting with random…

Information Theory · Computer Science 2012-03-13 Gilles Puy , Pierre Vandergheynst , Rémi Gribonval , Yves Wiaux

In compressed sensing, we wish to reconstruct a sparse signal $x$ from observed data $y$. In sparse coding, on the other hand, we wish to find a representation of an observed signal $y$ as a sparse linear combination, with coefficients $x$,…

Computer Vision and Pattern Recognition · Computer Science 2013-11-25 Will Landecker , Rick Chartrand , Simon DeDeo

Compressed sensing is a recent set of mathematical results showing that sparse signals can be exactly reconstructed from a small number of linear measurements. Interestingly, for ideal sparse signals with no measurement noise, random…

Information Theory · Computer Science 2009-01-28 Hyun Sung Chang , Yair Weiss , William T. Freeman

Recent research in off-the-grid compressed sensing (CS) has demonstrated that, under certain conditions, one can successfully recover a spectrally sparse signal from a few time-domain samples even though the dictionary is continuous. In…

Information Theory · Computer Science 2013-12-03 Weiyu Xu , Jian-Feng Cai , Kumar Vijay Mishra , Myung Cho , Anton Kruger

Wideband spectrum sensing detects the unused spectrum holes for dynamic spectrum access (DSA). Too high sampling rate is the main problem. Compressive sensing (CS) can reconstruct sparse signal with much fewer randomized samples than…

Information Theory · Computer Science 2012-04-16 Yipeng Liu , Qun Wan

Compressed sensing is a processing method that significantly reduces the number of measurements needed to accurately resolve signals in many fields of science and engineering. We develop a two-dimensional (2D) variant of compressed sensing…

Quantum Physics · Physics 2012-07-17 J. N. Sanders , S. Mostame , S. K. Saikin , X. Andrade , J. R. Widom , A. H. Marcus , A. Aspuru-Guzik

Compressive Sensing, as an emerging technique in signal processing is reviewed in this paper together with its common applications. As an alternative to the traditional signal sampling, Compressive Sensing allows a new acquisition strategy…

Information Theory · Computer Science 2017-05-16 Andjela Draganic , Irena Orovic , Srdjan Stankovic

Let A be an M by N matrix (M < N) which is an instance of a real random Gaussian ensemble. In compressed sensing we are interested in finding the sparsest solution to the system of equations A x = y for a given y. In general, whenever the…

Information Theory · Computer Science 2011-03-09 Mihailo Stojnic , Farzad Parvaresh , Babak Hassibi

Compressive sensing has been receiving a great deal of interest from researchers in many areas because of its ability in speeding up data acquisition. This framework allows fast signal acquisition and compression when signals are sparse in…

Information Theory · Computer Science 2020-03-17 Fatima Salahdine , Elias Ghribi , Naima Kaabouch

Compressive sensing relies on the sparse prior imposed on the signal of interest to solve the ill-posed recovery problem in an under-determined linear system. The objective function used to enforce the sparse prior information should be…

Information Theory · Computer Science 2020-02-25 Shuai Huang , Trac D. Tran

Compressed Sensing decoding algorithms can efficiently recover an N dimensional real-valued vector x to within a factor of its best k-term approximation by taking m = 2klog(N/k) measurements y = Phi x. If the sparsity or approximate…

Numerical Analysis · Mathematics 2008-12-09 Rachel Ward

Many practical sensing applications involve multiple sensors simultaneously acquiring measurements of a single object. Conversely, most existing sparse recovery guarantees in compressed sensing concern only single-sensor acquisition…

Information Theory · Computer Science 2023-08-31 Il Yong Chun , Ben Adcock

We propose to reduce the original well-posed problem of compressive sensing to weighted-MAX-SAT. Compressive sensing is a novel randomized data acquisition approach that linearly samples sparse or compressible signals at a rate much below…

Information Theory · Computer Science 2019-05-28 Ramin Ayanzadeh , Milton Halem , Tim Finin

The goal of compressed sensing is to learn a structured signal $x$ from a limited number of noisy linear measurements $y \approx Ax$. In traditional compressed sensing, "structure" is represented by sparsity in some known basis. Inspired by…

Data Structures and Algorithms · Computer Science 2019-12-09 Akshay Kamath , Sushrut Karmalkar , Eric Price

Compressive sensing is a technique to sample signals well below the Nyquist rate using linear measurement operators. In this paper we present an algorithm for signal reconstruction given such a set of measurements. This algorithm…

Information Theory · Computer Science 2009-06-08 Graeme Pope

For several communication models, the dispersive part of a communication channel is described by a bilinear operation $T$ between the possible sets of input signals and channel parameters. The received channel output has then to be…

Information Theory · Computer Science 2015-03-20 Philipp Walk , Peter Jung

Signal models formed as linear combinations of few atoms from an over-complete dictionary or few frame vectors from a redundant frame have become central to many applications in high dimensional signal processing and data analysis. A core…

Information Theory · Computer Science 2024-08-30 Xuemei Chen , Christian Kümmerle , Rongrong Wang
‹ Prev 1 4 5 6 7 8 10 Next ›