Uncertainty principles and ideal atomic decomposition
From MaRDI portal
Publication:4544728
basis pursuitcombinatorial optimizationconvex optimizationdiscrete-time signalerror-correcting encryptionharmonic analysishighly sparse representationLogan's phenomenonmatching pursuitmultiple-basis signal representationovercomplete representationridgelet analysisuncertainty principlewavelet analysis
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 solutions to underdetermined Kronecker product systems
- Estimating the dimension of a model
- On a combinatorial framework for fault characterization
- Signal recovery under cumulative coherence
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
- A hierarchical framework for recovery in compressive sensing
- Recovery of signals under the condition on RIC and ROC via prior support information
- Signal recovery under mutual incoherence property and oracle inequalities
- Greedy subspace pursuit for joint sparse recovery
- Sign function based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian noise environments
- An overview on the applications of matrix theory in wireless communications and signal processing
- Learning semidefinite regularizers
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- Dictionary evaluation and optimization for sparse coding based speech processing
- A hybrid scheme for encoding audio signal using hidden Markov models of waveforms
- Incoherent dictionary learning method based on unit norm tight frame and manifold optimization for sparse representation
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Strengthening hash families and compressive sensing
- Robust estimation for an inverse problem arising in multiview geometry
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing
- Existence, uniqueness, and approximation solutions to linearized Chandrasekhar equation with sharp bounds
- Debiasing the Lasso: optimal sample size for Gaussian designs
- IDENT: identifying differential equations with numerical time evolution
- A performance guarantee for orthogonal matching pursuit using mutual coherence
- Sparse approximate reconstruction decomposed by two optimization problems
- A sharp RIP condition for orthogonal matching pursuit
- Rates of contraction of posterior distributions based on \(p\)-exponential priors
- An extended DEIM algorithm for subset selection and class identification
- Evaluating visual properties via robust HodgeRank
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- Optimal delocalization for generalized Wigner matrices
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- On the grouping effect of the \(l_{1-2}\) models
- Sparse recovery of sound fields using measurements from moving microphones
- Local recovery bounds for prior support constrained compressed sensing
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence
- Phase retrieval of complex and vector-valued functions
- Bayesian factor-adjusted sparse regression
- Adaptive multi-penalty regularization based on a generalized Lasso path
- A smoothing method for sparse optimization over convex sets
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Sparse linear regression from perturbed data
- Signal separation under coherent dictionaries and _p-bounded noise
- Sparse regression: scalable algorithms and empirical performance
- Analysis of inpainting via clustered sparsity and microlocal analysis
- An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Geometric separation by single-pass alternating thresholding
- Stable restoration and separation of approximately sparse signals
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Ways to sparse representation: An overview
- A numerical exploration of compressed sampling recovery
- On the differences between \(L_2\) boosting and the Lasso
- Novel harmonic regularization approach for variable selection in Cox's proportional hazards model
- Compressed sensing MR image reconstruction exploiting TGV and wavelet sparsity
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Alternating direction method of multipliers for solving dictionary learning models
- An asymptotic existence result on compressed sensing matrices
- Stable recovery of analysis based approaches
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- The asymptotic distribution and Berry-Esseen bound of a new test for independence in high dimension with an application to stochastic optimization
- A new bound on the block restricted isometry constant in compressed sensing
- Compressed sensing for finite-valued signals
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Support union recovery in high-dimensional multivariate regression
- Randomized first order algorithms with applications to \(\ell _{1}\)-minimization
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Necessary and sufficient conditions for the asymptotic distributions of coherence of ultra-high dimensional random matrices
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- On the uncertainty inequality as applied to discrete signals
- Beyond coherence: Recovering structured time-frequency representations
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Robust multi-image processing with optimal sparse regularization
- A wavelet-based hybrid approach to estimate variance function in heteroscedastic regression models
- Orthogonal one step greedy procedure for heteroscedastic linear models
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- A novel regularization based on the error function for sparse recovery
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- Computing and analyzing recoverable supports for sparse reconstruction
- On sparse recovery algorithms in unions of orthonormal bases
- Posterior information-based image measurement matrix optimization
- On the sparsity of Lasso minimizers in sparse data recovery
- Basis pursuit for frequency-domain identification
- Compressive Sensing
- Regularity properties for sparse regression
- Low complexity regularization of linear inverse problems
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- Best subset selection via a modern optimization lens
- Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization
- Theory and applications of compressed sensing
- On sparse representation of analytic signal in Hardy space
- Phase transitions in error correcting and compressed sensing by \(\ell _{1}\) linear programming
- Learning an adaptive dictionary using a projected gradient method and its application on image de-noising
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)
