TY - JOUR
T1 - A Spectral Method for Stable Bispectrum Inversion with Application to Multireference Alignment
AU - Chen, Hua
AU - Zehni, Mona
AU - Zhao, Zhizhen
N1 - Funding Information:
Manuscript received February 12, 2018; revised April 6, 2018; accepted April 11, 2018. Date of publication April 30, 2018; date of current version May 21, 2018. This work was supported by UIUC COE SRI grant. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Magno T. M. Silva. (Corresponding author: Mona Zehni.) The authors are with the University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering, Urbana, IL 61801 USA (e-mail:, huachen4@illinois.edu; mzehni2@illinois.edu; zhizhenz@illinois.edu).
Publisher Copyright:
© 1994-2012 IEEE.
PY - 2018/7
Y1 - 2018/7
N2 - We focus on an alignment-free method to estimate the underlying signal from a large number of noisy randomly shifted observations. Specifically, we estimate the mean, power spectrum, and bispectrum of the signal from the observations. Since the bispectrum contains the phase information of the signal, reliable algorithms for bispectrum inversion are useful in many applications. We propose a new algorithm using spectral decomposition of the bispectrum phase matrix for this task. For clean signals, we show that the eigenvectors of the bispectrum phase matrix correspond to the true phases of the signal and its shifted copies. In addition, the spectral method is robust to noise. It can be used as a stable and efficient initialization technique for local nonconvex optimization for bispectrum inversion.
AB - We focus on an alignment-free method to estimate the underlying signal from a large number of noisy randomly shifted observations. Specifically, we estimate the mean, power spectrum, and bispectrum of the signal from the observations. Since the bispectrum contains the phase information of the signal, reliable algorithms for bispectrum inversion are useful in many applications. We propose a new algorithm using spectral decomposition of the bispectrum phase matrix for this task. For clean signals, we show that the eigenvectors of the bispectrum phase matrix correspond to the true phases of the signal and its shifted copies. In addition, the spectral method is robust to noise. It can be used as a stable and efficient initialization technique for local nonconvex optimization for bispectrum inversion.
UR - http://www.scopus.com/inward/record.url?scp=85046370907&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85046370907&partnerID=8YFLogxK
U2 - 10.1109/LSP.2018.2831631
DO - 10.1109/LSP.2018.2831631
M3 - Article
AN - SCOPUS:85046370907
SN - 1070-9908
VL - 25
SP - 911
EP - 915
JO - IEEE Signal Processing Letters
JF - IEEE Signal Processing Letters
IS - 7
ER -