Complex phase retrieval from subgaussian measurements

DOI10.1007/S00041-020-09797-9MaRDI QIDQ2226993zbMATH OpenOpenAlexFDO

Authors Felix Krahmer, Dominik Stöger

Publication date 9 February 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

convex optimizationphase retrievaldescent cone analysissmall-ball method

Mathematics Subject Classification ID

Point estimation (62F10) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Phase retrieval refers to the problem of reconstructing an unknown vector $x_{0}inmathbb{C}^n$ or $x_{0}inmathbb{R}^n$ from $m$ measurements of the form $$, where $left{x{i}^{left(iight)}ight}_{i=1}^{m}subsetmathbb{C}^m$ are known measurement vectors. While Gaussian measurements allow for recovery of arbitrary signals provided the number of measurements scales at least linearly in the number of dimensions, it has been shown that ambiguities may arise for certain other classes of measurements $left{x{i}^{left(iight)}ight}_{i=1}^m$ such as Bernoulli measurements or Fourier measurements. In this paper, we will prove that even when a subgaussian vector $x{i}^{left(iight)}inmathbb{C}^m$ does not fulfill a small-ball probability assumption, the PhaseLift method is still able to reconstruct a large class of signals $x_{0}inmathbb{R}^n$ from the measurements. This extends recent work by Krahmer and Liu from the real-valued to the complex-valued case. However, our proof strategy is quite different and we expect some of the new proof ideas to be useful in several other measurement scenarios as well. We then extend our results $x_{0}inmathbb{C}^n$ up to an additional assumption which, as we show, is necessary.

Recommendations

• Phase retrieval for sub-Gaussian measurements
• A geometric analysis of phase retrieval
• The recovery of complex sparse signals from few phaseless measurements
• Phase retrieval from very few measurements
• Phase retrieval from low-rate samples

Cites work

• scientific article; zbMATH DE number 1254560 (Why is no real title available?)
• A flexible convex relaxation for phase retrieval
• A geometric analysis of phase retrieval
• A mathematical introduction to compressive sensing
• A partial derandomization of phaselift using spherical designs
• Absolute uniqueness of phase retrieval with random illumination
• Analysis of Spectral Methods for Phase Retrieval With Random Orthogonal Matrices
• Bounding the smallest singular value of a random matrix without concentration
• Convex Recovery of a Structured Signal from Independent Random Linear Measurements
• Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
• Fundamental limits of weak recovery with applications to phase retrieval
• Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
• Hanson-Wright inequality and sub-Gaussian concentration
• High-dimensional probability. An introduction with applications in data science
• Improved recovery guarantees for phase retrieval from coded diffraction patterns
• Learning without concentration
• Low rank matrix recovery from rank one measurements
• On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions
• Optimal Spectral Initialization for Signal Recovery With Applications to Phase Retrieval
• Phase Retrieval Using Alternating Minimization
• Phase Retrieval With Random Gaussian Sensing Vectors by Alternating Projections
• Phase Retrieval Without Small-Ball Probability Assumptions
• Phase retrieval from coded diffraction patterns
• Phase retrieval via Wirtinger flow: theory and algorithms
• Phase retrieval: stability and recovery guarantees
• Phase transitions of spectral initialization for high-dimensional non-convex estimation
• PhaseMax: Convex Phase Retrieval via Basis Pursuit
• Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
• Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
• Solving equations of random convex functions via anchored regression
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• Stable low-rank matrix recovery via null space properties
• Stable optimizationless recovery from phaseless linear measurements
• Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization
• The convex geometry of linear inverse problems

Cited in

(9)

• A partial derandomization of phaselift using spherical designs
• The numerics of phase retrieval
• Phase retrieval from Fourier measurements with masks
• PhaseMax: stable guarantees from noisy sub-Gaussian measurements
• Stable phase retrieval in function spaces
• Phase retrieval by binary questions: which complementary subspace is closer?
• Stable phase retrieval and perturbations of frames
• Phase retrieval for sub-Gaussian measurements
• Proof methods for robust low-rank matrix recovery

Describes a project that uses

Uses Software

• Wirtinger Flow
• PhaseLift
• PhaseMax

This page was built for publication: Complex phase retrieval from subgaussian measurements

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