Uncertainty principles and ideal atomic decomposition
From MaRDI portal
Publication:4544728
combinatorial optimizationconvex optimizationuncertainty principleharmonic analysiswavelet analysismatching pursuitbasis pursuitdiscrete-time signalovercomplete representationridgelet analysisLogan's phenomenonerror-correcting encryptionhighly sparse representationmultiple-basis signal representation
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 ℓ 1 minimization
Cited in
(only showing first 100 items - show all)- Sparse recovery under weak moment assumptions
- Theory and applications of compressed sensing
- Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticism
- A Practical Randomized CP Tensor Decomposition
- Sparse linear regression from perturbed data
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Compressive Sensing
- Computing and analyzing recoverable supports for sparse reconstruction
- The asymptotic distribution and Berry-Esseen bound of a new test for independence in high dimension with an application to stochastic optimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- On the conditioning of random subdictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Matrix-free interior point method for compressed sensing problems
- Null space conditions and thresholds for rank minimization
- A new computational method for the sparsest solutions to systems of linear equations
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Estimating the dimension of a model
- Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization
- A sharp RIP condition for orthogonal matching pursuit
- Regularity properties for sparse regression
- Sure independence screening for ultrahigh dimensional feature space. With discussion and authors' reply
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- Compressed sensing from a harmonic analysis point of view
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Sparse representations and approximation theory
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- 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
- Phase transition in limiting distributions of coherence of high-dimensional random matrices
- Bayesian factor-adjusted sparse regression
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
- Covariate assisted screening and estimation
- Uncertainty Principles and Signal Recovery
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Feature selection when there are many influential features
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- Best subset selection via a modern optimization lens
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Solving basis pursuit: heuristic optimality check and solver comparison
- Bayesian signal detection with compressed measurements
- New classes of matrix decompositions
- Sharp recovery bounds for convex demixing, with applications
- On uncertainty principles in the finite dimensional setting
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
- Microlocal analysis of the geometric separation problem
- A new nonlinear sparse component analysis for a biologically plausible model of neurons
- Rates of contraction of posterior distributions based on \(p\)-exponential priors
- Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
- Orthogonal one step greedy procedure for heteroscedastic linear models
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Symmetric tensor decomposition
- A numerical exploration of compressed sampling recovery
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- Support union recovery in high-dimensional multivariate regression
- Ways to sparse representation: An overview
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Phase retrieval for sparse signals
- An asymptotic existence result on compressed sensing matrices
- Deterministic convolutional compressed sensing matrices
- Testing the nullspace property using semidefinite programming
- Sparse recovery by non-convex optimization - instance optimality
- Sparse dual frames and dual Gabor functions of minimal time and frequency supports
- A survey of uncertainty principles and some signal processing applications
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Basis pursuit for frequency-domain identification
- Breaking the coherence barrier: a new theory for compressed sensing
- Analysis of inpainting via clustered sparsity and microlocal analysis
- Sparse solutions of a class of constrained optimization problems
- A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization
- Minimization of \(\ell_{1-2}\) for compressed sensing
- A direct approach for sparse quadratic discriminant analysis
- Rejoinder: One-step sparse estimates in nonconcave penalized likelihood models
- Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing
- A new perspective on least squares under convex constraint
- Typical \(l_1\)-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices
- Model selection with distributed SCAD penalty
- Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- A new bound on the block restricted isometry constant in compressed sensing
- Kernelized elastic net regularization: generalization bounds, and sparse recovery
- A performance guarantee for orthogonal matching pursuit using mutual coherence
- Sparse approximate reconstruction decomposed by two optimization problems
- A hierarchical framework for recovery in compressive sensing
- GMRES-accelerated ADMM for quadratic objectives
- Frames as codes
- On the sparsity of Lasso minimizers in sparse data recovery
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit
- An extended DEIM algorithm for subset selection and class identification
- Evaluating visual properties via robust HodgeRank
- Beyond coherence: Recovering structured time-frequency representations
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)
