TY - JOUR
T1 - PhaseEqual
T2 - Convex Phase Retrieval via Alternating Direction Method of Multipliers
AU - Wang, Bin
AU - Fang, Jun
AU - Duan, Huiping
AU - Li, Hongbin
N1 - Publisher Copyright:
© 1991-2012 IEEE.
PY - 2020
Y1 - 2020
N2 - The problem of estimating an unknown complex signal from its magnitude-only measurements is a classical problem known as phase retrieval. This problem arises naturally because in some applications, it is difficult or costly to measure the phase of the measurements. In this paper, we propose a new convex formulation, referred to as PhaseEqual, for solving the phase retrieval problem. Similar to PhaseMax T. Goldstein and C. Studer, 2018 by Goldstein and Studer (IEE TIT, 2018), PhaseEqual works in the natural signal space and thus is computationally efficient. We then extend PhaseEqual to the sparse signal case, with the proposed convex formulation termed as compressed PhaseEqual. Different from existing convex compressed phase retrieval methods, the proposed compressed PhaseEqual formulation does not involve any regularization parameter and thus is free of the parameter tuning issue which is always tricky in practice. Order-wise recovery conditions for PhaseEqual and its sparse version (i.e. compressed PhaseEqual) are analyzed. Our theoretical results show that PhaseEqual (resp. compressed PhaseEqual) achieves perfect recovery with \mathcal {O}(n) (resp. \mathcal {O}(k\text{log}\frac{n}{k})) magnitude measurements, provided that a well-correlated reference vector is available, where k and n denote the number of nonzero entries in the complex sparse signal and the dimension of the signal, respectively. Simulation results are provided to illustrate the effectiveness of the proposed methods.
AB - The problem of estimating an unknown complex signal from its magnitude-only measurements is a classical problem known as phase retrieval. This problem arises naturally because in some applications, it is difficult or costly to measure the phase of the measurements. In this paper, we propose a new convex formulation, referred to as PhaseEqual, for solving the phase retrieval problem. Similar to PhaseMax T. Goldstein and C. Studer, 2018 by Goldstein and Studer (IEE TIT, 2018), PhaseEqual works in the natural signal space and thus is computationally efficient. We then extend PhaseEqual to the sparse signal case, with the proposed convex formulation termed as compressed PhaseEqual. Different from existing convex compressed phase retrieval methods, the proposed compressed PhaseEqual formulation does not involve any regularization parameter and thus is free of the parameter tuning issue which is always tricky in practice. Order-wise recovery conditions for PhaseEqual and its sparse version (i.e. compressed PhaseEqual) are analyzed. Our theoretical results show that PhaseEqual (resp. compressed PhaseEqual) achieves perfect recovery with \mathcal {O}(n) (resp. \mathcal {O}(k\text{log}\frac{n}{k})) magnitude measurements, provided that a well-correlated reference vector is available, where k and n denote the number of nonzero entries in the complex sparse signal and the dimension of the signal, respectively. Simulation results are provided to illustrate the effectiveness of the proposed methods.
KW - ADMM
KW - Phase retrieval
KW - PhaseEqual
KW - compressed phase retrieval
UR - http://www.scopus.com/inward/record.url?scp=85079469920&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85079469920&partnerID=8YFLogxK
U2 - 10.1109/TSP.2020.2971192
DO - 10.1109/TSP.2020.2971192
M3 - Article
AN - SCOPUS:85079469920
SN - 1053-587X
VL - 68
SP - 1274
EP - 1285
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
M1 - 8978625
ER -