Year: 2017
Type: article
Abstract: In phase retrieval, the goal is to recover a complex signal from the magnitude of its linear measurements. While many well-known algorithms guarantee deterministic recovery of the unknown signal using i.i.d. random measurement matrices, they suffer serious convergence issues for some ill-conditioned measurement matrices. As an example, this happens in optical imagers using binary intensity-only spatial light modulators to shape the input wavefront. The problem of ill-conditioned measurement matrices has also been a topic of interest for compressed sensing researchers during the past decade. In this paper, using recent advances in generic compressed sensing, we propose a new phase retrieval algorithm that well-behaves for a large class of measurement matrices, including Gaussian and Bernoulli binary i.i.d. random matrices, using both sparse and dense input signals. This algorithm is also robust to the strong noise levels found in some imaging applications.
Source: Image Processing On Line
Institutions: Centre National de la Recherche Scientifique, Université Paris Sciences et Lettres, Sadjad University, Institut Langevin, Laboratoire Kastler Brossel, Université Pierre-et-Marie-Curie, École Normale Supérieure - PSL, Laboratoire de Physique de l'Ecole Normale Supérieure, Sorbonne Paris Cité, Université Paris Diderot
Language: English
Subfield: Computational Mechanics
Field: Engineering
Domain: Physical Sciences
Open Access status: diamond
Awards: G1137916843, G256400847, Paris Sciences et Lettres, Statistical Physics Approach to Reconstruction in Compressed Sensing, G4190806336, G471331628, G5043543010, G52020613, G5537318980, G6759105742, G676769616, G7240651115, G741453844, G782245399, G8510727784, Complex Media Investigation with Adaptive Optics
OpenAlex ID: W2396681965