Highly sparse representations from dictionaries are unique and independent of the sparseness measure
From MaRDI portal
Publication:877577
DOI10.1016/J.ACHA.2006.09.003zbMATH Open1133.94011OpenAlexW2019741018MaRDI QIDQ877577FDOQ877577
Authors: Rémi Gribonval, Morten Nielsen 
Publication date: 3 May 2007
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2006.09.003
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
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17)
Cites Work
- Ten Lectures on Wavelets
- Title not available (Why is that?)
- Matching pursuits with time-frequency dictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Affine systems in \(L_ 2(\mathbb{R}^d)\): The analysis of the analysis operator
- Foundations of time-frequency analysis
- Compactly supported tight and sibling frames with maximum vanishing moments
- Localized frames are finite unions of Riesz sequences
- Framelets: MRA-based constructions of wavelet frames
- Title not available (Why is that?)
- On Sparse Representations in Arbitrary Redundant Bases
- Greed is Good: Algorithmic Results for Sparse Approximation
- Title not available (Why is that?)
- Embeddings of some classical Banach spaces into modulation spaces
- Uncertainty principles and ideal atomic decomposition
- Title not available (Why is that?)
- Affine systems in \(L_2(\mathbb{R}^d)\). II: Dual systems
- Grassmannian frames with applications to coding and communication
- Sparse representations in unions of bases
- Compression of Wavelet Decompositions
- Title not available (Why is that?)
- Localization of frames, Banach frames, and the invertibility of the frame operator
- Blind source separation by sparse decomposition in a signal dictionary
- Title not available (Why is that?)
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- Nonlinear approximation with dictionaries. I: Direct estimates
- A generalized uncertainty principle and sparse representation in pairs of bases
- On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
- Title not available (Why is that?)
- Nonlinear approximation with local Fourier bases
- On sparse representation in pairs of bases
- A simple test to check the optimality of a sparse signal approximation
- Hybrid representations for audiophonic signal encoding
Cited In (37)
- 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
- Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise
- Recovery of sparsest signals via \(\ell^q \)-minimization
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Sparsest representations and approximations of an underdetermined linear system
- Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure
- A simple test to check the optimality of a sparse signal approximation
- Sparse recovery by non-convex optimization - instance optimality
- A review on the adaptive-ridge algorithm with several extensions
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- On higher order isotropy conditions and lower bounds for sparse quadratic forms
- Perturbations of measurement matrices and dictionaries in compressed sensing
- Sparse representations are most likely to be the sparsest possible
- An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
- Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\)
- On some deterministic dictionaries supporting sparsity
- Iterative reweighted noninteger norm regularizing SVM for gene expression data classification
- Beyond coherence: Recovering structured time-frequency representations
- Real versus complex null space properties for sparse vector recovery
- Weighted and controlled frames: mutual relationship and first numerical properties
- On the conditioning of random subdictionaries
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- Estimation of q for $\ell _{q}$-minimization in signal recovery with tight frame
- The null space property for sparse recovery from multiple measurement vectors
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Iteratively reweighted least squares minimization for sparse recovery
- On sparse recovery algorithms in unions of orthonormal bases
- Sparse representations in unions of bases
- Linear convergence of iterative soft-thresholding
- Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere
- The sparsest solution of the union of finite polytopes via its nonconvex relaxation
- Discrete uncertainty principles and sparse signal processing
- Sparse decomposition by iterating Lipschitzian-type mappings
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
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)
