Highly sparse representations from dictionaries are unique and independent of the sparseness measure
From MaRDI portal
(Redirected from Publication:877577)
Recommendations
- Sparse representations in unions of bases
- Sparse representations are most likely to be the sparsest possible
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- On Sparse Representations in Arbitrary Redundant Bases
- On the conditioning of random subdictionaries
Cites work
- scientific article; zbMATH DE number 3870002 (Why is no real title available?)
- scientific article; zbMATH DE number 192914 (Why is no real title available?)
- scientific article; zbMATH DE number 3536702 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 477682 (Why is no real title available?)
- scientific article; zbMATH DE number 2079345 (Why is no real title available?)
- scientific article; zbMATH DE number 1764634 (Why is no real title available?)
- scientific article; zbMATH DE number 1380579 (Why is no real title available?)
- A generalized uncertainty principle and sparse representation in pairs of bases
- A simple test to check the optimality of a sparse signal approximation
- Affine systems in \(L_ 2(\mathbb{R}^d)\): The analysis of the analysis operator
- Affine systems in \(L_2(\mathbb{R}^d)\). II: Dual systems
- Blind source separation by sparse decomposition in a signal dictionary
- Compactly supported tight and sibling frames with maximum vanishing moments
- Compression of Wavelet Decompositions
- Embeddings of some classical Banach spaces into modulation spaces
- Foundations of time-frequency analysis
- Framelets: MRA-based constructions of wavelet frames
- Grassmannian frames with applications to coding and communication
- Greed is Good: Algorithmic Results for Sparse Approximation
- Hybrid representations for audiophonic signal encoding
- Localization of frames, Banach frames, and the invertibility of the frame operator
- Localized frames are finite unions of Riesz sequences
- Matching pursuits with time-frequency dictionaries
- Nonlinear approximation with dictionaries. I: Direct estimates
- Nonlinear approximation with local Fourier bases
- On Sparse Representations in Arbitrary Redundant Bases
- On sparse representation in pairs of bases
- On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Sparse representations in unions of bases
- Ten Lectures on Wavelets
- Uncertainty principles and ideal atomic decomposition
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
Cited in
(37)- Recovery of sparsest signals via \(\ell^q \)-minimization
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\)
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Iterative reweighted noninteger norm regularizing SVM for gene expression data classification
- On the conditioning of random subdictionaries
- A simple test to check the optimality of a sparse signal approximation
- Weighted and controlled frames: mutual relationship and first numerical properties
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Linear convergence of iterative soft-thresholding
- Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Estimation of q for $\ell _{q}$-minimization in signal recovery with tight frame
- Real versus complex null space properties for sparse vector recovery
- Beyond coherence: Recovering structured time-frequency representations
- A review on the adaptive-ridge algorithm with several extensions
- On some deterministic dictionaries supporting sparsity
- An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
- The null space property for sparse recovery from multiple measurement vectors
- Perturbations of measurement matrices and dictionaries in compressed sensing
- Iteratively reweighted least squares minimization for sparse recovery
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing
- Discrete uncertainty principles and sparse signal processing
- Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
- Sparse representations are most likely to be the sparsest possible
- Sparsest representations and approximations of an underdetermined linear system
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- Sparse decomposition by iterating Lipschitzian-type mappings
- On higher order isotropy conditions and lower bounds for sparse quadratic forms
- Sparse recovery by non-convex optimization - instance optimality
- Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure
- The sparsest solution of the union of finite polytopes via its nonconvex relaxation
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- On sparse recovery algorithms in unions of orthonormal bases
- Sparse representations in unions of bases
- Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise
This page was built for publication: Highly sparse representations from dictionaries are unique and independent of the sparseness measure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877577)
