Sampling Finite Unit Norm Tight Frames Using Symplectic Geometry
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915311538667520 |
|---|---|
| author | Faldet, Mason Shonkwiler, Clayton |
| author_facet | Faldet, Mason Shonkwiler, Clayton |
| contents | Unit-norm tight frames in finite-dimensional Hilbert spaces (FUNTFs) are fundamental in signal processing, offering optimal robustness to noise and measurement loss. In this paper we introduce the Eigenlift algorithm for sampling random FUNTFs. Our approach exploits the symplectic geometry of the FUNTF space, which we characterize as a symplectic reduction of frame space by a symmetry group. We then define a Hamiltonian torus action on this reduced space whose momentum map induces a fiber bundle structure. The algorithm proceeds by sampling a point from the base space, which is a convex polytope, lifting it deterministically to a point on the corresponding fiber, then acting on this point by a random element of the torus to obtain a random FUNTF. We implement the method in Python and validate it in low-dimensional settings where it is computationally feasible to sample the base polytope via rejection sampling. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_22847 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Sampling Finite Unit Norm Tight Frames Using Symplectic Geometry Faldet, Mason Shonkwiler, Clayton Functional Analysis Symplectic Geometry Unit-norm tight frames in finite-dimensional Hilbert spaces (FUNTFs) are fundamental in signal processing, offering optimal robustness to noise and measurement loss. In this paper we introduce the Eigenlift algorithm for sampling random FUNTFs. Our approach exploits the symplectic geometry of the FUNTF space, which we characterize as a symplectic reduction of frame space by a symmetry group. We then define a Hamiltonian torus action on this reduced space whose momentum map induces a fiber bundle structure. The algorithm proceeds by sampling a point from the base space, which is a convex polytope, lifting it deterministically to a point on the corresponding fiber, then acting on this point by a random element of the torus to obtain a random FUNTF. We implement the method in Python and validate it in low-dimensional settings where it is computationally feasible to sample the base polytope via rejection sampling. |
| title | Sampling Finite Unit Norm Tight Frames Using Symplectic Geometry |
| topic | Functional Analysis Symplectic Geometry |
| url | https://arxiv.org/abs/2505.22847 |