The generalized phase retrieval problem over compact groups

TL;DR

This paper generalizes the phase retrieval problem to compact groups, addressing the recovery of matrices from Gram matrices with applications in cryo-electron microscopy, and explores algebraic structures, uniqueness, algorithms, and stability conjectures.

Contribution

It introduces a generalized phase retrieval framework over compact groups, analyzing its algebraic properties, survey of solution uniqueness, and proposing new algorithms and stability conjectures.

Findings

Survey of recent uniqueness results for semialgebraic priors

Development of algorithms inspired by classical phase retrieval

Numerical experiments supporting the stability conjecture

Abstract

The classical phase retrieval problem involves estimating a signal from its Fourier magnitudes (power spectrum) by leveraging prior information about the desired signal. This paper extends the problem to compact groups, addressing the recovery of a set of matrices from their Gram matrices. In this broader context, the missing phases in Fourier space are replaced by missing unitary or orthogonal matrices arising from the action of a compact group on a finite-dimensional vector space. This generalization is driven by applications in multi-reference alignment and single-particle cryo-electron microscopy, a pivotal technology in structural biology. We define the generalized phase retrieval problem over compact groups and explore its underlying algebraic structure. We survey recent results on the uniqueness of solutions, focusing on the significant class of semialgebraic priors. Furthermore, we present a family of algorithms inspired by classical phase retrieval techniques. Finally, we propose a conjecture on the stability of the problem based on bi-Lipschitz analysis, supported by numerical experiments.