Random Tight Frames
arXiv:1102.4080 · doi:10.1007/s00041-011-9182-5
Abstract
We introduce probabilistic frames to study finite frames whose elements are chosen at random. While finite tight frames generalize orthonormal bases by allowing redundancy, independent, uniformly distributed points on the sphere approximately form a finite unit norm tight frame (FUNTF). In the present paper, we develop probabilistic versions of tight frames and FUNTFs to significantly weaken the requirements on the random choice of points to obtain an approximate finite tight frame. Namely, points can be chosen from any probabilistic tight frame, they do not have to be identically distributed, nor have unit norm. We also observe that classes of random matrices used in compressed sensing are induced by probabilistic tight frames.
References in corpus (1)
Cited by in corpus (8)
- Minimization of the Probabilistic p-frame Potential
- Tight p-fusion frames
- Frame theory in directional statistics
- Probabilistic frames: An overview
- Finite frames, frame potentials and determinantal point processes on the sphere
- Phase retrieval using random cubatures and fusion frames of positive semidefinite matrices
- Preconditioning filter bank decompositions using structured normalized tight frames
- Approximately Dual and Pseudo-Dual Probabilistic Frames