Random tight frames

From MaRDI portal
Publication:421199

DOI10.1007/S00041-011-9182-5zbMATH Open1247.42026arXiv1102.4080OpenAlexW3102825791MaRDI QIDQ421199FDOQ421199

Martin Ehler

Publication date: 23 May 2012

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1102.4080




Recommendations




Cites Work


Cited In (22)





This page was built for publication: Random tight frames

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421199)