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)

• 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
• Processing MUSE hyperspectral data: denoising, deconvolution and detection of astrophysical sources
• SZ and CMB reconstruction using generalized morphological component analysis
• Low complexity regularization of linear inverse problems
• When do stepwise algorithms meet subset selection criteria?
• Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
• Compressed sensing for finite-valued signals
• A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
• Robust multi-image processing with optimal sparse regularization
• The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization
• Analysis of basis pursuit via capacity sets
• Sparse recovery via differential inclusions
• Uniqueness conditions for a class of \(\ell_{0}\)-minimization problems
• A hybrid scheme for encoding audio signal using hidden Markov models of waveforms
• On the X-rank with respect to linear projections of projective varieties
• Stability of the elastic net estimator
• Book Review: A mathematical introduction to compressive sensing
• Regularized sparse representation for image deconvolution
• Wavelet Scattering Regression of Quantum Chemical Energies
• Sparse dual frames and dual Gabor functions of minimal time and frequency supports
• Improved stability conditions of BOGA for noisy block-sparse signals
• Novel harmonic regularization approach for variable selection in Cox's proportional hazards model
• Sparse solutions to underdetermined Kronecker product systems
• On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
• Measurement matrix design for CS-MIMO radar using multi-objective optimization
• Minimization of \(L_1\) over \(L_2\) for sparse signal recovery with convergence guarantee
• Fast thresholding algorithms with feedbacks for sparse signal recovery
• Signal recovery under mutual incoherence property and oracle inequalities
• Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging
• Two new lower bounds for the spark of a matrix
• On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
• Stable recovery of analysis based approaches
• Discrete uncertainty principles and sparse signal processing
• Analysis of convergence for the alternating direction method applied to joint sparse recovery
• On a combinatorial framework for fault characterization
• An iteratively approximated gradient projection algorithm for sparse signal reconstruction
• 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
• The fast Cauchy transform and faster robust linear regression
• 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

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)