Phase retrieval from very few measurements

DOI10.1016/j.laa.2014.02.011zbMath1286.42043arXiv1307.7176OpenAlexW2964095152MaRDI QIDQ2447980

Dustin G. Mixon, Matthew Fickus, Aaron A. Nelson, Yang Wang

Publication date: 29 April 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityphase retrievalunit norm tight framesinformationally complete

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (max. 100)

Robust sparse phase retrieval made easy ⋮ Algorithms and error bounds for noisy phase retrieval with low-redundancy frames ⋮ Almost everywhere generalized phase retrieval ⋮ Almost everywhere injectivity conditions for the matrix recovery problem ⋮ Phase retrieval from the magnitudes of affine linear measurements ⋮ Phase retrieval via sensor network localization ⋮ Phase retrieval in quaternion Euclidean spaces ⋮ Uniqueness of phase retrieval from three measurements ⋮ Phase retrieval for the Cauchy wavelet transform ⋮ One-dimensional phase retrieval: regularization, box relaxation and uniqueness ⋮ Phase retrievable projective representation frames for finite abelian groups ⋮ Unnamed Item ⋮ Explicit frames for deterministic phase retrieval via PhaseLift ⋮ Real phase retrieval from unordered partial frame coefficients ⋮ ABOUT THE SYSTEMS WITH FULL SPARK ⋮ Approximation of generalized ridge functions in high dimensions ⋮ Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems ⋮ Local and global phaseless sampling in real spline spaces ⋮ Generalized phase retrieval: measurement number, matrix recovery and beyond ⋮ Frame phase-retrievability and exact phase-retrievable frames ⋮ Almost Phaseless Sampling for Spline Spaces with Arbitrary Knots*

Uses Software

• PhaseLift

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing all self-adjoint matrices with prescribed spectrum and diagonal
• Stable optimizationless recovery from phaseless linear measurements
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• Constructing tight fusion frames
• Auto-tuning unit norm frames
• Painless reconstruction from magnitudes of frame coefficients
• The road to equal-norm Parseval frames
• On the complexity of approximating extremal determinants in matrices
• Finite normalized tight frames
• Equal-norm tight frames with erasures
• Full spark frames
• Quantum tomography under prior information
• Constructing finite frames of a given spectrum and set of lengths
• Saving phase: injectivity and stability for phase retrieval
• Stable phase retrieval with low-redundancy frames
• On signal reconstruction without phase
• Minimal informationally complete measurements for pure states
• An algebraic characterization of injectivity in phase retrieval
• Phase recovery, MaxCut and complex semidefinite programming
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• Phase Retrieval with Polarization
• Array imaging using intensity-only measurements
• Pure-state informationally complete and “really” complete measurements
• Painless nonorthogonal expansions
• Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
• Reducibility among Combinatorial Problems
• Phase retrieval from power spectra of masked signals
• A Class of Nonharmonic Fourier Series
• Phase Retrieval via Matrix Completion

This page was built for publication: Phase retrieval from very few measurements