Signal Reconstruction From the Magnitude of Subspace Components
From MaRDI portal
Abstract: We consider signal reconstruction from the norms of subspace components generalizing standard phase retrieval problems. In the deterministic setting, a closed reconstruction formula is derived when the subspaces satisfy certain cubature conditions, that require at least a quadratic number of subspaces. Moreover, we address reconstruction under the erasure of a subset of the norms; using the concepts of -fusion frames and list decoding, we propose an algorithm that outputs a finite list of candidate signals, one of which is the correct one. In the random setting, we show that a set of subspaces chosen at random and of cardinality scaling linearly in the ambient dimension allows for exact reconstruction with high probability by solving the feasibility problem of a semidefinite program.
Cited in
(11)- Phase retrieval using random cubatures and fusion frames of positive semidefinite matrices
- Reconstructing a signal from the knowledge of the norms of its multiples
- Uniformly distributed sequences in the orthogonal group and on the Grassmannian manifold
- Phase retrieval by binary questions: which complementary subspace is closer?
- Preconditioning filter bank decomposition using structured normalized tight frames
- Projections and phase retrieval
- Quasi-linear compressed sensing
- Phase retrieval on real Hilbert spaces by the area of parallelogram
- Constructions and properties of optimally spread subspace packings
- Generalized phase retrieval in quaternion Euclidean spaces
- Operator sequence-based phase retrieval on quaternionic left Hilbert spaces
This page was built for publication: Signal Reconstruction From the Magnitude of Subspace Components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977387)
