Conjugate phase retrieval on graphs and with applications in shift-invariant spaces
Cheng Cheng, Baixiang Wu, Jun Xian

TL;DR
This paper develops a framework for conjugate phase retrieval of complex signals on graphs and shift-invariant spaces, providing theoretical guarantees and algorithms for reconstructing signals from phaseless measurements.
Contribution
It introduces a graph-based approach for conjugate phase retrieval and applies it to shift-invariant spaces, including new algorithms for signal reconstruction from phaseless data.
Findings
Graph signals can be recovered up to a unimodular constant and conjugation from absolute and relative magnitude measurements.
Signals in Paley-Wiener space are recoverable from structured phaseless samples at three times the Nyquist rate.
Numerical algorithms successfully reconstruct signals in both Paley-Wiener and general shift-invariant spaces from phaseless measurements.
Abstract
In this paper, we study the conjugate phase retrieval for complex-valued \mbox{signals} residing on graphs, and explore its applications to shift-invariant spaces. Given a complex-valued graph signal residing on the graph , we introduce a graph and show that its connectivity is sufficient to determine up to a global unimodular constant and conjugation. We then construct two explicit graph models and show that graph signals residing on them can be recovered, up to a unimodular constant and conjugation, from its absolute values on the vertices and the relative magnitudes between neighboring vertices. Building on this graph-based framework, we apply our results to shift-invariant spaces generated by real-valued functions. For signals in the Paley-Wiener space, we show that any complex-valued function can be recovered, up to a unimodular…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
