English

Non-unique games over compact groups and orientation estimation in cryo-EM

Computer Vision and Pattern Recognition 2015-05-15 v1 Data Structures and Algorithms Optimization and Control

Abstract

Let G\mathcal{G} be a compact group and let fijL2(G)f_{ij} \in L^2(\mathcal{G}). We define the Non-Unique Games (NUG) problem as finding g1,,gnGg_1,\dots,g_n \in \mathcal{G} to minimize i,j=1nfij(gigj1)\sum_{i,j=1}^n f_{ij} \left( g_i g_j^{-1}\right). We devise a relaxation of the NUG problem to a semidefinite program (SDP) by taking the Fourier transform of fijf_{ij} over G\mathcal{G}, which can then be solved efficiently. The NUG framework can be seen as a generalization of the little Grothendieck problem over the orthogonal group and the Unique Games problem and includes many practically relevant problems, such as the maximum likelihood estimator} to registering bandlimited functions over the unit sphere in dd-dimensions and orientation estimation in cryo-Electron Microscopy.

Cite

@article{arxiv.1505.03840,
  title  = {Non-unique games over compact groups and orientation estimation in cryo-EM},
  author = {Afonso S. Bandeira and Yutong Chen and Amit Singer},
  journal= {arXiv preprint arXiv:1505.03840},
  year   = {2015}
}
R2 v1 2026-06-22T09:34:28.668Z