Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

DOI10.1109/TIT.2006.885507zbMATH Open1309.94033arXivmath/0410542OpenAlexW2129638195WikidataQ56813489 ScholiaQ56813489MaRDI QIDQ3548002FDOQ3548002

Authors: Emmanuel J. Candès, Terence Tao 

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Suppose we are given a vector $f$ in $R^N$. How many linear measurements do we need to make about $f$ to be able to recover $f$ to within precision $epsilon$ in the Euclidean ($el{l}_2$) metric? Or more exactly, suppose we are interested in a class $calF$ of such objects--discrete digital signals, images, etc; how many linear measurements do we need to recover objects from this class to within accuracy $epsilon$? This paper shows that if the objects of interest are sparse or compressible in the sense that the reordered entries of a signal $fincalF$ decay like a power-law (or if the coefficient sequence of $f$ in a fixed basis decays like a power-law), then it is possible to reconstruct $f$ to within very high accuracy from a small number of random measurements.

Full work available at URL: https://arxiv.org/abs/math/0410542

Recommendations

• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• On sparse reconstruction from Fourier and Gaussian measurements
• Decoding by Linear Programming
• Sparsity and incoherence in compressive sampling

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29)

Cited In (only showing first 100 items - show all)

• A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery
• Approximation with random bases: pro et contra
• Sparse identification of posynomial models
• The numerics of phase retrieval
• Spectral dynamics and regularization of incompletely and irregularly measured data
• Collaborative block compressed sensing reconstruction with dual-domain sparse representation
• Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing
• Data science, big data and statistics
• Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise
• Reconstruction and subgaussian processes
• On sparse representation of analytic signal in Hardy space
• Wavelet denoising via sparse representation
• Approximation of frame based missing data recovery
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• Cross validation in Lasso and its acceleration
• Self-calibration and biconvex compressive sensing
• Slope meets Lasso: improved oracle bounds and optimality
• Low complexity regularization of linear inverse problems
• Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness
• Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
• Estimation of block sparsity in compressive sensing
• Reconstruction of systems with impulses and delays from time series data
• Randomized interpolative decomposition of separated representations
• Construction of a full row-rank matrix system for multiple scanning directions in discrete tomography
• A fast recovery method of 2D geometric compressed sensing signal
• Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference
• DFT spectrum-sparsity-based quasi-periodic signal identification and application
• Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction
• Analysis of sparse MIMO radar
• Rapid compressed sensing reconstruction: a semi-tensor product approach
• Analog random coding
• Effect of sensing matrices on quality index parameters for block sparse bayesian learning-based EEG compressive sensing
• Large deviations, dynamics and phase transitions in large stochastic and disordered neural networks
• On support sizes of restricted isometry constants
• An efficient privacy-preserving compressive data gathering scheme in WSNs
• A new sparse recovery method for the inverse acoustic scattering problem
• Preserving injectivity under subgaussian mappings and its application to compressed sensing
• Idempotents and compressive sampling
• Intrinsic modeling of stochastic dynamical systems using empirical geometry
• Signal recovery under mutual incoherence property and oracle inequalities
• A simple and feasible method for a class of large-scale \(l^1\)-problems
• Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification
• CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
• Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
• A simple Gaussian measurement bound for exact recovery of block-sparse signals
• Improved bounds for sparse recovery from subsampled random convolutions
• Sparse representation of signals in Hardy space
• Compressive sensing with redundant dictionaries and structured measurements
• Discrete uncertainty principles and sparse signal processing
• Cirrhosis classification based on texture classification of random features
• Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
• Structured random measurements in signal processing
• A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
• Compressive sensing based machine learning strategy for characterizing the flow around a cylinder with limited pressure measurements
• Remote sensing via \(\ell_1\)-minimization
• \(\mathrm{L_1RIP}\)-based robust compressed sensing
• Nonconvex compressed sampling of natural images and applications to compressed MR imaging
• Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
• On the linear independence of spikes and sines
• A dual split Bregman method for fast \(\ell ^{1}\) minimization
• An improved fast iterative shrinkage thresholding algorithm for image deblurring
• RIPless compressed sensing from anisotropic measurements
• Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction
• Approximation error in regularized SVD-based Fourier continuations
• Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery
• Adaptive data analysis via sparse time-frequency representation
• Two are better than one: fundamental parameters of frame coherence
• A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
• A box constrained gradient projection algorithm for compressed sensing
• Compressed sensing image restoration based on data-driven multi-scale tight frame
• Conjugate gradient acceleration of iteratively re-weighted least squares methods
• Compressed sensing and dynamic mode decomposition
• Off-grid DOA estimation via real-valued sparse Bayesian method in compressed sensing
• An adaptive inverse scale space method for compressed sensing
• Compressed sensing from a harmonic analysis point of view
• On uncertainty principles in the finite dimensional setting
• Compressed sensing with coherent and redundant dictionaries
• Deterministic convolutional compressed sensing matrices
• Effective band-limited extrapolation relying on Slepian series and \(\ell^1\) regularization
• Restricted isometries for partial random circulant matrices
• Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
• Optimal non-linear models for sparsity and sampling
• Combinatorial Algorithms for Compressed Sensing
• Two-dimensional digital filters with sparse coefficients
• Simple bounds for recovering low-complexity models
• Accelerated projected gradient method for linear inverse problems with sparsity constraints
• Random sampling of sparse trigonometric polynomials
• Empirical processes with a bounded \(\psi_1\) diameter
• Interpolation via weighted \(\ell_{1}\) minimization
• On the conditioning of random subdictionaries
• Ensemble extreme learning machine and sparse representation classification
• A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
• Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Low rank matrix recovery from rank one measurements
• Recovery of low-rank matrices based on the rank null space properties
• Compressive wave computation
• A dynamically bi-orthogonal method for time-dependent stochastic partial differential equations. II: Adaptivity and generalizations
• Quasi-linear compressed sensing
• Multiscale stochastic preconditioners in non-intrusive spectral projection

This page was built for publication: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548002)