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)

• Compressed sensing of color images
• Discussion: ``A significance test for the lasso
• Discussion: ``A significance test for the lasso
• Discussion: ``A significance test for the lasso
• Discussion: ``A significance test for the lasso
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
• Learning semidefinite regularizers
• New analysis of manifold embeddings and signal recovery from compressive measurements
• Generalized sampling and infinite-dimensional compressed sensing
• Yang-Baxter equations in quantum information
• A least-squares method for sparse low rank approximation of multivariate functions
• Stochastic collocation algorithms using \(l_1\)-minimization for Bayesian solution of inverse problems
• On the generation of sampling schemes for magnetic resonance imaging
• Generalized Kalman smoothing: modeling and algorithms
• Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
• Sparsity enforcing edge detection method for blurred and noisy Fourier data
• Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling
• Sparse regression learning by aggregation and Langevin Monte-Carlo
• Fast and RIP-optimal transforms
• Near oracle performance and block analysis of signal space greedy methods
• Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
• 2D sparse signal recovery via 2D orthogonal matching pursuit
• Greedy-like algorithms for the cosparse analysis model
• Instance-optimality in probability with an \(\ell _1\)-minimization decoder
• Sparse system identification for stochastic systems with general observation sequences
• Compressed sensing by inverse scale space and curvelet thresholding
• Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions
• Nonlinear least squares in \(\mathbb R^{N}\)
• Improving the \( k\)-\textit{compressibility} of hyper reduced order models with moving sources: applications to welding and phase change problems
• Optimization methods for synthetic aperture radar imaging
• Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy
• Majorizing measures and proportional subsets of bounded orthonormal systems
• Title not available (Why is that?)
• Robust face recognition via block sparse Bayesian learning
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
• A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
• Sparse time-frequency representation of nonlinear and nonstationary data
• A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization
• Compressive optical deflectometric tomography: a constrained total-variation minimization approach
• Deterministic construction of sparse binary matrices via incremental integer optimization
• A convergent overlapping domain decomposition method for total variation minimization
• Log-concavity and strong log-concavity: a review
• Gaussian averages of interpolated bodies and applications to approximate reconstruction
• Compressed subspace matching on the continuum
• High-dimensional inference in misspecified linear models
• On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
• A Barzilai-Borwein type method for minimizing composite functions
• The null space property for sparse recovery from multiple measurement vectors
• Rank-based model selection for multiple ions quantum tomography
• Uniform recovery of fusion frame structured sparse signals
• Signature codes for noisy multiple access adder channel
• On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
• On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
• Sparse regularization for semi-supervised classification
• Dense fast random projections and Lean Walsh transforms
• Compressive imaging and characterization of sparse light deflection maps
• A modified greedy analysis pursuit algorithm for the cosparse analysis model
• Decomposable norm minimization with proximal-gradient homotopy algorithm
• Yang-Baxter equations and quantum entanglements
• Finding a low-rank basis in a matrix subspace
• Sparse decomposition by iterating Lipschitzian-type mappings
• Sparse signal recovery using a new class of random matrices
• Compressed history matching: Exploiting transform-domain sparsity for regularization of nonlinear dynamic data integration problems
• 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

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)