Sparse representations and approximation theory

DOI10.1016/j.jat.2010.10.007zbMath1211.94015OpenAlexW2158260573MaRDI QIDQ630502

Allan Pinkus

Publication date: 17 March 2011

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2010.10.007

zbMATH Keywords

sparse representations\(\ell^m_1\)-approximation

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Computational methods for sparse matrices (65F50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation by other special function classes (41A30)

Related Items

On discrete \(\ell ^{1}\)-regularization, Letter to the editor: ``On exact recovery of sparse vectors from linear measurements, Kolmogorov \(n\)-widths of function classes induced by a non-degenerate differential operator: a convex duality approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
• The distance of a subspace of \(R^ m\) from its axes and n-widths of octahedra
• On the stability of the basis pursuit in the presence of noise
• Matrices and n-widths
• Approximationszahlen von Sobolev-Einbettungen
• Grassmannian frames with applications to coding and communication
• Deterministic constructions of compressed sensing matrices
• Reconstruction and subgaussian operators in asymptotic geometric analysis
• Equiangular lines
• The geometry of random \(\{-1,1\}\)-polytopes
• Dominating Subsets under Projections
• NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS
• On Sparse Representations in Arbitrary Redundant Bases
• Sparse representations in unions of bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Sparse and Redundant Representations
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
• Uncertainty principles and ideal atomic decomposition
• A generalized uncertainty principle and sparse representation in pairs of bases
• On sparse representation in pairs of bases
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution
• Approximation in the Metric of L 1 (X,μ)
• Orthogonality and Linear Functionals in Normed Linear Spaces