TY - GEN
T1 - Blind gain and phase calibration for low-dimensional or sparse signal sensing via power iteration
AU - Li, Yanjun
AU - Lee, Kiryung
AU - Bresler, Yoram
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/9/1
Y1 - 2017/9/1
N2 - Blind gain and phase calibration (BGPC) is a bilinear inverse problem involving the determination of unknown gains and phases of the sensing system, and the unknown signal, jointly. BGPC arises in numerous applications, e.g., blind albedo estimation in inverse rendering, synthetic aperture radar autofocus, and sensor array auto-calibration. In some cases, sparse structure in the unknown signal alleviates the ill-posedness of BGPC. Recently there has been renewed interest in solutions to BGPC with careful analysis of error bounds. In this paper, we formulate BGPC as an eigenvalue/eigenvector problem, and propose to solve it via power iteration, or in the sparsity or joint sparsity case, via truncated power iteration. Under certain assumptions, the unknown gains, phases, and the unknown signal can be recovered simultaneously. Numerical experiments show that power iteration algorithms work not only in the regime predicted by our main results, but also in regimes where theoretical analysis is limited. We also show that our power iteration algorithms for BGPC compare favorably with competing algorithms in adversarial conditions, e.g., with noisy measurement or with a bad initial estimate.
AB - Blind gain and phase calibration (BGPC) is a bilinear inverse problem involving the determination of unknown gains and phases of the sensing system, and the unknown signal, jointly. BGPC arises in numerous applications, e.g., blind albedo estimation in inverse rendering, synthetic aperture radar autofocus, and sensor array auto-calibration. In some cases, sparse structure in the unknown signal alleviates the ill-posedness of BGPC. Recently there has been renewed interest in solutions to BGPC with careful analysis of error bounds. In this paper, we formulate BGPC as an eigenvalue/eigenvector problem, and propose to solve it via power iteration, or in the sparsity or joint sparsity case, via truncated power iteration. Under certain assumptions, the unknown gains, phases, and the unknown signal can be recovered simultaneously. Numerical experiments show that power iteration algorithms work not only in the regime predicted by our main results, but also in regimes where theoretical analysis is limited. We also show that our power iteration algorithms for BGPC compare favorably with competing algorithms in adversarial conditions, e.g., with noisy measurement or with a bad initial estimate.
UR - http://www.scopus.com/inward/record.url?scp=85031692356&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85031692356&partnerID=8YFLogxK
U2 - 10.1109/SAMPTA.2017.8024422
DO - 10.1109/SAMPTA.2017.8024422
M3 - Conference contribution
AN - SCOPUS:85031692356
T3 - 2017 12th International Conference on Sampling Theory and Applications, SampTA 2017
SP - 119
EP - 123
BT - 2017 12th International Conference on Sampling Theory and Applications, SampTA 2017
A2 - Anbarjafari, Gholamreza
A2 - Kivinukk, Andi
A2 - Tamberg, Gert
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 12th International Conference on Sampling Theory and Applications, SampTA 2017
Y2 - 3 July 2017 through 7 July 2017
ER -