Phase retrieval for sparse binary signal: uniqueness and algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1305288 (Why is no real title available?)
- A geometric analysis of phase retrieval
- Binary sparse phase retrieval via simulated annealing
- Construction of time-limited functions with specified autocorrelation functions
- Equivalent permittivity of binary objects obtained by inversion of their response to impressed potentials
- GESPAR: Efficient Phase Retrieval of Sparse Signals
- Irreducibility testing of lacunary 0,1-polynomials
- On signal reconstruction without phase
- On the irreducibility of 0,1-polynomials of the form f(x) xn+ g(x)
- Phase retrieval via Wirtinger flow: theory and algorithms
- Phase retrieval: stability and recovery guarantees
- Saving phase: injectivity and stability for phase retrieval
- Sparse Phase Retrieval: Uniqueness Guarantees and Recovery Algorithms
- Super Resolution Phase Retrieval for Sparse Signals
- The reconstruction of a multidimensional sequence from the phase or magnitude of its Fourier transform
Cited in
(5)- Toward a mathematical theory of the crystallographic phase retrieval problem
- One-dimensional phase retrieval: regularization, box relaxation and uniqueness
- Signal Reconstruction from Phase-Only Measurements: Uniqueness Condition, Minimal Measurement Number and Beyond
- A non-iterative phase retrieval algorithm for minimum-phase signals using the annihilating filter
- Binary sparse phase retrieval via simulated annealing
This page was built for publication: Phase retrieval for sparse binary signal: uniqueness and algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121983)