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
Journal ArticleDOI
Deep Cascade Model-Based Face Recognition: When Deep-Layered Learning Meets Small Data
TL;DR: An end-to-end deep cascade model (DCM) based on SRC and NMR with hierarchical learning, nonlinear transformation and multi-layer structure for corrupted face recognition is proposed and demonstrated the superiority of the proposed model over state-of-the-art counterparts.
Proceedings ArticleDOI
Reconstruction-free inference on compressive measurements
TL;DR: It is shown that one can extract nontrivial correlational features directly from compressed measurements directly without reconstruction of the imagery and base this framework on smashed filters which suggests that inner-products between high-dimensional signals can be computed in the compressive domain to a high degree of accuracy.
Journal ArticleDOI
Analysis of Frequency Agile Radar via Compressed Sensing
TL;DR: This paper considers theoretical analysis of frequency agile radar via CS algorithms and analyzes the properties of the sensing matrix, which is a highly structured random matrix, to derive bounds on the number of recoverable targets.
Journal ArticleDOI
Compressive Sensing of Medical Images With Confidentially Homomorphic Aggregations
TL;DR: A so-called “one-stone-three-bird” solution for medical image acquisition and transmission based on compressive sensing theory that can be reduced to 20%, the resulted images have very well confidentiality and supporting additively homomorphic aggregation.
Journal ArticleDOI
Enhancing sparsity of Hermite polynomial expansions by iterative rotations
TL;DR: This paper identifies new bases for random variables through linear mappings such that the representation of the quantity of interest is more sparse with new basis functions associated with the new random variables.
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.