Phase retrieval from Fourier measurements with masks
type: Item
instance of: scholarly article
title: Phase retrieval from Fourier measurements with masks
zbMATH Open document ID: 1472.94009
author: Huiping Li
author: Song Li
published in: Inverse Problems and Imaging
publication date: 2021-09-10T00:00:00Z
Mathematics Subject Classification ID: 94A08
Mathematics Subject Classification ID: 94A12
Mathematics Subject Classification ID: 94A20
Mathematics Subject Classification ID: 78A45
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 49N30
zbMATH DE Number: 7393995
zbMATH Keywords: phase retrieval
zbMATH Keywords: phaselift
zbMATH Keywords: masked Fourier measurements
zbMATH Keywords: sparsity
zbMATH Keywords: low rank matrix recovery
describes a project that uses: SparsePR
describes a project that uses: GESPAR
describes a project that uses: Wirtinger Flow
MaRDI profile type: Publication
full work available at URL: ipi.2021028
OpenAlex ID: W3162023141
cites work: Generalized sampling and infinite-dimensional compressed sensing
cites work: Painless reconstruction from magnitudes of frame coefficients
cites work: Saving phase: injectivity and stability for phase retrieval
cites work: Phase retrieval from power spectra of masked signals
cites work: Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow
cites work: The restricted isometry property and its implications for compressed sensing
cites work: Phase retrieval via matrix completion
cites work: Solving quadratic equations via phaselift when there are about as many equations as unknowns
cites work: Phase retrieval from coded diffraction patterns
cites work: Phase Retrieval via Wirtinger Flow: Theory and Algorithms
cites work: A Probabilistic and RIPless Theory of Compressed Sensing
cites work: Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion
cites work: Array imaging using intensity-only measurements
cites work: Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
cites work: The Pauli problem, state reconstruction and quantum-real numbers
cites work: Stable optimizationless recovery from phaseless linear measurements
cites work: Absolute uniqueness of phase retrieval with random illumination
cites work: Recovering Low-Rank Matrices From Few Coefficients in Any Basis
cites work: A partial derandomization of phaselift using spherical designs
cites work: Improved recovery guarantees for phase retrieval from coded diffraction patterns
cites work: Robust sparse phase retrieval made easy
cites work: Phase Retrieval Without Small-Ball Probability Assumptions
cites work: Low rank matrix recovery from rank one measurements
cites work: Sparse signal recovery from quadratic measurements via convex programming
cites work: Phase Retrieval Using Alternating Minimization
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: GESPAR: Efficient Phase Retrieval of Sparse Signals
cites work: Phase recovery, MaxCut and complex semidefinite programming
cites work: Sparse Phase Retrieval via Truncated Amplitude Flow
DOI: 10.3934/IPI.2021028
description: scientific article; zbMATH DE number 7393995