Iterative phase retrieval algorithms I: optimization
نویسندگان
چکیده
منابع مشابه
Iterative phase retrieval algorithms. I: optimization.
Two modified Gerchberg-Saxton (GS) iterative phase retrieval algorithms are proposed. The first we refer to as the spatial phase perturbation GS algorithm (SPP GSA). The second is a combined GS hybrid input-output algorithm (GS/HIOA). In this paper (Part I), it is demonstrated that the SPP GS and GS/HIO algorithms are both much better at avoiding stagnation during phase retrieval, allowing them...
متن کاملIterative Algorithms for Ptychographic Phase Retrieval
Ptychography promises diffraction limited resolution without the need for high resolution lenses. To achieve high resolution one has to solve the phase problem for many partially overlapping frames. Here we review some of the existing methods for solving ptychographic phase retrieval problem from a numerical analysis point of view, and propose alternative methods based on numerical optimization...
متن کاملA unified evaluation of iterative projection algorithms for phase retrieval
Iterative projection algorithms are successfully being used as a substitute of lenses to recombine, numerically rather than optically, light scattered by illuminated objects. Images obtained computationally allow aberration-free diffraction-limited imaging and the possibility of using radiation for which no lenses exist. The challenge of this imaging technique is transferred from the lenses to ...
متن کاملPhase retrieval algorithms: a comparison.
Iterative algorithms for phase retrieval from intensity data are compared to gradient search methods. Both the problem of phase retrieval from two intensity measurements (in electron microscopy or wave front sensing) and the problem of phase retrieval from a single intensity measurement plus a non-negativity constraint (in astronomy) are considered, with emphasis on the latter. It is shown that...
متن کاملOptimization I: Greedy Algorithms
In this chapter and the next, we consider algorithms for optimization problems. We have already seen an example of an optimization problem — the maximum subsequence sum problem from Chapter 1. We can characterize optimization problems as admitting a set of candidate solutions. In the maximum subsequence sum problem, the candidate solutions are the contiguous subsequences in the input array. An ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Optics
سال: 2015
ISSN: 1559-128X,2155-3165
DOI: 10.1364/ao.54.004698