Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis
From MaRDI portal
Publication:4686244
Recommendations
Cites work
- A general construction of barycentric coordinates over convex polygons
- A generalization of Gram-Schmidt orthogonalization generating all Parseval frames
- Atomic decomposition by basis pursuit
- Compressed sensing
- Compressive sensing and structured random matrices
- Decoding by Linear Programming
- Equal-norm tight frames with erasures
- Finite normalized tight frames
- Frames, graphs and erasures
- Full spark frames
- Minimizing fusion frame potential
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Optimal Dual Frames for Communication Coding With Probabilistic Erasures
- Optimal dual frames for erasures
- Optimal dual frames for erasures. II
- Optimal frames for erasures.
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Quantized frame expansions with erasures
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Second-order sigma-delta (\(\Sigma \Delta\)) quantization of finite frame expansions
- Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
- Sparse Approximate Solutions to Linear Systems
- Sparsity and incoherence in compressive sampling
- Stable signal recovery from incomplete and inaccurate measurements
- The condition of Vandermonde-like matrices involving orthogonal polynomials
- Tight frame approximation for multi-frames and super-frames
This page was built for publication: Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4686244)