pith. sign in

arxiv: 1109.0573 · v2 · pith:CG2ZLPJGnew · submitted 2011-09-02 · 💻 cs.IT · math.IT· math.NA

Phase Retrieval via Matrix Completion

classification 💻 cs.IT math.ITmath.NA
keywords phasediffractedcompletionconvexdemonstrateimagingmatrixobject
0
0 comments X
read the original abstract

This paper develops a novel framework for phase retrieval, a problem which arises in X-ray crystallography, diffraction imaging, astronomical imaging and many other applications. Our approach combines multiple structured illuminations together with ideas from convex programming to recover the phase from intensity measurements, typically from the modulus of the diffracted wave. We demonstrate empirically that any complex-valued object can be recovered from the knowledge of the magnitude of just a few diffracted patterns by solving a simple convex optimization problem inspired by the recent literature on matrix completion. More importantly, we also demonstrate that our noise-aware algorithms are stable in the sense that the reconstruction degrades gracefully as the signal-to-noise ratio decreases. Finally, we introduce some theory showing that one can design very simple structured illumination patterns such that three diffracted figures uniquely determine the phase of the object we wish to recover.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.