Non-negativity constraints in the one-dimensional discrete-time phase retrieval problem
From MaRDI portal
Publication:4603705
DOI10.1093/imaiai/iaw018zbMath1380.94044arXiv1605.05482OpenAlexW2402460217MaRDI QIDQ4603705
Publication date: 19 February 2018
Published in: Information and Inference (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.05482
Related Items (2)
One-dimensional phase retrieval: regularization, box relaxation and uniqueness ⋮ The phase problem for two-dimensional crystals. I. Theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Phase retrieval for imaging problems
- Ambiguities in one-dimensional discrete phase retrieval from Fourier magnitudes
- Painless reconstruction from magnitudes of frame coefficients
- Zeros and factors of polynomials with positive coefficients and protein- ligand binding
- PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms
- Stable phase retrieval with low-redundancy frames
- One-dimensional phase retrieval with additional interference intensity measurements
- On signal reconstruction without phase
- Phase Retrieval from Incomplete Magnitude Information via Total Variation Regularization
- Phase reconstruction by a multilevel iteratively regularized Gauss–Newton method
- Phase retrieval using a window function
- The phase problem
- Vectorial Phase Retrieval of 1-D Signals
- Phase retrieval for Fresnel measurements using a shearlet sparsity constraint
- Phase retrieval from power spectra of masked signals
- Multilevel Gauss–Newton methods for phase retrieval problems
- Phase Retrieval via Matrix Completion
This page was built for publication: Non-negativity constraints in the one-dimensional discrete-time phase retrieval problem
