Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Two-step PR-scheme for recovering signals in detectable union of cones by magnitude measurements (1809.08136v3)

Published 21 Sep 2018 in cs.IT and math.IT

Abstract: Motivated by the research on sampling problems for a union of subspaces (UoS), we investigate in this paper the phase-retrieval problem for the signals that are residing in a union of (finitely generated) cones (UoC for short) in $\mathbb{R}{n}$. We propose a two-step PR-scheme: $\hbox{PR}=\hbox{detection}+\hbox{recovery}$. We first establish a sufficient and necessary condition for the detectability of a UoC, and then design a detection algorithm that allows us to determine the cone where the target signal is residing. The phase-retrieval will be then performed within the detected cone, which can be achieved by using at most $\Gamma$-number of measurements and with very low complexity, where $\Gamma (\leq n)$ is the maximum of the ranks of the generators for the UoC. Numerical experiments are provided to demonstrate the efficiency of our approach, and to exhibit comparisons with some existing phase-retrieval methods.

Citations (1)

Summary

We haven't generated a summary for this paper yet.