Phase retrieval by binary questions: which complementary subspace is closer?
From MaRDI portal
Publication:2165571
DOI10.1007/s00365-022-09582-5zbMath1495.94013arXiv1907.02225OpenAlexW4285006865WikidataQ114229755 ScholiaQ114229755MaRDI QIDQ2165571
Bernhard G. Bodmann, Dylan Domel-White
Publication date: 20 August 2022
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.02225
Semidefinite programming (90C22) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Matrix completion problems (15A83)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniqueness results in an extension of Pauli's phase retrieval problem
- A simple proof of the restricted isometry property for random matrices
- Dimension reduction by random hyperplane tessellations
- Saving phase: injectivity and stability for phase retrieval
- One-bit compressed sensing with non-Gaussian measurements
- On signal reconstruction without phase
- An algebraic characterization of injectivity in phase retrieval
- Phase Retrieval By Projections
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- One-Bit Compressed Sensing by Linear Programming
- Signal Reconstruction From the Magnitude of Subspace Components
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- A Remark on Stirling's Formula
- On the Determination of the Phase of a Fourier Integral, I
- On the Determination of the Phase of a Fourier Integral, II
- Tight informationally complete quantum measurements
- An Introduction to Random Matrices
- An Introduction to Matrix Concentration Inequalities
- Phase Retrieval via Matrix Completion
This page was built for publication: Phase retrieval by binary questions: which complementary subspace is closer?
