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
• Existence, uniqueness, and approximation solutions to linearized Chandrasekhar equation with sharp bounds
• Sparsity-promoting and edge-preserving maximum a posteriori estimators in non-parametric Bayesian inverse problems
• On the uncertainty inequality as applied to discrete signals
• Sparse recovery of sound fields using measurements from moving microphones
• Block-sparse recovery of semidefinite systems and generalized null space conditions
• Local recovery bounds for prior support constrained compressed sensing
• IDENT: identifying differential equations with numerical time evolution
• Greedy subspace pursuit for joint sparse recovery
• An overview on the applications of matrix theory in wireless communications and signal processing
• A performance guarantee for orthogonal matching pursuit using mutual coherence
• Sparse approximate reconstruction decomposed by two optimization problems
• On the grouping effect of the \(l_{1-2}\) models
• Kernelized elastic net regularization: generalization bounds, and sparse recovery
• Uncertainty principle corresponding to an orthonormal wavelet system
• Stability analysis of a class of sparse optimization problems
• Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
• Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
• Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
• Dictionary evaluation and optimization for sparse coding based speech processing
• Asymptotic theory of \(\ell_1\)-regularized PDE identification from a single noisy trajectory
• DC approximation approach for \(\ell_0\)-minimization in compressed sensing
• Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
• Alternating direction method of multipliers for solving dictionary learning models
• Unsupervised learning of compositional sparse code for natural image representation
• Stable restoration and separation of approximately sparse signals
• An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
• GMRES-accelerated ADMM for quadratic objectives
• Model selection with low complexity priors
• Iteratively reweighted least squares and slime mold dynamics: connection and convergence
• Phase retrieval of complex and vector-valued functions
• Beyond coherence: Recovering structured time-frequency representations
• Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets
• Sign function based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian noise environments
• A multiple measurement vector approach to synthetic aperture radar imaging
• A Scale-Invariant Approach for Sparse Signal Recovery
• Incoherent dictionary learning method based on unit norm tight frame and manifold optimization for sparse representation
• \(\ell_1-\alpha\ell_2\) minimization methods for signal and image reconstruction with impulsive noise removal
• Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles
• An extended DEIM algorithm for subset selection and class identification
• Evaluating visual properties via robust HodgeRank
• Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
• Typical \(l_1\)-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices
• Adaptive multi-penalty regularization based on a generalized Lasso path
• Model selection with distributed SCAD penalty
• Robust Identification of Differential Equations by Numerical Techniques from a Single Set of Noisy Observation
• Generalized regression estimators with high-dimensional covariates
• On the sparsity of Lasso minimizers in sparse data recovery
• Sparse signals recovery from noisy measurements by orthogonal matching pursuit
• Optimal delocalization for generalized Wigner matrices

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)