Non-unique games over compact groups and orientation estimation in cryo-EM
نویسندگان
چکیده
منابع مشابه
Non-unique games over compact groups and orientation estimation in cryo-EM
Let G be a compact group and let fij ∈ L(G). We define the Non-Unique Games (NUG) problem as finding g1, . . . , gn ∈ G to minimize ∑n i,j=1 fij ( gig −1 j ) . 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 p...
متن کاملUnique Games Over Integers
Consider systems of two-variable linear equations of the form xi−xj = cij , where the cij ’s are integer constants. We show that even if there is an integer solution satisfying at least a (1− )fraction of the equations, it is Unique-Games-hard to find an integer (or even real) solution satisfying at least an -fraction of the equations. Indeed, we show it is Unique-Games-hard even to find an -go...
متن کاملOrientation Determination from Cryo-EM images Using Least Unsquared Deviation
A major challenge in single particle reconstruction from cryo-electron microscopy is to establish a reliable ab-initio three-dimensional model using two-dimensional projection images with unknown orientations. Common-lines based methods estimate the orientations without additional geometric information. However, such methods fail when the detection rate of common-lines is too low due to the hig...
متن کاملOrientation Determination of Cryo-EM Images Using Least Unsquared Deviations
A major challenge in single particle reconstruction from cryo-electron microscopy is to establish a reliable ab initio three-dimensional model using two-dimensional projection images with unknown orientations. Common-lines-based methods estimate the orientations without additional geometric information. However, such methods fail when the detection rate of common-lines is too low due to the hig...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 2020
ISSN: 0266-5611,1361-6420
DOI: 10.1088/1361-6420/ab7d2c