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
Secure and Energy-Efficient Data Transmission System Based on Chaotic Compressive Sensing in Body-to-Body Networks
TL;DR: Modified CCS is proposed, which uses two encryption mechanisms, confusion and mask, and performs a much better encryption quality, and can save vast storage space by only storing the matrix generation parameters.
Journal ArticleDOI
A survey on 5G massive MIMO Localization
TL;DR: An overview of the emerging field of massive MIMO localization is provided, which can be used to meet the requirements of 5G, by exploiting different spatial signatures of users.
Journal ArticleDOI
Sparse Arrays and Sampling for Interference Mitigation and DOA Estimation in GNSS
TL;DR: It is shown that both jammer direction of arrival estimation methods and mitigation techniques benefit from the design flexibility of sparse arrays and their extended virtual apertures or coarrays, enabling its effective sensing and excision in antijam GNSS.
Journal ArticleDOI
A Frame Construction and a Universal Distortion Bound for Sparse Representations
Mehmet Akcakaya,Vahid Tarokh +1 more
TL;DR: A lower bound is established on the tradeoff between the sparsity of the representation, the underlying distortion and the redundancy of any given frame in a complex vector space of dimension N.
Journal ArticleDOI
Sparsity-Driven Micro-Doppler Feature Extraction for Dynamic Hand Gesture Recognition
TL;DR: A sparsity-driven method of micro-Doppler analysis is proposed for dynamic hand gesture recognition with radar sensors that outperforms the approaches based on principal component analysis and deep convolutional neural network with small training dataset.
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.