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)- Novel harmonic regularization approach for variable selection in Cox's proportional hazards model
- Sparse solutions to underdetermined Kronecker product systems
- Uniqueness conditions for a class of \(\ell_{0}\)-minimization problems
- Compressed sensing for finite-valued signals
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- Phase retrieval of complex and vector-valued functions
- On the X-rank with respect to linear projections of projective varieties
- When do stepwise algorithms meet subset selection criteria?
- On a combinatorial framework for fault characterization
- Robust multi-image processing with optimal sparse regularization
- Regularized sparse representation for image deconvolution
- Wavelet Scattering Regression of Quantum Chemical Energies
- Approximation of frame based missing data recovery
- Robust estimation for an inverse problem arising in multiview geometry
- Book Review: A mathematical introduction to compressive sensing
- The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization
- Sparse regression: scalable algorithms and empirical performance
- Measurement matrix design for CS-MIMO radar using multi-objective optimization
- The entries of Haar-invariant matrices from the Classical compact groups
- Debiasing the Lasso: optimal sample size for Gaussian designs
- Analysis of basis pursuit via capacity sets
- A hybrid scheme for encoding audio signal using hidden Markov models of waveforms
- Sparse recovery via differential inclusions
- Minimization of \(L_1\) over \(L_2\) for sparse signal recovery with convergence guarantee
- Signal recovery under cumulative coherence
- Signal recovery under mutual incoherence property and oracle inequalities
- Discrete uncertainty principles and sparse signal processing
- Analysis of convergence for the alternating direction method applied to joint sparse recovery
- Stability of the elastic net estimator
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- 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
- Two new lower bounds for the spark of a matrix
- Sparse approximate solution of partial differential equations
- Sign function based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian noise environments
- Learning semidefinite regularizers
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- Low complexity regularization of linear inverse problems
- Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging
- On sparse representation of analytic signal in Hardy space
- Stable recovery of analysis based approaches
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
- Necessary and sufficient conditions for the asymptotic distributions of coherence of ultra-high dimensional random matrices
- Improved stability conditions of BOGA for noisy block-sparse signals
- Geometric separation by single-pass alternating thresholding
- The uncertainty principle: Variations on a theme
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise
- 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
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)
