TY - GEN
T1 - Heterogeneous multireference alignment
T2 - 52nd Annual Conference on Information Sciences and Systems, CISS 2018
AU - Boumal, Nicolas
AU - Bendory, Tamir
AU - Lederman, Roy R.
AU - Singer, Amit
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/5/21
Y1 - 2018/5/21
N2 - Multireference alignment (MRA) is the problem of estimating a signal from many noisy and cyclically shifted copies of itself. In this paper, we consider an extension called heterogeneous MRA, where K signals must be estimated, and each observation comes from one of those signals, unknown to us. This is a simplified model for the heterogeneity problem notably arising in cryo-electron microscopy. We propose an algorithm which estimates the K signals without estimating either the shifts or the classes of the observations. It requires only one pass over the data and is based on low-order moments that are invariant under cyclic shifts. Given sufficiently many measurements, one can estimate these invariant features averaged over the K signals. We then design a smooth, non-convex optimization problem to compute a set of signals which are consistent with the estimated averaged features. We find that, in many cases, the proposed approach estimates the set of signals accurately despite non-convexity, and conjecture the number of signals K that can be resolved as a function of the signal length L is on the order of √L.
AB - Multireference alignment (MRA) is the problem of estimating a signal from many noisy and cyclically shifted copies of itself. In this paper, we consider an extension called heterogeneous MRA, where K signals must be estimated, and each observation comes from one of those signals, unknown to us. This is a simplified model for the heterogeneity problem notably arising in cryo-electron microscopy. We propose an algorithm which estimates the K signals without estimating either the shifts or the classes of the observations. It requires only one pass over the data and is based on low-order moments that are invariant under cyclic shifts. Given sufficiently many measurements, one can estimate these invariant features averaged over the K signals. We then design a smooth, non-convex optimization problem to compute a set of signals which are consistent with the estimated averaged features. We find that, in many cases, the proposed approach estimates the set of signals accurately despite non-convexity, and conjecture the number of signals K that can be resolved as a function of the signal length L is on the order of √L.
KW - Gaussian mixture models
KW - Multireference alignment
KW - bispectrum
KW - cryo-EM
KW - expectation-maximization
KW - heterogeneity
KW - non-convex optimization
UR - http://www.scopus.com/inward/record.url?scp=85048550930&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85048550930&partnerID=8YFLogxK
U2 - 10.1109/CISS.2018.8362313
DO - 10.1109/CISS.2018.8362313
M3 - Conference contribution
AN - SCOPUS:85048550930
T3 - 2018 52nd Annual Conference on Information Sciences and Systems, CISS 2018
SP - 1
EP - 6
BT - 2018 52nd Annual Conference on Information Sciences and Systems, CISS 2018
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 21 March 2018 through 23 March 2018
ER -