Optimally Sparse Frames
From MaRDI portal
Abstract: Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. However, when the signal dimension is large, the computation of the frame measurements of a signal typically requires a large number of additions and multiplications, and this makes a frame decomposition intractable in applications with limited computing budget. To address this problem, in this paper, we focus on frames in finite-dimensional Hilbert spaces and introduce sparsity for such frames as a new paradigm. In our terminology, a sparse frame is a frame whose elements have a sparse representation in an orthonormal basis, thereby enabling low-complexity frame decompositions. To introduce a precise meaning of optimality, we take the sum of the numbers of vectors needed of this orthonormal basis when expanding each frame vector as sparsity measure. We then analyze the recently introduced algorithm Spectral Tetris for construction of unit norm tight frames and prove that the tight frames generated by this algorithm are in fact optimally sparse with respect to the standard unit vector basis. Finally, we show that even the generalization of Spectral Tetris for the construction of unit norm frames associated with a given frame operator produces optimally sparse frames.
Cited in
(22)- Frames of uniform subframe bounds with applications to erasures
- Stable recovery of signals from frame coefficients with erasures at unknown locations
- Tetris tight frames construction via Hadamard matrices
- Full spark frames
- Necessary and sufficient conditions to perform spectral tetris
- Symplectic geometry and connectivity of spaces of frames
- Admissibility and frame homotopy for quaternionic frames
- Sparse matrices in frame theory
- Construction of robust frames in erasure recovery
- A sparse analysis window for discrete Gabor transform
- Recovery of signals from unordered partial frame coefficients
- Non-orthogonal fusion frames and the sparsity of fusion frame operators
- Linearly connected sequences and spectrally optimal dual frames for erasures
- Equiangular tight frames with simplices and with full spark in \(\mathbb{R}^d\)
- The Fundamentals of Spectral Tetris Frame Constructions
- Shearlets and Optimally Sparse Approximations
- Compressive sensing with redundant dictionaries and structured measurements
- Sparsity and spectral properties of dual frames
- Numerically erasure-robust frames
- Concentration of the Frobenius norm of generalized matrix inverses
- Steiner equiangular tight frames
- Spectral tetris fusion frame constructions
This page was built for publication: Optimally Sparse Frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272232)
