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
• Recovering network topologies via Taylor expansion and compressive sensing
• Title not available (Why is that?)
• High-dimensional inference: confidence intervals, \(p\)-values and R-software \texttt{hdi}
• Sparsity and incoherence in compressive sampling
• A statistical mechanics approach to de-biasing and uncertainty estimation in Lasso for random measurements
• Sparse Legendre expansions via \(\ell_1\)-minimization
• On error correction with errors in both the channel and syndrome
• Strong convergence of a modified proximal algorithm for solving the lasso
• An implementable proximal point algorithmic framework for nuclear norm minimization
• Restricted normal cones and sparsity optimization with affine constraints
• The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
• An efficient augmented Lagrangian method with applications to total variation minimization
• Dimensionality reduction with subgaussian matrices: a unified theory
• Solution of the problem on image reconstruction in computed tomography
• A note on the complexity of \(L _{p }\) minimization
• Compressive sensing-based topology identification of multilayer networks
• Properties and iterative methods for the lasso and its variants
• A significance test for the lasso
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Sparse recovery by non-convex optimization - instance optimality
• Guarantees of total variation minimization for signal recovery
• Super-resolution of point sources via convex programming
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• Sparse recovery under weak moment assumptions
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Random projections of smooth manifolds
• Compressive sensing with local geometric features
• A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing
• Fast Phase Retrieval from Local Correlation Measurements
• Discussion: ``A significance test for the lasso
• Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
• Gaussian approximations in high dimensional estimation
• Total variation wavelet inpainting
• Testing the nullspace property using semidefinite programming
• The weighted majority algorithm
• Derandomizing restricted isometries via the Legendre symbol
• Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games
• Exact matrix completion via convex optimization
• Compressed sensing and best \(k\)-term approximation
• The residual method for regularizing ill-posed problems
• Exact reconstruction using Beurling minimal extrapolation
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Uniform uncertainty principle for Bernoulli and subgaussian ensembles
• A model of regularization parameter determination in low-dose X-ray CT reconstruction based on dictionary learning
• An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
• Proximity algorithms for the L1/TV image denoising model
• Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
• Explicit constructions of RIP matrices and related problems

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)