Phase retrieval for sparse binary signal: uniqueness and algorithm

DOI10.1080/17415977.2017.1336551zbMath1429.94038OpenAlexW2622996406MaRDI QIDQ3121983

Hong-Xia Wang, Ziyang Yuan

Publication date: 20 March 2019

Published in: Inverse Problems in Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17415977.2017.1336551

zbMATH Keywords

nonconvex optimizationsimulated annealing (SA)phase retrievalbinary signalNewman polynomial

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (1)

One-dimensional phase retrieval: regularization, box relaxation and uniqueness

Uses Software

• GESPAR
• Wirtinger Flow

Cites Work

• Unnamed Item
• A geometric analysis of phase retrieval
• Binary sparse phase retrieval via simulated annealing
• Saving phase: injectivity and stability for phase retrieval
• Phase retrieval: stability and recovery guarantees
• On signal reconstruction without phase
• Phase Retrieval via Wirtinger Flow: Theory and Algorithms
• Equivalent permittivity of binary objects obtained by inversion of their response to impressed potentials
• The reconstruction of a multidimensional sequence from the phase or magnitude of its Fourier transform
• GESPAR: Efficient Phase Retrieval of Sparse Signals
• Sparse Phase Retrieval: Uniqueness Guarantees and Recovery Algorithms
• Irreducibility testing of lacunary 0,1-polynomials
• On the irreducibility of 0,1-polynomials of the form f(x) xⁿ+ g(x)
• Super Resolution Phase Retrieval for Sparse Signals
• Construction of time-limited functions with specified autocorrelation functions

This page was built for publication: Phase retrieval for sparse binary signal: uniqueness and algorithm