Uniform approximation property of frames with applications to erasure recovery
The authors consider frames in finite-dimensional Hilbert spaces. The paper studies frame representations, where only one coefficient is erased (e.g., lost). They introduce the notion of frames with the uniform approximation property (UAP): a frame is said to have the \(r\)-UAP if it has a dual frame that minimizes a reconstruction error uniformly, where the erased coefficient is replaced, not by zero as is often done, but by an inner product of the signal and certain orthogonal projections onto subspaces spanned by any \(r\) frame vectors. The main result, Theorem 2.2, characterizes the UAP.
- Frames of uniform subframe bounds with applications to erasures
- Spectrally two-uniform frames for erasures
- Equal-norm tight frames with erasures
- Preserving the reconstruction property of frames from frame coefficients with erasures
- SYMMETRIC INTERPOLATORY FRAMELETS AND THEIR ERASURE RECOVERY PROPERTIES
- Construction of robust frames in erasure recovery
- A new probabilistic model for optimal frames in erasure's recovery
- Stable recovery of signals from frame coefficients with erasures at unknown locations
- Perturbation and construction of almost self‐located robust frames with applications to erasure recovery
- Stability bounds for reconstruction from sampling erasures
- An introduction to frames and Riesz bases
- Complex equiangular tight frames and erasures
- Equal-norm tight frames with erasures
- Equiangular tight frames from complex Seidel matrices containing cube roots of unity
- Equiangular tight frames that contain regular simplices
- Equiangular tight frames with centroidal symmetry
- Erasure recovery matrices for encoder protection
- Frames of uniform subframe bounds with applications to erasures
- Frames, graphs and erasures
- Linearly connected sequences and spectrally optimal dual frames for erasures
- Optimal dual frames and frame completions for majorization
- Optimal Dual Frames for Communication Coding With Probabilistic Erasures
- Optimal dual frames for erasures
- Optimal dual frames for erasures. II
- Optimal dual fusion frames for probabilistic erasures
- Optimal frames for erasures.
- Optimal linear transmission by loss-insensitive packet encoding
- Random matrices and erasure robust frames
- Reconstruction of Signals From Frame Coefficients With Erasures at Unknown Locations
- Recovery of signals from unordered partial frame coefficients
- Robustness properties of dimensionality reduction with Gaussian random matrices
- Signal reconstruction from frame and sampling erasures
- Stable phase retrieval with low-redundancy frames
- Ten Lectures on Wavelets
- The road to deterministic matrices with the restricted isometry property
- Frames of uniform subframe bounds with applications to erasures
- Construction of robust frames in erasure recovery
- A new probabilistic model for optimal frames in erasure's recovery
- Preserving the reconstruction property of frames from frame coefficients with erasures
- Perturbation and construction of almost self‐located robust frames with applications to erasure recovery
This page was built for publication: Uniform approximation property of frames with applications to erasure recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669240)
