Open Access
Signal Recovery from Random Measurements Via Orthogonal Matching Pursuit: The Gaussian Case
Joel A. Tropp,Anna C. Gilbert +1 more
Reads0
Chats0
TLDR
In this paper, a greedy algorithm called Orthogonal Matching Pursuit (OMP) was proposed to recover a signal with m nonzero entries in dimension 1 given O(m n d) random linear measurements of that signal.Abstract:
This report demonstrates theoretically and empirically that a greedy algorithm called
Orthogonal Matching Pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension
d given O(mln d) random linear measurements of that signal. This is a massive improvement
over previous results, which require O(m2) measurements. The new results for OMP are comparable
with recent results for another approach called Basis Pursuit (BP). In some settings, the
OMP algorithm is faster and easier to implement, so it is an attractive alternative to BP for signal
recovery problems.read more
Citations
More filters
Proceedings ArticleDOI
Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms
TL;DR: This work is the first to explicitly estimate such a constant that characterizes the gap between the upper and lower bounds for these problems, and gives information-theoretic lower bounds on the query complexity of these problems.
Journal ArticleDOI
Compressive sensing based multi-user detection for machine-to-machine communication
TL;DR: The sporadic nature of machine‐to‐machine communication, low data rates, small packets and a large number of nodes necessitate low overhead communication schemes that do not require extended control signaling for resource allocation and management.
Journal ArticleDOI
Compressive light transport sensing
Pieter Peers,Dhruv Mahajan,Bruce Lamond,Abhijeet Ghosh,Wojciech Matusik,Ravi Ramamoorthi,Paul Debevec +6 more
TL;DR: A new framework for capturing light transport data of a real scene, based on the recently developed theory of compressive sensing, is proposed and several innovations that address specific challenges for image-based relighting are developed.
Journal ArticleDOI
Combinatorial Sublinear-Time Fourier Algorithms
TL;DR: This paper develops the first known deterministic sublinear-time sparse Fourier Transform algorithm which is guaranteed to produce accurate results and implies a simpler optimized version of the deterministic compressed sensing method previously developed in.
Proceedings Article
An Information-Theoretic Approach to Distributed Compressed Sensing ∗
TL;DR: A new theory for distributed compressed sensing (DCS) is introduced that enables new distributed coding algorithms for multi-signal ensembles that exploit both intra- and inter-Signal correlation structures.
References
More filters
Book
Compressed sensing
TL;DR: It is possible to design n=O(Nlog(m)) nonadaptive measurements allowing reconstruction with accuracy comparable to that attainable with direct knowledge of the N most important coefficients, and a good approximation to those N important coefficients is extracted from the n measurements by solving a linear program-Basis Pursuit in signal processing.
Journal ArticleDOI
Atomic Decomposition by Basis Pursuit
TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
Journal ArticleDOI
Matching pursuits with time-frequency dictionaries
Stéphane Mallat,Zhifeng Zhang +1 more
TL;DR: The authors introduce an algorithm, called matching pursuit, that decomposes any signal into a linear expansion of waveforms that are selected from a redundant dictionary of functions, chosen in order to best match the signal structures.
Journal ArticleDOI
Least angle regression
Bradley Efron,Trevor Hastie,Iain M. Johnstone,Robert Tibshirani,Hemant Ishwaran,Keith Knight,Jean-Michel Loubes,Jean-Michel Loubes,Pascal Massart,Pascal Massart,David Madigan,David Madigan,Greg Ridgeway,Greg Ridgeway,Saharon Rosset,Saharon Rosset,Ji Zhu,Robert A. Stine,Berwin A. Turlach,Sanford Weisberg +19 more
TL;DR: A publicly available algorithm that requires only the same order of magnitude of computational effort as ordinary least squares applied to the full set of covariates is described.