On Sparse Representations in Arbitrary Redundant Bases
From MaRDI portal
Recommendations
- Sparse representations in unions of bases
- On sparse representation in pairs of bases
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse representations and approximation theory
- On Sparse Representation in Fourier and Local Bases
- An Open Problem on Sparse Representations in Unions of Bases
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- Sparse representation of vectors in lattices and semigroups
Cited in
(only showing first 100 items - show all)- On the stability of the basis pursuit in the presence of noise
- Multiple sparse measurement gradient reconstruction algorithm for DOA estimation in compressed sensing
- On the uniqueness of the sparse signals reconstruction based on the missing samples variation analysis
- A hierarchical framework for recovery in compressive sensing
- Strengthening hash families and compressive sensing
- IDENT: identifying differential equations with numerical time evolution
- Existence and uniqueness of solutions to the norm minimum problem on digraphs
- A linear system output transformation for sparse approximation
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- A smoothing method for sparse optimization over convex sets
- Sparse linear regression from perturbed data
- A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al.
- An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- A numerical exploration of compressed sampling recovery
- Probability of unique integer solution to a system of linear equations
- Risk bound of transfer learning using parametric feature mapping and its application to sparse coding
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
- A fast \(\ell_1\)-solver and its applications to robust face recognition
- One condition for solution uniqueness and robustness of both _1-synthesis and _1-analysis minimizations
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
- Learning and estimation applications of an online homotopy algorithm for a generalization of the LASSO
- Necessary and sufficient conditions for the asymptotic distributions of coherence of ultra-high dimensional random matrices
- Consistency of \(\ell_1\) recovery from noisy deterministic measurements
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- A bilinear algorithm for sparse representations
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- When does OMP achieve exact recovery with continuous dictionaries?
- Convex optimization in sums of Banach spaces
- Quadratic growth conditions and uniqueness of optimal solution to Lasso
- Computing and analyzing recoverable supports for sparse reconstruction
- Randomized pick-freeze for sparse Sobol indices estimation in high dimension
- Compressive Sensing
- Low complexity regularization of linear inverse problems
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
- Musical audio analysis using sparse representations
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- Cosparsity in Compressed Sensing
- Stable recovery of sparse overcomplete representations in the presence of noise
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Sparse representations in unions of bases
- On Polar Polytopes and the Recovery of Sparse Representations
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Simple bounds for recovering low-complexity models
- Remote sensing via _1-minimization
- Phase transition in limiting distributions of coherence of high-dimensional random matrices
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
- Sensitivity analysis for mirror-stratifiable convex functions
- Local identifiability of \(\ell_1\)-minimization dictionary learning: a sufficient and almost necessary condition
- Model selection with low complexity priors
- A generalized uncertainty principle and sparse representation in pairs of bases
- On sparse representation in pairs of bases
- Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- A Barzilai-Borwein type method for minimizing composite functions
- Unique sharp local minimum in \(\ell_1\)-minimization complete dictionary learning
- Submatrices with nonuniformly selected random supports and insights into sparse approximation
- Convergence rates for the joint solution of inverse problems with compressed sensing data
- Model Selection With Lasso-Zero: Adding Straw to the Haystack to Better Find Needles
- Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained _1 minimization
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
- Robust recovery of signals with partially known support information using weighted BPDN
- Dual extrapolation for sparse GLMs
- Adaptive rates for total variation image denoising
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
- Sparse system identification in pairs of pulse and Takenaka-Malmquist bases
- A new computational method for the sparsest solutions to systems of linear equations
- Solving basis pursuit: heuristic optimality check and solver comparison
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- Sparsity-assisted signal smoothing
- Sparse spikes super-resolution on thin grids II: the continuous basis pursuit
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Sparse approximation using new greedy-like bases in superreflexive spaces
- Sampling rates for ^1-synthesis
- LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing
- Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals
- Representation recovery via L₁-norm minimization with corrupted data
- Sparse representations and approximation theory
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
- Identifying the source term in the potential equation with weighted sparsity regularization
- Exact recovery of the support of piecewise constant images via total variation regularization
- A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
- Box Constraints and Weighted Sparsity Regularization for Identifying Sources in Elliptic PDEs
- Weighting operators for sparsity regularization
- A dynamic working set method for compressed sensing
- Pattern recovery by SLOPE
- Hyper-pyramid-adapted shearlet transform with application to compressive level set estimation
- Super-resolved Lasso
- Spectral dynamics and regularization of incompletely and irregularly measured data
This page was built for publication: On Sparse Representations in Arbitrary Redundant Bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546508)
