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)

• 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
• Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
• A hierarchical framework for recovery in compressive sensing
• A smoothing method for sparse optimization over convex sets
• Strengthening hash families and compressive sensing
• Frames as codes
• A new bound on the block restricted isometry constant in compressed sensing
• Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing
• Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
• Recovery of signals under the condition on RIC and ROC via prior support information
• 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

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)