Highly sparse representations from dictionaries are unique and independent of the sparseness measure

DOI10.1016/j.acha.2006.09.003zbMath1133.94011OpenAlexW2019741018MaRDI QIDQ877577

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

zbMATH Keywords

Banach spacemeasuresignalsnon-convex

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17)

Related Items

WEIGHTED AND CONTROLLED FRAMES: MUTUAL RELATIONSHIP AND FIRST NUMERICAL PROPERTIES, Sparsest representations and approximations of an underdetermined linear system, The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\), Recovery of sparsest signals via \(\ell^q \)-minimization, On sparse recovery algorithms in unions of orthonormal bases, Perturbations of measurement matrices and dictionaries in compressed sensing, A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations, Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise, On higher order isotropy conditions and lower bounds for sparse quadratic forms, Discrete uncertainty principles and sparse signal processing, Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure, On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing, Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing, Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms, Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\), Beyond coherence: Recovering structured time-frequency representations, Sparse decomposition by iterating Lipschitzian-type mappings, An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices, The null space property for sparse recovery from multiple measurement vectors, Iterative reweighted noninteger norm regularizing SVM for gene expression data classification, Sparse recovery by non-convex optimization - instance optimality, Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\), Real versus complex null space properties for sparse vector recovery, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, Linear convergence of iterative soft-thresholding, Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\), The sparsest solution of the union of finite polytopes via its nonconvex relaxation, Iteratively reweighted least squares minimization for sparse recovery

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Grassmannian frames with applications to coding and communication
• Nonlinear approximation with local Fourier bases
• Foundations of time-frequency analysis
• Hybrid representations for audiophonic signal encoding
• 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
• Localization of frames, Banach frames, and the invertibility of the frame operator
• Nonlinear approximation with dictionaries. I: Direct estimates
• Blind Source Separation by Sparse Decomposition in a Signal Dictionary
• On Sparse Representations in Arbitrary Redundant Bases
• Sparse representations in unions of bases
• On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
• Greed is Good: Algorithmic Results for Sparse Approximation
• Ten Lectures on Wavelets
• Compression of Wavelet Decompositions
• Z₄ -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
• Embeddings of some classical Banach spaces into modulation spaces
• Uncertainty principles and ideal atomic decomposition
• A generalized uncertainty principle and sparse representation in pairs of bases
• On sparse representation in pairs of bases
• Matching pursuits with time-frequency dictionaries
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization