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)- A new computational method for the sparsest solutions to systems of linear equations
- Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
- The entries of Haar-invariant matrices from the Classical compact groups
- Orthogonal one step greedy procedure for heteroscedastic linear models
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Compressive Sensing
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- Existence, uniqueness, and approximation solutions to linearized Chandrasekhar equation with sharp bounds
- Extremal statistics of quadratic forms of GOE/GUE eigenvectors
- On the uncertainty inequality as applied to discrete signals
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- Sparsity-promoting and edge-preserving maximum a posteriori estimators in non-parametric Bayesian inverse problems
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Feature selection when there are many influential features
- Sharp recovery bounds for convex demixing, with applications
- The uncertainty principle: Variations on a theme
- Sparse recovery of sound fields using measurements from moving microphones
- Greedy approximate projection for magnetic resonance fingerprinting with partial volumes
- Covariate assisted screening and estimation
- Sparse regression: scalable algorithms and empirical performance
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Binary generalized orthogonal matching pursuit
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Learning an adaptive dictionary using a projected gradient method and its application on image de-noising
- Sure independence screening for ultrahigh dimensional feature space. With discussion and authors' reply
- 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
- 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
- Local recovery bounds for prior support constrained compressed sensing
- Computing and analyzing recoverable supports for sparse reconstruction
- Learning semidefinite regularizers
- Compressed sensing MR image reconstruction exploiting TGV and wavelet sparsity
- IDENT: identifying differential equations with numerical time evolution
- On sparse representation of analytic signal in Hardy space
- Greedy subspace pursuit for joint sparse recovery
- An overview on the applications of matrix theory in wireless communications and signal processing
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- A performance guarantee for orthogonal matching pursuit using mutual coherence
- Sparse approximate reconstruction decomposed by two optimization problems
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Sparse recovery by non-convex optimization - instance optimality
- Sparse recovery under weak moment assumptions
- Ways to sparse representation: An overview
- Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals
- Regularity properties for sparse regression
- Approximation of frame based missing data recovery
- On the grouping effect of the \(l_{1-2}\) models
- Geometric separation by single-pass alternating thresholding
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Signal recovery under cumulative coherence
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Kernelized elastic net regularization: generalization bounds, and sparse recovery
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- Phase transition in limiting distributions of coherence of high-dimensional random matrices
- Uncertainty principle corresponding to an orthonormal wavelet system
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- Stability analysis of a class of sparse optimization problems
- Locally sparse and robust partial least squares in scalar-on-function regression
- Cardinality minimization, constraints, and regularization: a survey
- Nonparametric denoising of signals of unknown local structure. II: Nonparametric function recovery
- Debiasing the Lasso: optimal sample size for Gaussian designs
- Processing MUSE hyperspectral data: denoising, deconvolution and detection of astrophysical sources
- SZ and CMB reconstruction using generalized morphological component analysis
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Symmetric tensor decomposition
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- Testing the nullspace property using semidefinite programming
- A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding
- Dictionary evaluation and optimization for sparse coding based speech processing
- Low complexity regularization of linear inverse problems
- Asymptotic theory of \(\ell_1\)-regularized PDE identification from a single noisy trajectory
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- A Compressed Sensing Framework for Monte Carlo Transport Simulations Using Random Disjoint Tallies
- When do stepwise algorithms meet subset selection criteria?
- Signal Decomposition Using Masked Proximal Operators
- Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
- Theory and applications of compressed sensing
- Bayesian factor-adjusted sparse regression
- Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
- Nonuniform recovery of fusion frame structured sparse signals
- On linguistic variables and sparse representations
- Compressed sensing for finite-valued signals
- Iteratively reweighted group Lasso based on log-composite regularization
- Alternating direction method of multipliers for solving dictionary learning models
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- Heuristics for Finding Sparse Solutions of Linear Inequalities
- 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
- Sparse solutions of a class of constrained optimization problems
- A new perspective on least squares under convex constraint
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)
