Uncertainty principles and ideal atomic decomposition

DOI10.1109/18.959265zbMATH Open1019.94503OpenAlexW2099641086MaRDI QIDQ4544728FDOQ4544728

Authors: David Donoho, Xiaoming Huo 

Publication date: 4 August 2002

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

Full work available at URL: https://semanticscholar.org/paper/19af5d27fecb65b2365ae32a663025eccc688c48

Recommendations

• Quantitative robust uncertainty principles and optimally sparse decompositions
• Uncertainty Principles and Signal Recovery
• A generalized uncertainty principle and sparse representation in pairs of bases
• Atomic Decomposition by Basis Pursuit
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization

zbMATH Keywords

combinatorial optimizationconvex optimizationuncertainty principleharmonic analysiswavelet analysismatching pursuitbasis pursuitdiscrete-time signalovercomplete representationridgelet analysisLogan's phenomenonerror-correcting encryptionhighly sparse representationmultiple-basis signal representation

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Data encryption (aspects in computer science) (68P25)

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

• Compressive Sensing
• Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
• Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
• Orthogonal one step greedy procedure for heteroscedastic linear models
• Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
• Feature selection when there are many influential features
• Sharp recovery bounds for convex demixing, with applications
• On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
• Covariate assisted screening and estimation
• Quantitative robust uncertainty principles and optimally sparse decompositions
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• Sparse representations and approximation theory
• Computing and analyzing recoverable supports for sparse reconstruction
• A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
• A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
• Ways to sparse representation: An overview
• Sparse recovery by non-convex optimization - instance optimality
• Sparse recovery under weak moment assumptions
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Regularity properties for sparse regression
• Fast Sparse Representation Based on Smoothed ℓ0 Norm
• Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
• Phase transition in limiting distributions of coherence of high-dimensional random matrices
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
• Symmetric tensor decomposition
• Testing the nullspace property using semidefinite programming
• Theory and applications of compressed sensing
• Bayesian factor-adjusted sparse regression
• A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
• Sparse solutions of a class of constrained optimization problems
• A new perspective on least squares under convex constraint
• Matrix-free interior point method for compressed sensing problems
• A numerical exploration of compressed sampling recovery
• Phase retrieval for sparse signals
• Compressed sensing from a harmonic analysis point of view
• On uncertainty principles in the finite dimensional setting
• Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy
• Deterministic convolutional compressed sensing matrices
• A Practical Randomized CP Tensor Decomposition
• Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
• Microlocal analysis of the geometric separation problem
• On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
• Randomized first order algorithms with applications to \(\ell _{1}\)-minimization
• Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
• A direct approach for sparse quadratic discriminant analysis
• A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization
• Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing
• Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
• Analysis of inpainting via clustered sparsity and microlocal analysis
• On the conditioning of random subdictionaries
• An asymptotic existence result on compressed sensing matrices
• Sparse dual frames and dual Gabor functions of minimal time and frequency supports
• A survey of uncertainty principles and some signal processing applications
• Sure Independence Screening for Ultrahigh Dimensional Feature Space
• The asymptotic distribution and Berry-Esseen bound of a new test for independence in high dimension with an application to stochastic optimization
• Best subset selection via a modern optimization lens
• Bayesian signal detection with compressed measurements
• New classes of matrix decompositions
• Null space conditions and thresholds for rank minimization
• Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization
• A new nonlinear sparse component analysis for a biologically plausible model of neurons
• Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
• Uncertainty Principles and Signal Recovery
• Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
• Rates of contraction of posterior distributions based on \(p\)-exponential priors
• Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticism
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Solving basis pursuit: heuristic optimality check and solver comparison
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
• Support union recovery in high-dimensional multivariate regression
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• Sparse linear regression from perturbed data
• Estimating the dimension of a model
• Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
• Basis pursuit for frequency-domain identification
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
• A sharp RIP condition for orthogonal matching pursuit
• Breaking the coherence barrier: a new theory for compressed sensing
• Rejoinder: One-step sparse estimates in nonconcave penalized likelihood models
• A new computational method for the sparsest solutions to systems of linear equations
• The entries of Haar-invariant matrices from the Classical compact groups
• Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
• The uncertainty principle: Variations on a theme
• Sparse regression: scalable algorithms and empirical performance
• Necessary and sufficient conditions for the asymptotic distributions of coherence of ultra-high dimensional random matrices
• Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise
• Robust estimation for an inverse problem arising in multiview geometry
• Sparse approximate solution of partial differential equations
• Learning semidefinite regularizers
• On sparse representation of analytic signal in Hardy space
• Geometric separation by single-pass alternating thresholding
• Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
• Approximation of frame based missing data recovery
• Signal recovery under cumulative coherence
• Debiasing the Lasso: optimal sample size for Gaussian designs
• Nonparametric denoising of signals of unknown local structure. II: Nonparametric function recovery

This page was built for publication: Uncertainty principles and ideal atomic decomposition

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