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

Abstract

Let G be a compact group and let fij ∈ L2(G). We define the Non-Unique Games (NUG) problem as finding g1,…,gn ∈ G to minimize Σi,j=1n fij ( gi gj-1). We devise a relaxation of the NUG problem to a semidefinite program (SDP) by taking the Fourier transform of fij over 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 d-dimensions and orientation estimation in cryo-Electron Microscopy.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…