A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Multireference alignment using semidefinite programming
2014
Proceedings of the 5th conference on Innovations in theoretical computer science - ITCS '14
The multireference alignment problem consists of estimating a signal from multiple noisy shifted observations. Inspired by existing Unique-Games approximation algorithms, we provide a semidefinite program (SDP) based relaxation which approximates the maximum likelihood estimator (MLE) for the multireference alignment problem. Although we show that the MLE problem is Unique-Games hard to approximate within any constant, we observe that our poly-time approximation algorithm for the MLE appears to
doi:10.1145/2554797.2554839
dblp:conf/innovations/BandeiraCSZ14
fatcat:5nl2fjexbvgk3h3wemz4lrixea