Sciweavers

ICIP
2002
IEEE

On the structure of some phase retrieval algorithms

14 years 5 months ago
On the structure of some phase retrieval algorithms
The state of the art for solving the phase retrieval problem in two dimensions relies heavily on the algorithms proposed by Gerchberg, Saxton, and Fienup. Despite the widespread use of these algorithms, current mathematical theory cannot explain their remarkable success. It is already known that the Gerchberg-Saxton algorithm is a nonconvex version of method of alternating projections. In this paper, we show that two other prominent phase retrieval methods also have well known counterparts in the world of convex optimization algorithms: Fienup's basic input-output algorithm corresponds to Dykstra's algorithm, and Fienup's hybrid input-output algorithm can be viewed as an instance of the Douglas-Rachford algorithm. This work provides a theoretical framework to better understand and, potentially, improve existing phase recovery algorithms.
Heinz H. Bauschke, Patrick L. Combettes, D. Russel
Added 24 Oct 2009
Updated 24 Oct 2009
Type Conference
Year 2002
Where ICIP
Authors Heinz H. Bauschke, Patrick L. Combettes, D. Russell Luke
Comments (0)