Phase retrieval by iterated projections
JOSA A, Vol. 20, Issue 1, pp. 40-55 (2003)
http://dx.doi.org/10.1364/JOSAA.20.000040
Acrobat PDF (1173 KB)
Abstract
Several strategies in phase retrieval are unified by an iterative “difference map” constructed from a pair of elementary projections and three real parameters. For the standard application in optics, where the two projections implement Fourier modulus and object support constraints, respectively, the difference map reproduces the “hybrid” form of Fienup’s input–output map when a particular choice is made for two of the parameters. The geometric construction of the difference map illuminates the distinction between its fixed points and the recovered object, as well as the mechanism whereby the form of stagnation encountered by alternating projection schemes is avoided. When support constraints are replaced by object histogram or atomicity constraints, the difference map lends itself to crystallographic phase retrieval. Numerical experiments with synthetic data suggest that structures with hundreds of atoms can be solved.
© 2003 Optical Society of America
OCIS Codes
(100.5070) Image processing : Phase retrieval
Citation
Veit Elser, "Phase retrieval by iterated projections," J. Opt. Soc. Am. A 20, 40-55 (2003)
http://www.opticsinfobase.org/josaa/abstract.cfm?URI=josaa-20-1-40
Sort: Year | Journal | Reset
References
- R. P. Millane, “Phase retrieval in crystallography and optics,” J. Opt. Soc. Am. A 7, 394–411 (1990).
- J. C. Dainty and J. R. Fienup, “Phase retrieval and image reconstruction for astronomy,” in Image Recovery: Theory and Application, H. Stark, ed. (Academic, Orlando, Fla., 1987), Chap. 7, pp. 231–275.
- C. Giacovazzo, Direct Phasing in Crystallography (Oxford U. Press, Oxford, UK, 1998).
- H. Stark and Y. Yang, Vector Space Projections (Wiley, New York, 1998).
- R. W. Gerchberg and W. O. Saxton, “A practical algorithm for the determination of phase from image and diffraction plane pictures,” Optik (Stuttgart) 35, 237–246 (1972).
- J. R. Fienup, “Phase retrieval algorithms: a comparison,” Appl. Opt. 21, 2758–2769 (1982).
- A. Levi and H. Stark, “Image restoration by the method of generalized projections with application to restoration from magnitude,” J. Opt. Soc. Am. A 1, 932–943 (1984).
- H. Takajo, T. Takahashi, R. Ueda, and M. Taninaka, “Study on the convergence property of the hybrid input output algorithm used for phase retrieval,” J. Opt. Soc. Am. A 15, 2849–2861 (1998).
- H. Takajo, T. Takahashi, and T. Shizuma, “Further study on the convergence property of the hybrid input output algorithm used for phase retrieval,” J. Opt. Soc. Am. A 16, 2163–2168 (1999).
- The “difference map” considered here should not be confused with the “map” of the electron density studied by crystallographers in “difference Fourier synthesis.” The latter, in our notation, corresponds to π_{mod} (ρ)−ρ, whereas the difference that we consider involves a projection on a priori constraints as well.
- The term “stagnation” is interpreted to be the vanishing of the change between iterates.
- The term “subspace” denotes a general subset of E^{N} and in almost all cases of interest is a smooth submanifold, possibly with boundary. When encountered in the discussion, linear or affine subspaces will be explicitly identified as such.
- K. Y. J. Zhang and P. Main, “Histogram matching as a new density modification technique for phase refinement and extension of protein molecules,” Acta Crystallogr. Sect. A 46, 41–46 (1990).
- V. Elser, “Linear time heuristic for the bipartite Euclidean matching problem,” (manuscript available from the author: ve10@cornell.edu).
- In the case of support constraint with positivity, the constraint subspace is a smooth space with boundary, and the relevant dimensionality is that of the space without boundary.
- A. Walther, “The question of phase retrieval in optics,” Opt. Acta 10, 41–49 (1963).
- For a smooth subspace C with tangent space X at a∈C, the affine approximation to C at a is the space C^{′} =X+ a. By taking the set of all differences of elements in C^{′}, one recovers the linear space: X=C^{′} −C^{′}.
- V. Elser, “Random projections and the optimization of an algorithm for phase retrieval,” J. Phys. A. Math. Gen. 35, 1–13 (2002).
- D. Sayre, “The squaring method: a new method for phase determination,” Acta Crystallogr. 5, 60–65 (1952).
- T. Debaerdemaeker, C. Tate, and M. M. Woolfson, “On the application of phase relationships to complex structures. XXVI. Developments of the Sayre-equation tangent formula,” Acta Crystallogr., Sect. A 44, 353–357 (1988).
- D. Sayre, “On least-squares refinement of the phases of crystallographic structure factors,” Acta Crystallogr., Sect. A 28, 210–212 (1972).
- H. A. David, Order Statistics, 2nd ed. (Wiley, New York, 1981).
- C. M. Weeks, H. A. Hauptman, G. D. Smith, R. H. Blessing, M. M. Teeter, and R. Miller, “Crambin: a direct solution for a 400 atom structure,” Acta Crystallogr., Sect. D 51, 33–38 (1995).
- R. Miller, G. T. DeTitta, R. Jones, D. A. Langs, C. M. Weeks, and H. A. Hauptman, “On the application of the minimal principle to solve unknown structures,” Science 259, 1430–1433 (1993).
- H. H. Bauschke, P. L. Combettes, and D. R. Luke, “Phase retrieval, Gerchberg–Saxton algorithm, and Fienup vari ants: a view from convex optimization,” J. Opt. Soc. Am. A 19, 1334–1345 (2002).
Cited By |
Alert me when this paper is cited |
OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.
« Previous Article | Next Article »
OSA is a member of CrossRef.