Phase retrieval by binary questions: which complementary subspace is closer?

DOI10.1007/S00365-022-09582-5MaRDI QIDQ2165571zbMATH OpenOpenAlexWikidataFDO

Authors Dylan Domel-White, Bernhard G. Bodmann

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

zbMATH Keywords

coarse quantizationmeasure concentrationphase retrievalsemidefinite program

Mathematics Subject Classification ID

Matrix completion problems (15A83) Semidefinite programming (90C22) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Phase retrieval in real or complex Hilbert spaces is the task of recovering a vector, up to an overall unimodular multiplicative constant, from magnitudes of linear measurements. In this paper, we assume that the vector is normalized, but retain only qualitative, binary information about the measured magnitudes by comparing them with a threshold. In more specific, geometric terms, we choose a sequence of subspaces in a real or complex Hilbert space and only record whether a given vector is closer to the subspace than to the complementary subspace. The subspaces have half the dimension of the Hilbert space and are independent, uniformly distributed with respect to the action of the orthogonal or unitary groups. The main goal of this paper is to find a feasible algorithm for approximate recovery based on the information gained about the vector from these binary questions and to establish error bounds for its approximate recovery. We provide a pointwise bound for fixed input vectors and a uniform bound that controls the worst-case scenario among all inputs. Both bounds hold with high probability with respect to the choice of the subspaces. For real or complex vectors of dimension $n$, the pointwise bound requires $mgeCdelt{a}^{-2}nlog(n)$ and the uniform bound $mgeCdelt{a}^{-2}{n}^{2}log(delt{a}^{-1}n)$ binary questions in order to achieve an accuracy of $delta$. The accuracy $delta$ is measured by the operator norm of the difference between the rank-one orthogonal projections corresponding to the normalized input vector and its approximate recovery.

Recommendations

• Phase retrieval by projections
• Projections and phase retrieval
• Complex phase retrieval from subgaussian measurements
• Phase retrieval in infinite-dimensional Hilbert spaces
• Phase retrieval from low-rate samples

Cites work

• A Remark on Stirling's Formula
• A simple proof of the restricted isometry property for random matrices
• An algebraic characterization of injectivity in phase retrieval
• An introduction to matrix concentration inequalities
• An introduction to random matrices
• Dimension reduction by random hyperplane tessellations
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• On signal reconstruction without phase
• On the Determination of the Phase of a Fourier Integral, I
• On the Determination of the Phase of a Fourier Integral, II
• One-bit compressed sensing by linear programming
• One-bit compressed sensing with non-Gaussian measurements
• Phase retrieval by projections
• Phase retrieval by vectors and projections
• Phase retrieval via matrix completion
• Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
• Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
• Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
• Saving phase: injectivity and stability for phase retrieval
• Signal Reconstruction From the Magnitude of Subspace Components
• The probabilistic method
• Tight informationally complete quantum measurements
• Uniqueness results in an extension of Pauli's phase retrieval problem

Cited in

(4)

• Phase retrieval by projections
• Projections and phase retrieval
• Iteratively consistent one-bit phase retrieval
• Stable phase retrieval in function spaces

This page was built for publication: Phase retrieval by binary questions: which complementary subspace is closer?

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